On the Modularization Theorem for logical specifications

DOI10.1016/0020-0190(94)00203-BzbMath0875.68631OpenAlexW1993161560MaRDI QIDQ674000

Thomas S. E. Maibaum, Paulo A. S. Veloso

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00203-b

zbMATH Keywords

Software engineeringTheory of computationProgram correctnessProgram specificationData typesFormal specificationsSoftware design and implementation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

On methods for safe introduction of operations ⋮ On pushout consistency, modularity and interpolation for logical specifications ⋮ An institution-independent proof of the Beth definability theorem ⋮ On local modularity and interpolation in entailment systems. ⋮ On local modularity variants and \(\Pi\)-institutions ⋮ On a generalized modularization theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topoi. The categorial analysis of logic
• Characterizing the regular prefix codes and right power-bounded languages
• Module algebra
• On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types

This page was built for publication: On the Modularization Theorem for logical specifications