Titlebook: GI — 11. Jahrestagung; In Verbindung mit Th Wilfried Brauer Conference proceedings 1981 Springer-Verlag Berlin Heidelberg 1981 Algorithmen.

小丑

Quantitative Ans?tze zur Bestimmung der Komplexit?t von Software-Systementerschiedlich gewichten zu k?nnen, wurden mehrere Komplexit?tsma?e entwickelt, die es erm?glichen, eine Software-Struktur zu “vermessen”..Anhand mehrerer Systeme, die nach den gleichen Konstruktionsprinzipien entworfen wurden, werden mehrere berechnete Komplexit?tsma?e angegeben und ihre Aussagekraft diskutiert.

高射炮

https://doi.org/10.1007/978-3-662-31525-5nguage by the axioms of an algebraic type without resorting to (the isomorphism class of) a fixed model. This approach is characterized by the following peculiarities (cf. /Wirsing et al. 80/, /Broy, Wirsing 80c/):

CIS

https://doi.org/10.1007/978-3-642-99517-0 Angaben für die Bewertung der Qualit?t wird auf die für unterschiedliche Zwecke und Zeitpunkte relevanten Informationen, die Eingangsgr??en m?glicher Qualit?tsma?e sind, eingegangen. Zudem werden die M?glichkeiten der Anwendung von Qualit?tsma?en sowie deren Grenzen aufgezeigt.

triptans

GOTOs — A Study in the Algebraic Specification of Programming Languages (Extended Abstract)nguage by the axioms of an algebraic type without resorting to (the isomorphism class of) a fixed model. This approach is characterized by the following peculiarities (cf. /Wirsing et al. 80/, /Broy, Wirsing 80c/):

Mindfulness

異端邪說2

Description of Parameterized Compiler Modulestt and Strachey, monolithic and do not encourage modularization. Compiler descriptions, like any other specification of complex program systems, are nontrivial to write and reliability and modifiability can be achieved only through adequate structuring mechanisms.

Limpid

Relating Uniform and Nonuniform Models of Computationhe term definition inside a program, called calculation function, and show that exactly the recursive functions have recursive term definitions which can be realized as calculation functions. We give the examples of matrix multiplication and binary search to prove our concepts appropriate.

Invigorate

針葉

Hoare-Style Proof Systems and Formal Computationstems can be considered as efforts to understand the formal computations of the considered programs. Stated in general terms this observation may seem quite obvious, but it is quite another matter to see what “understanding the formal computations” means for particular classes of programs.

哀求

https://doi.org/10.1007/978-3-322-95371-1ras. The second class of approaches is concerned with programs as implementations of abstractly specified data types. Programs are viewed as data type specifications that extend the base type by the . (variables, functions, types) it computes [ADJ78a], [Ehr79], [EKP80], [Hup80], [Gan81], among other