Proving Temporal Properties of Z Specifications Using Abstraction
نویسندگان
چکیده
This paper presents a systematic approach to proving temporal properties of arbitrary Z specifications. The approach involves (i) transforming the Z specification to an abstract temporal structure (or state transition system), (ii) applying a model checker to the temporal structure, (iii) determining whether the temporal structure is too abstract based on the model checking result and (iv) refining the temporal structure where necessary. The approach is based on existing work from the model checking literature, adapting it to Z.
منابع مشابه
Proving Possibility Properties
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA (Temporal Logic of Actions) specifications.
متن کاملAutomated Testing From Z Specifications
This paper considers the problem of automatically generating tests from Z specifications based on userdefined testing criteria. Automation is facilitated by formally specifying heuristics for generating tests that can be applied to a specification using general purpose theorem proving tools. The formal specification of the heuristics also allows desirable properties to be checked and comparativ...
متن کاملProving Musical Properties using a temporal Concurrent Constraint Calculus
We show how the ntcc calculus, a model of temporal concurrent constraint programming with the capability of modeling asynchronous and non-deterministic timed behavior, can be used for modeling real musical processes. We use the nondeterminism facility of ntcc to build weaker representations of musical processes that greatly simplifies the formal expression and analysis of its properties. We arg...
متن کاملCompositional Abstraction for Concurrent Programs
We present a methodology for automatically constructing an abstraction of concurrent programs against safety specifications based on finite state machine. And then automatically extract an initial abstract model from source code using predicate abstraction and theorem proving. However, the process of extracting a finite model from a program using predicate abstraction can be exponential in the ...
متن کاملTemporal Logic Verifications for UML, the Vending Machine Example
To verify UML specifications, we need formal specification, that is a well-known difficulty. Since UML allows both the use of data types and dynamic specifications, the verification of temporal logic properties leads to other problems. This paper presents an example of a system specified in UML and completed with a formal and component-oriented approach. We use an algebraic approach called Grap...
متن کامل