Results 11  20
of
49
Foundations of Heterogeneous Specification
"... We provide a semantic basis for heterogeneous specifications that not only involve different logics, but also different kinds of translations between these. We show that Grothendieck institutions based on spans of (co)morphisms can serve as a unifying framework providing a simple but powerful semant ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
(Show Context)
We provide a semantic basis for heterogeneous specifications that not only involve different logics, but also different kinds of translations between these. We show that Grothendieck institutions based on spans of (co)morphisms can serve as a unifying framework providing a simple but powerful semantics for heterogeneous specification.
CASL: From Semantics to Tools
 TACAS 2000, LNCS 1785
, 2000
"... CASL, the common algebraic specification language, has been developed as a language that subsumes many previous algebraic specification frameworks and also provides tool interoperability. CASL is a complex language with a complete formal semantics. It is therefore a challenge to build good tools for ..."
Abstract

Cited by 16 (10 self)
 Add to MetaCart
(Show Context)
CASL, the common algebraic specification language, has been developed as a language that subsumes many previous algebraic specification frameworks and also provides tool interoperability. CASL is a complex language with a complete formal semantics. It is therefore a challenge to build good tools for CASL. In this work, we present and discuss the Bremen HOLCASL system, which provides parsing, static checking, conversion to LaTeX and theorem proving for CASL specifications. To make tool construction manageable, we have followed some guidelines: reuse of existing tools, interoperability of tools developed at different sites, and construction of generic tools that can be used for several languages. We describe the structure of and the experiences with our tool and discuss how the guidelines work in practice.
Formal Interoperability
, 1998
"... this paper I briefly sketch recent work on metalogical foundations that seems promising as a conceptual basis on which to achieve the goal of formal interoperability. Specificaly, I will briefly discuss: ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
this paper I briefly sketch recent work on metalogical foundations that seems promising as a conceptual basis on which to achieve the goal of formal interoperability. Specificaly, I will briefly discuss:
Permissive Subsorted Partial Logic in CASL
, 1997
"... . This paper presents a permissive subsorted partial logic used in the CoFI Algebraic Specification Language. In contrast to other ordersorted logics, subsorting is not modeled by set inclusions, but by injective embeddings allowing for more general models in which subtypes can have different data t ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
. This paper presents a permissive subsorted partial logic used in the CoFI Algebraic Specification Language. In contrast to other ordersorted logics, subsorting is not modeled by set inclusions, but by injective embeddings allowing for more general models in which subtypes can have different data type representations. Furthermore, there are no restrictions like monotonicity, regularity or local filtration on signatures at all. Instead, the use of overloaded functions and predicates in formulae is required to be sufficiently disambiguated, such that all parses have the same semantics. An overload resolution algorithm is sketched. 1 Introduction During the past decades a large number of algebraic specification languages have been developed. The presence of so many similar specification languages with no common framework hinders the dissemination and application of research results in algebraic specification. In particular, it makes it difficult to produce educational material, to reus...
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 12 (7 self)
 Add to MetaCart
(Show Context)
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
Reasoning Support for CASL with Automated Theorem Proving Systems
 In WADT 2006, LNCS 4409
, 2007
"... Abstract. We connect the algebraic specification language Casl with a variety of automated firstorder provers. The heart of this connection is an institution comorphism from Casl to SoftFOL (softly typed firstorder logic); the latter is then translated to the provers ’ input syntaxes. We also descr ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
(Show Context)
Abstract. We connect the algebraic specification language Casl with a variety of automated firstorder provers. The heart of this connection is an institution comorphism from Casl to SoftFOL (softly typed firstorder logic); the latter is then translated to the provers ’ input syntaxes. We also describe a GUI integrating the translations and the provers into the Heterogeneous Tool Set. We report on experiences with provers, which led to finetuning of the translations. This framework can also be used for checking consistency of specifications. 1
The OntoLogical Translation Graph
"... We present an overview of the landscape of ontology languages, mostly pertaining to the firstorder paradigm. In particular, we present a uniform formalisation of these languages based on the institution theoretical framework, allowing a systematic treatment and analysis of the translational relatio ..."
Abstract

Cited by 11 (10 self)
 Add to MetaCart
We present an overview of the landscape of ontology languages, mostly pertaining to the firstorder paradigm. In particular, we present a uniform formalisation of these languages based on the institution theoretical framework, allowing a systematic treatment and analysis of the translational relationships between the various languages and a general analysis of properties of such translations. We also discuss the importance of language translation from the point of view of ontological modularity and logical pluralism, and for the borrowing of tools and reasoners between languages.
Ontologies for the Semantic Web in CASL
 WADT 2004, LNCS 3423
, 2005
"... This paper describes a sublanguage of Casl, called CaslDL, that corresponds to the Web Ontology Language (OWL) being used for the semantic web. OWL can thus benefit from Casl’s strong typing discipline and powerful structuring concepts. Vice versa, the automatic decision procedures available for OW ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
(Show Context)
This paper describes a sublanguage of Casl, called CaslDL, that corresponds to the Web Ontology Language (OWL) being used for the semantic web. OWL can thus benefit from Casl’s strong typing discipline and powerful structuring concepts. Vice versa, the automatic decision procedures available for OWL DL (or more precisely, the underlying description logic SHOIN(D)) become available for a sublanguage of Casl. This is achieved via translations between CaslDL and SHOIN(D), formalized as socalled institution comorphisms.
Synchronization of Logics with Mixed Rules: Completeness Preservation
 In Algebraic Methodology and Software Technology  AMAST'97
, 1997
"... . Several mechanisms for combining logics have appeared in the literature. Synchronization is one of the simplest: the language of the combined logic is the disjoint union of the given languages, but the class of models of the resulting logic is a subset of the cartesian product of the given classes ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
. Several mechanisms for combining logics have appeared in the literature. Synchronization is one of the simplest: the language of the combined logic is the disjoint union of the given languages, but the class of models of the resulting logic is a subset of the cartesian product of the given classes of models (the interaction between the two logics is imposed by constraining the class of pairs of models). Herein, we give both a modeltheoretic and a prooftheoretic account of synchronization as a categorial construction (using coproducts and cocartesian liftings) . We also prove that soundness is preserved by possibly constrained synchronization and state sufficient conditions for preservation of model existence and strong completeness. We provide an application to the combination of dynamic logic and linear temporal logic. Keywords: combination of logics, synchronization of logics, model existence, completeness, dynamic logic, temporal logic. 1 Introduction There has been a recent g...
Moving Specification Structures Between Logical Systems
 13th WADT’98
, 1998
"... The conditions under which a formal system for reasoning about structural specifications, built over one logical system could be reused for reasoning about structured specifications built over another logical system are formulated and studied. Following Goguen and Burstall, the notion of a logical s ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
The conditions under which a formal system for reasoning about structural specifications, built over one logical system could be reused for reasoning about structured specifications built over another logical system are formulated and studied. Following Goguen and Burstall, the notion of a logical system is formalized as an institution and extended to a Dinstitution. A new function between classes of specifications, inspired by a similar function from [HST 94], is defined as a natural extension of institution representations to structured specifications. 1