unknown authors
http://www.cs.man.ac.uk/~banach/some.pubs/Retrench.Dyn.Asp.TL.ACMT.ps.gz
Add To MetaCart
Abstract:
Dynamic aspects of retrenchments through temporal logic Abstract — Refinement is used as a way to verify an implementation with respect to a specification. States of related systems are linked through a so called gluing invariant which remains always true during the synchronous execution of both systems. Refinement is a sufficient condition for this property. Retrenchment is a generalization of refinement which relax the constraints between both systems. This paper proposes a temporal logic counterpart for some specific forms of retrenchment. Index Terms — refinement, retrenchment, temporal logics, TLA
Citations
| 490 | The B-Book: Assigning Programs to Meanings – Abrial - 1996 |
| 189 | Refinement Calculus: A Systematic Introduction – Back, Wright - 1998 |
| 102 | Finite Transition Systems – Arnold - 1994 |
| 101 | Hybrid I/O automata – Lynch, Segala, et al. - 1996 |
| 81 | The Coq proof assistant reference manual - version 6.3.1 – Barras, Boutin, et al. - 1999 |
| 80 | Data Refinement: Model-Oriented Proof Methods and their Comparison – Roever, Engelhardt - 1998 |
| 56 | Mechanical Verification of Concurrent Systems with TLA – Engberg, Grnning, et al. - 1992 |
| 13 | Retrenchment, refinement and simulation – Banach, Poppleton - 2000 |
| 4 | Specifying Systems:The TLA+ Language and Tools for Hardware and Software Engineers – Lamport - 2002 |
| 1 | An encoding of TLA in Isabelle – Merz - 1999 |
