Results 1 
9 of
9
The UniForM Workbench, a Universal Development Environment for Formal Methods
 FM'99
, 1999
"... The UniForM Workbench supports combination of Formal Methods (on a solid logical foundation), provides tools for the development of hybrid, realtime or reactive systems, transformation, verification, validation and testing. Moreover, it... ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
The UniForM Workbench supports combination of Formal Methods (on a solid logical foundation), provides tools for the development of hybrid, realtime or reactive systems, transformation, verification, validation and testing. Moreover, it...
Categorial Fibring of Logics with Terms and Binding Operators
 FRONTIERS OF COMBINING SYSTEMS 2, STUDIES IN LOGIC AND COMPUTATION
, 1998
"... Categorial characterizations are given of both unconstrained and constrained fibring of Hibert calculi and interpretation systems for languages with variables, terms, variable binding operators and modal like operators. Some preliminary transference results are established. A brief comparison wi ..."
Abstract

Cited by 14 (10 self)
 Add to MetaCart
Categorial characterizations are given of both unconstrained and constrained fibring of Hibert calculi and interpretation systems for languages with variables, terms, variable binding operators and modal like operators. Some preliminary transference results are established. A brief comparison with model theoretic parchments is included.
Heterogeneous development graphs and heterogeneous borrowing
 In M. Nielsen (Ed.) Foundations of Software Science and Computation Structures (FOSSACS02
, 2002
"... Abstract. Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. Often, different aspects of a software system have to be specified in different logics, since the construction of a huge lo ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
Abstract. Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. Often, different aspects of a software system have to be specified in different logics, since the construction of a huge logic covering all needed features would be too complex to be feasible. Therefore, we introduce heterogeneous development graphs as a means to cope with heterogeneous specifications. We cover both the semantics and the proof theory of heterogeneous development graphs. A proof calculus can be obtained either by combining proof calculi for the individual logics, or by representing these in some “universal ” logic like higherorder logic in a coherent way and then “borrowing” its calculus for the heterogeneous language. 1
Combining Logics: Parchments Revisited
 In Recent Trends in Algebraic Development Techniques, volume 2267 of LNCS
, 2001
"... generalizes the common situation when truthvalues are ordered, we require a whole Tarskian closure operation as in [2]. In the sequel, AlgSig denotes the category of algebraic many sorted signatures with a distinguished sort (for formulae) and morphisms preserving it. Given such a signature hS; ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
generalizes the common situation when truthvalues are ordered, we require a whole Tarskian closure operation as in [2]. In the sequel, AlgSig denotes the category of algebraic many sorted signatures with a distinguished sort (for formulae) and morphisms preserving it. Given such a signature hS; Oi, we denote by Alg(hS; Oi) the category of hS; Oi algebras, and by cAlg(hS; Oi) the class of all pairs hA; i with A 2 jAlg(hS; Oi)j and a closure operation on A . Denition 1. A layered parchment is a tuple P = hSig; L; Mi where: { Sig is a category (of abstract<F13
NonTruthFunctional Fibred Semantics
, 2001
"... wing the ideas in [4], to cope with possible non{truth{functionality of constructors. In the spirit of the theory of institutions and general logics [8, 9], we consider a logic to consist of an indexing functor to a suitable category of logic systems. In our case, the logic systems of interest are n ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
wing the ideas in [4], to cope with possible non{truth{functionality of constructors. In the spirit of the theory of institutions and general logics [8, 9], we consider a logic to consist of an indexing functor to a suitable category of logic systems. In our case, the logic systems of interest are non{truth{functional (ntf) rooms . For simplicity, we shall only work at this level of abstraction. As shown in [3], everything can be smoothly lifted to the fully edged indexed case. In the sequel, AlgSig' denotes the category of algebraic many sorted signatures with a distinguished sort ' (for formulae) and morphisms preserving it. Given one such signature , we denote by Alg() the category of {algebras and {algebra homomorphisms, and by cAlg() the class of all pairs hA; i with A a<
Cryptomorphisms at Work
 Recent Trends in Algebraic Development Techniques  Selected Papers, volume 3423 of Lecture Notes in Computer Science
, 2005
"... We show that the category proposed in [5] of logic system presentations equipped with cryptomorphisms gives rise to a category of parchments that is both complete and translatable to the category of institutions, improving on previous work [15]. We argue that limits in this category of parchment ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We show that the category proposed in [5] of logic system presentations equipped with cryptomorphisms gives rise to a category of parchments that is both complete and translatable to the category of institutions, improving on previous work [15]. We argue that limits in this category of parchments constitute a very powerful mechanism for combining logics.
Completeness Results for Fibred Parchments Beyond the Propositional Base
 Recent Trends in Algebraic Development Techniques  Selected Papers, volume 2755 of Lecture Notes in Computer Science
, 2003
"... In [6] it was shown that fibring could be used to combine institutions presented as cparchments, and several completeness preservation results were established. However, their scope of applicability was limited to propositionalbased logics. Herein, we extend these results to a broader class of ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
In [6] it was shown that fibring could be used to combine institutions presented as cparchments, and several completeness preservation results were established. However, their scope of applicability was limited to propositionalbased logics. Herein, we extend these results to a broader class of logics, possibly including variables, terms and quantifiers.
Context Parchments
"... . The paper introduces a notion of context parchment. The notion is illustrated by several examples. It is shown, that every logical context parchment generates a context institution. Morphisms between context parchments are introduced, thus yielding a category of context parchments. The use of uni ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. The paper introduces a notion of context parchment. The notion is illustrated by several examples. It is shown, that every logical context parchment generates a context institution. Morphisms between context parchments are introduced, thus yielding a category of context parchments. The use of universal constructions in the category of context parchments, for modular construction of logics is discussed and illustrated by examples. 1 Introduction Institutions, were introduced to provide an "abstract model theory for specification and programming"quoting from the title of [8]. The modeltheoretic view of logic, advocated by institutions, seems to be very natural in computer science applications, considering the fact, that our main concern is to specify, create, and reason about concrete objectssuch as programs or VLSI chips. Context institutions (cf. [13]), enrich the structure of institutions by adding notions such as contexts, and substitutions, retaining at the same time the...
Presenting Context Institutions: Context Parchments
"... . The paper introduces a notion of context parchment. The notion is illustrated by several examples. It is shown, that every logical context parchment generates a context institution. Morphisms between context parchments are introduced, thus yielding a category of context parchments. The use of uni ..."
Abstract
 Add to MetaCart
. The paper introduces a notion of context parchment. The notion is illustrated by several examples. It is shown, that every logical context parchment generates a context institution. Morphisms between context parchments are introduced, thus yielding a category of context parchments. The use of universal constructions in the category of context parchments, for modular construction of logics is discussed and illustrated by examples. 1 Introduction Institutions, provide an "abstract model theory for specification and programming" quoting from the title of [8]. The modeltheoretic view of logic, advocated by institutions, seems to be very natural in computer science applications, considering the fact, that our main concern is to specify, create, and reason about concrete objectssuch as programs or VLSI chips. Context institutions (cf. [13]), enrich the structure of institutions by adding notions such as contexts, and substitutions, retaining at the same time the modeltheoretic f...