Abstract
Reuse of correctly specified software is crucial in bottomup program development. Compositional specification formalisms have been designed to reduce the specification of a syntactically composed construct to specifications of its components, and therefore support topdown development methodology. Thus, the integration of reuse of correctly specified software components in a compositional setting calls for adaptation of a given specification to specifications needed in particular circumstances (depending on their application). Proof systems in which such adaptation steps can be performed whenever they are valid are called modular complete [Z89]. We present a generic way of constructing such systems for sequential and concurrent Hoare logics.
Cite
CITATION STYLE
Zwiers, J., Hannemann, U., Lakhneche, Y., de Roever, W. P., & Stomp, F. (1996). Modular completeness: Integrating the reuse of specified software in top-down program development. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1051, pp. 595–608). Springer Verlag. https://doi.org/10.1007/3-540-60973-3_109
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
