Results 1  10
of
14
Observational logic
 IN ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY (AMAST'98
, 1999
"... We present an institution of observational logic suited for statebased systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required ..."
Abstract

Cited by 57 (10 self)
 Add to MetaCart
We present an institution of observational logic suited for statebased systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required to be compatible with the indistinguishability relation determined by the given observers. In particular, we introduce a homomorphism concept for observational algebras which adequately expresses observational relationships between algebras. Then we consider a flexible notion of observational signature morphism which guarantees the satisfaction condition of institutions w.r.t. observational satisfaction of arbitrary firstorder sentences. From the proof theoretical point of view we construct a sound and complete proof system for the observational consequence relation. Then we consider structured observational specifications and we provide a sound and complete proof system for such specifications by using a general, institutionindependent result of [6].
Modular construction of modal logics
 Concurrency Theory, CONCUR 04, volume 3170 of Lect. Notes Comput. Sci
, 2004
"... Abstract. We present a modular approach to defining logics for a wide variety of statebased systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
(Show Context)
Abstract. We present a modular approach to defining logics for a wide variety of statebased systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems. We show that the syntax, semantics and proof systems associated to such logics can all be derived in a modular way. Moreover, we show that the logics thus obtained inherit soundness, completeness and expressiveness properties from their building blocks. We apply these techniques to derive sound, complete and expressive logics for a wide variety of probabilistic systems. 1
Observational Logic, ConstructorBased Logic, and their Duality
, 2002
"... Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this p ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
Observability and reachability are important concepts for formal software development. While observability concepts are used to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this paper we first reconsider the observational logic institution which provides a logical framework for dealing with observability. Then we develop in a completely analogous way the constructorbased logic institution which formalizes a novel treatment of reachability. Both institutions are tailored to capture the semantically correct realizations of a specification from either the observational or the reachability point of view. We show that there is a methodological and even formal duality between both frameworks. In particular, we establish a correspondence between observer operations and datatype constructors, observational and constructorbased algebras, fully abstract and reachable algebras, and observational and inductive consequences of specifications. The formal duality between the observability and reachability concepts is established in a categorytheoretic setting.
Unit Testing for Casl Architectural Specifications
 Proc. 27th Intl. Symp. on Mathematical Foundations of Computer Science
, 2002
"... The problem of testing modular systems against algebraic specifications is discussed. We focus on systems where the decomposition into parts is specified by a Caslstyle architectural specification and the parts (units) are developed separately, perhaps by an independent supplier. We consider ho ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
The problem of testing modular systems against algebraic specifications is discussed. We focus on systems where the decomposition into parts is specified by a Caslstyle architectural specification and the parts (units) are developed separately, perhaps by an independent supplier. We consider how to test such units without reference to their context of use. This problem is most acute for generic units where the particular instantiation cannot be predicted.
Towards Trustworthy Specifications I: Consistency Checks
"... As the first of two methodological devices aimed at increasing the trust in the `correctness' of a specification, we develop a calculus for proving consistency of Casl specifications. It turns out to be possible to delegate large parts of the proof load to syntactical criteria by structuring co ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
(Show Context)
As the first of two methodological devices aimed at increasing the trust in the `correctness' of a specification, we develop a calculus for proving consistency of Casl specifications. It turns out to be possible to delegate large parts of the proof load to syntactical criteria by structuring consistency proofs along the given specification structure, so that only in rather few remaining focus points, actual theorem proving is required. The practical usability of the resulting calculus is demonstrated by extensive examples taken from the Casl library of basic data types.
A Formal Approach to SpecificationBased BlackBox Testing
 In Proceedings of the Workshop on Modelling Software System Structures in a Fastly Moving Scenario
"... This paper introduces an initial account of a formal methodology for specificationbased blackbox verification testing of software artefacts against their specifications, as well as for validation testing of specifications against the socalled application concept [14] ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
This paper introduces an initial account of a formal methodology for specificationbased blackbox verification testing of software artefacts against their specifications, as well as for validation testing of specifications against the socalled application concept [14]
Proving Behavioral Refinements of COLSpecifications ⋆
"... Abstract. The COL institution (constructorbased observational logic) has been introduced as a formal framework to specify both generationand observationoriented properties of software systems. In this paper we consider behavioral refinement relations between COLspecifications taking into account ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. The COL institution (constructorbased observational logic) has been introduced as a formal framework to specify both generationand observationoriented properties of software systems. In this paper we consider behavioral refinement relations between COLspecifications taking into account implementation constructions. We propose a general strategy for proving the correctness of such refinements by reduction to (standard) firstorder theorem proving with induction. Technically our strategy relies on appropriate proof rules and on a lifting construction to encode the reachability and observability notions of the COL institution. 1
Compositional Reasoning for Processes and Data
"... The specification language CSPCASL allows the modelling of processes and data within a single framework. CSPCASL allows one to use the specification structuring operators, such as parametrization and union, to create structured specifications. Here we outline proof calculi that exploit specificati ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
The specification language CSPCASL allows the modelling of processes and data within a single framework. CSPCASL allows one to use the specification structuring operators, such as parametrization and union, to create structured specifications. Here we outline proof calculi that exploit specification structure, allowing for refinement and deadlock analysis. 1
Compositional Modelling and Reasoning in an Institution for Processes and Data
"... Abstract. The language CspCasl combines specifications of data and processes. We give an institution based semantics to CspCasl that allows us to reuse the institution independent structuring mechanisms of Casl. Furthermore, we extend CspCasl with a notion of refinement that reconciles the diffe ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The language CspCasl combines specifications of data and processes. We give an institution based semantics to CspCasl that allows us to reuse the institution independent structuring mechanisms of Casl. Furthermore, we extend CspCasl with a notion of refinement that reconciles the differing philosophies behind the refinement notions for Csp and Casl. We develop a compositional proof calculus for refinement along the Casl structuring mechanisms, and demonstrate that compositional proof techniques along parallel process composition from the context of Csp lifts to structured CspCasl specifications. 1