Results 1 - 10
of
135
Modular Refinement in Novel Schema Calculi
- In APSEC 2003
"... Using the language Z for more than specification is hindered by the fact that its algebra of schemas is not monotonic with respect to refinement; so specification is modular, but development is not. In this paper we isolate the reasons why Z suffers from these problems and we describe alternative mo ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
models for specifications and schema operations which are monotonic. This leads us to explore a number of theoretical and pragmatic questions: the former concern logics for modular refinement; the latter explore the use of novel schema calculi in practice. 1
Thread-modular Abstraction Refinement
- In: CAV
, 2003
"... We present an algorithm called Tar ("Thread-modular Abstraction Refinement") for model checking safety properties of concurrent software. The Tar algorithm uses thread-modular assume-guarantee reasoning to overcome the exponential complexity in the control state of multithreaded progra ..."
Abstract
-
Cited by 59 (5 self)
- Add to MetaCart
We present an algorithm called Tar ("Thread-modular Abstraction Refinement") for model checking safety properties of concurrent software. The Tar algorithm uses thread-modular assume-guarantee reasoning to overcome the exponential complexity in the control state of multithreaded
On the Semantics of Refinement Calculi
, 2000
"... Refinement calculi for imperative programs provide an integrated framework for programs and specifications and allow one to develop programs from specifications in a systematic fashion. The semantics of these calculi has traditionally been de ned in terms of predicate transformers and poses several ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Refinement calculi for imperative programs provide an integrated framework for programs and specifications and allow one to develop programs from specifications in a systematic fashion. The semantics of these calculi has traditionally been de ned in terms of predicate transformers and poses several
Operation Refinement and Monotonicity in the Schema Calculus
, 2003
"... The schema calculus of Z provides a means for expressing structured, modular specifications. Extending this modularity to program development requires the monotonicity of these operators with respect to refinement. This paper provides a thorough mathematical analysis of monotonicity with respect ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
The schema calculus of Z provides a means for expressing structured, modular specifications. Extending this modularity to program development requires the monotonicity of these operators with respect to refinement. This paper provides a thorough mathematical analysis of monotonicity with respect
Designing and Refining Schema Mappings via Data Examples
- In ACM SIGMOD International Conference on Management of Data (SIGMOD
, 2011
"... A schema mapping is a specification of the relationship between a source schema and a target schema. Schema mappings are fundamental building blocks in data integration and data exchange and, as such, obtaining the right schema mapping constitutes a major step towards the integration or exchange of ..."
Abstract
-
Cited by 20 (6 self)
- Add to MetaCart
of data. Up to now, schema mappings have typically been specified manually or have been derived using mapping-design systems that automatically generate a schema mapping from a visual specification of the relationship between two schemas. We present a novel paradigm and develop a system
Modular reasoning in Z: scrutinising monotonicity and refinement
, 2004
"... The schema calculus operators of Z provide an excellent means for expressing modular specifications but not for undertaking modular reasoning: it is well-known that these operators have poor monotonicity properties. The paper addresses three topics in this context: first, we provide a thorough mathe ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
The schema calculus operators of Z provide an excellent means for expressing modular specifications but not for undertaking modular reasoning: it is well-known that these operators have poor monotonicity properties. The paper addresses three topics in this context: first, we provide a thorough
Axioms in Definitional Calculi
, 1994
"... . This paper introduces a restricted form of the axiom rule in calculi of Partial Inductive Definitions (PID). The paper argues that in calculi of PIDs the distinction between atomic and non-atomic formulae is not as clear as in traditional sequent calculi. Therefore the common restriction of the ax ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
of the axiom rule to the atomic case is not adequate for this type of calculi. A novel proviso for the axiom rule and corresponding provisos for the left and right definition rules are introduced with an accompanying discussion and suggestions for possible applications in the domain of declarative
The Design of Distributed Systems - An Introduction to FOCUS
, 1992
"... Focus is a framework for the systematic formal specification and development of distributed interactive systems and their components. Focus provides models, formalisms and verification calculi for the stepwise specification and development, transformation and verification of such systems. Focus aims ..."
Abstract
-
Cited by 113 (22 self)
- Add to MetaCart
aims at the modular development and implementation of distributed interactive systems through several abstraction levels by stepwise refinement. 1 Chapter 1 Methods for System Development A (distributed) system consists of a family of interacting, conceptually or spatially distributed components. A
Nominal Schema Absorption
"... Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisation of absor ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
of absorption as well as the standard tableau calculus to directly handle the (absorbed) nominal schema axioms. We implement the resulting extension of standard tableau calculi in a novel reasoning system and we integrate further optimisations. In our empirical evaluation, we show the effect
Extending Absorption to Nominal Schemas
"... Abstract. Nominal schemas have recently been introduced as a new approach for the integration of DL-safe rules into the Description Logic framework. The efficient processing of knowledge bases with nominal schemas remains, however, challenging. We address this by extending the well-known optimisatio ..."
Abstract
- Add to MetaCart
-known optimisation of absorption as well as the standard tableau calculus to directly handle the (absorbed) nominal schema axioms. We implement the resulting extension of standard tableau calculi in a novel reasoning system and we integrate further optimisations. In our empirical evaluation, we show the effect
Results 1 - 10
of
135