Results 1  10
of
28
Automatically Checking an Implementation against Its Formal Specification
 IEEE Transactions on Software Engineering
, 2000
"...  ..."
Relating CASL with Other Specification Languages: the Institution Level
, 2000
"... In this work, we investigate various specification languages and their relation to Casl, the recently developed Common Algebraic Specification Language. In particular, we consider the languages Larch, OBJ3, CafeOBJ, ACT ONE, ASF, and HEPtheories, as well as various sublanguages of Casl that more or ..."
Abstract

Cited by 34 (16 self)
 Add to MetaCart
In this work, we investigate various specification languages and their relation to Casl, the recently developed Common Algebraic Specification Language. In particular, we consider the languages Larch, OBJ3, CafeOBJ, ACT ONE, ASF, and HEPtheories, as well as various sublanguages of Casl that more or less directly correspond to these. All these languages are translated to an appropriate sublanguage of Casl. The translation mainly concerns the level of specification inthesmall: the logics underlying the languages are formalized as institutions, and representations among the institutions are developed. However, it is also considered how these translations interact with specification inthelarge. Thus, we obtain one hand translations of any of the abovementioned specification languages to an appropriate sublanguage of Casl. This allows us to take libraries and case studies that have been developed for other languages and reuse them in Casl. On the other hand, we set up institution repre...
Proof Systems for Structured Specifications and Their Refinements
, 1999
"... Reasoning about specifications is one of the fundamental activities in the process of formal program development. This ranges from proving the consequences of a specification, during the prototyping or testing phase for a requirements speci cation, to proving the correctness of refinements (or imple ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
Reasoning about specifications is one of the fundamental activities in the process of formal program development. This ranges from proving the consequences of a specification, during the prototyping or testing phase for a requirements speci cation, to proving the correctness of refinements (or implementations) of specifications. The main proof techniques for algebraic specifications have their origin in equational Horn logic and term rewriting. These proof methods have been well studied in the case of nonstructured speci cations (see Chapters 9 and 10). For large systems of specifications built using the structuring operators of speci cation languages, relatively few proof techniques have been developed yet; for such proof systems, see [SB83, HST94, Wir91, Far92, Cen94, HWB97]. In this chapter we focus on proof systems designed particularly for modular specifications. The aim is to concentrate on the structuring concepts, while abstracting as much as possible from the par...
On the Search for Tractable Ways of Reasoning about Programs
, 2001
"... This paper traces the important steps in the history up to around 1990 of research on reasoning about programs. The main focus is on sequential imperative programs but some comments are made on concurrency. Initially, researchers focussed on ways of verifying that a program satifies its specific ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
This paper traces the important steps in the history up to around 1990 of research on reasoning about programs. The main focus is on sequential imperative programs but some comments are made on concurrency. Initially, researchers focussed on ways of verifying that a program satifies its specification (or that two programs were equivalent). Over time it has become clear that post facto verification is only practical for small programs and attention turned to verification methods which support the development of programs; for larger programs it is necesary to exploit a notion of composability.
A UnifiedAlgebrabased Specification Language for Symbolic Computing
, 1993
"... A precise and perspicuous specification of mathematical domains of computation and their inherently related type inference mechanisms is a prerequisite for the design and systematic development of a system for symbolic computing. This paper describes Formal, a language for giving modular and wellst ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
A precise and perspicuous specification of mathematical domains of computation and their inherently related type inference mechanisms is a prerequisite for the design and systematic development of a system for symbolic computing. This paper describes Formal, a language for giving modular and wellstructured specifications of such domains and particularly of "mathematical objects". A novel framework for algebraic specification involving socalled "unified algebras" has been adopted, where sorts are treated as values. The adoption of this framework aims also at being capable of specifying polymorphism, unifying the notions of "parametric" and "inclusion" polymorphisms. Furthermore, the operational nature of the specification formalisms allows a straightforward transformation into an executable form.
Semantics of architectural specifications in Casl
 Proc. 4th Intl. Conf. Fundamental Approaches to Software Engineering FASE’01, Springer LNCS 2029
, 2001
"... Abstract. We present a semantics for architectural specifications in Casl, including an extended static analysis compatible with modeltheoretic requirements. The main obstacle here is the lack of amalgamation for Casl models. To circumvent this problem, we extend the Casl logic by introducing enrich ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Abstract. We present a semantics for architectural specifications in Casl, including an extended static analysis compatible with modeltheoretic requirements. The main obstacle here is the lack of amalgamation for Casl models. To circumvent this problem, we extend the Casl logic by introducing enriched signatures, where subsort embeddings form a category rather than just a preorder. The extended model functor has amalgamation, which makes it possible to express the amalgamability conditions in the semantic rules in static terms. Using these concepts, we develop the semantics at various levels in an institutionindependent fashion.
An Algebraic Framework For The Definition Of Compositional Semantics Of Normal Logic Programs
, 1994
"... ion) Given two normal programs P1 and P2, the following three facts are equivalent: (i) Sem(P 1) = Sem(P 2) (ii) For every program P , Sem(P [ P 1) = Sem(P [ P 2) (iii) For every program P , MP[P1 = MP[P2 . Proof. It is enough to prove that (iii) implies (i), because the other implications are d ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
ion) Given two normal programs P1 and P2, the following three facts are equivalent: (i) Sem(P 1) = Sem(P 2) (ii) For every program P , Sem(P [ P 1) = Sem(P [ P 2) (iii) For every program P , MP[P1 = MP[P2 . Proof. It is enough to prove that (iii) implies (i), because the other implications are direct consequences of lemma 3.1 and theorem 5.1. Let us suppose that there exists a model A in Mod(; ;) such that F 1(A) 6= F 2(A), where F1 = Sem(P 1) and F2 = Sem(P 2). Then, we will show that there exists a program P such that MP[P1 6= MP[P2 . Let j 2 IN be the least layer such that F 1(A) + j 6= F 2(A) + j or F 1(A) j 6= F 2(A) j . Then we can consider two cases. First, if there exists the given level k 2 IN , and F 1(A) + j 6= F 2(A) + j , for some j < k, then F 1(B) 6= F 2(B) for all models B 2 Mod(; ;) such that A + j = B + i and A j 1 = B i 1 for some layer i. This is the case for the model B such that, for all i 2 IN : B + i = A + j B i = A j 1 In any other cas...
Integrating Semantics for ObjectOriented System Models
"... According to the viewpoint model of software systems development abstract models of different views of the systems are constructed. This separation of concerns... ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
According to the viewpoint model of software systems development abstract models of different views of the systems are constructed. This separation of concerns...
A Generic Component Concept for Integrated Data Type and Process Modeling Techniques
 Universitat Berlin
, 2001
"... In previous papers of the authors a conceptual and a formal model for an integration paradigm for data type and process modeling techniques has been presented. This concept leads to a generic concept of integrated model specifications and corresponding models, where layer four of this integration pa ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In previous papers of the authors a conceptual and a formal model for an integration paradigm for data type and process modeling techniques has been presented. This concept leads to a generic concept of integrated model specifications and corresponding models, where layer four of this integration paradigm includes already a basic component concept. The aim of this paper is to present...
ApproachIndependent Structuring Concepts for RuleBased Systems
 Proc. 16th Int. Workshop on Algebraic Development Techniques (WADT 2002). Volume 2755 of Lecture Notes in Computer Science
, 2002
"... In this paper, we propose new structuring concepts for rulebased systems that are independent of the type of rules and of the type of configurations to which rules are applied. Hence the concepts are applicable in various rulebased approaches allowing one to build up large systems from small compo ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
In this paper, we propose new structuring concepts for rulebased systems that are independent of the type of rules and of the type of configurations to which rules are applied. Hence the concepts are applicable in various rulebased approaches allowing one to build up large systems from small components in a systematic way.