(Heterogeneous) Structured Specifications in Logics Without Interpolation

Pombo, Carlos Gustavo López; Frias, Marcelo F.

doi:10.1007/978-3-319-97879-6_16

Cited by 1 publication

(1 citation statement)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More recently, in [6], all these notions of morphism were investigated in more detail by observing how the direction of the arrows modify its interpretation. In this section we will concentrate only on extending the results presented by Tarlecki in [5], focussing on institution morphisms and comorphisms, since these notions have been used to formalise several concepts arising in software engineering: they are used as the main vehicle for borrowing proofs along logic translation in [5]; for defining heterogeneous development environments for software specifications and designs in [10,51], which provides the foundations of tools like HETS [14] and CafeOBJ [11]; for providing structured specifications in general in [7], and for specific formal languages in [52,53]; for defining proof systems for structured specifications [54,55,56]; and for formalising data and specification refinements in [33,57,52], just to give a few examples.…”

Section: Relating Satisfiability Calculimentioning

confidence: 99%

Satisfiability Calculus: An Abstract Formulation of Semantic Proof Systems

Pombo

Castro

Aguirre

et al. 2019

View full text Add to dashboard Cite

The theory of institutions, introduced by Goguen and Burstall in 1984, can be thought of as an abstract formulation of model theory. This theory has been shown to be particularly useful in computer science, as a mathematical foundation for formal approaches to software construction. Institution theory was extended by a number of researchers, José Meseguer among them, who, in 1989, presented General Logics, wherein the model theoretical view of institutions

show abstract