Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. Jonsson (1985)
A model and proof system for asynchronous networks
(2003)
T ra n s a c t io n s on C o m p u ta tio n a l Logic, Vol. V
Compositional Verification of Distributed Systems . PhD thesis, Department of Computer Systems, Uppsala University, 1987
A. Ginzburg (1968)
Chapter 5 – Coverings of Automata
M. Abadi, L. Lamport (1988)
The existence of refinement mappings[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
C. Holloway (2000)
Lfm2000 - Fifth NASA Langley Formal Methods Workshop
S. Owicki, D. Gries (1976)
An axiomatic proof technique for parallel programs IActa Informatica, 6
(2004)
ACM Transactions on Computational Logic A Theory of Normed Simulations @BULLET
L. Helmink, A. Sellink, F. Vaandrager (1994)
Proof-Checking a Data Link Protocol
(1997)
Fundamental Algorithms, volume 1 of The A r t of Computer Program
J. Guttag, J. Horning, Stephen Garland, Kevin Jones, A. Modet, Jeannette Wing (1993)
Larch: Languages and Tools for Formal Specification
M. Cin (1980)
The Algebraic Theory of Automata
Y. Lakhnech, S. Bensalem, S. Berezin, S. Owre (2001)
Incremental Verification by Abstraction
N. Lynch, F. Vaandrager (1991)
Forward and Backward Simulations, II: Timing-Based SystemsInf. Comput., 128
Nils Klarlund, F. Schneider (1993)
Proving Nondeterministically Specified Safety Properties Using Progress MeasuresInf. Comput., 107
A. Sistla (1991)
Proving Correctness with Respect to Nondeterministic Safety SpecificationsInf. Process. Lett., 39
R. Milner (1989)
Communication and concurrency
(1998)
Data Refinement by Willem-Paul de Roever
A has finite invisible nondeterminism (fin) if start ( A ) is finite, and for any state s and any finite sequence β over ext ( A ), there
David Griffioen, F. Vaandrager (1998)
Normed Simulations
L. Lamport (1983)
What Good is Temporal Logic?
M. Browne, E. Clarke, O. Grumberg (1988)
Characterizing Finite Kripke Structures in Propositional Temporal LogicTheor. Comput. Sci., 59
or (b) ∃v ∈ b[s] : v τ −→ B u ∧ n(s, v) < n(s, u) ∧ Q(v)
Z. Manna, Anca Browne, H. Sipma, Tomás Uribe (1999)
Visual Abstractions for Temporal Verification
Olaf Müller (1998)
A verification environment for I-O-automata based on formalized meta-theory
(1997)
IOA: A language for specifiying, program ming, and validating distributed systems, September 1997. Available through URL h t t p ://larch.Ics.mit.edu:8001/~garland/ioaLanguage.html
R. Segala, R. Gawlick, Jørgen Søgaard-Andersen, N. Lynch (1994)
Liveness in Timed and Untimed SystemsInf. Comput., 141
J. Groote, J. Springintveld (1995)
Focus points and convergent process operators: a proof strategy for protocol verificationJ. Log. Algebraic Methods Program., 49
D. Knuth (1968)
The Art of Computer Programming
J. Groote, J. Springintveld (1995)
Focus Points and Convergent Process Operators
B. Jonsson (1994)
Compositional specification and verification of distributed systemsACM Trans. Program. Lang. Syst., 16
J. gaard-Andersen, N. Lynch, B. Lampson (1993)
Correctness of Communications Protocols, A case Study
B. Jonsson (1991)
Simulations Between Specifications of Distributed Systems
(1997)
Fundamental Algorithms, 3rd ed
A preliminary version of this paper appeared as Sections 1 and 2 in [GV98]
(1995)
Lecture Notes in Computer Science
D. Knuth (1997)
The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition
R. Nicola, F. Vaandrager (1990)
Three logics for branching bisimulation[1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science
N. Lynch, F. Vaandrager (1993)
Forward and backward simulations, part II: timing-based systems
(1998)
AND E n g e lh ard t, k
(1997)
IOA: A language for specifiying, programming , and validating distributed systems
S. Bensalem, Y. Lakhnech, Hassen Saïdi (1996)
Powerful Techniques for the Automatic Generation of Invariants
N. Lynch, M. Tuttle (1987)
Hierarchical correctness proofs for distributed algorithms
R. Milner (1971)
An Algebraic Definition of Simulation Between Programs
Marino Miculan, Ivan Scagnetto, F. Honsell (2008)
Types for Proofs and Programs, 1512
P. Wolper (1997)
The meaning of “formal”: from weak to strong formal methodsInternational Journal on Software Tools for Technology Transfer, 1
E. Stark (1986)
Proving Entailment Between Conceptual State Specifications
Rob, J., van, Glabbeek, W., Peter, Weijland (1996)
Branching time and abstraction in bisimulation semanticsJ. ACM, 43
Vaandrager
C. Baier, Marielle Stoelinga (2000)
Norm Functions for Probabilistic Bisimulations with Delays
T. Basten (1996)
Branching Bisimilarity is an Equivalence Indeed!Inf. Process. Lett., 58
W. Roever, Kai Engelhardt (1998)
Data Refinement: Model-Oriented Proof Methods and their Comparison
T. Nipkow, Konrad Slind (1994)
I/Q Automata in Isabelle/HOL
Nils Klarlund, F. Schneider (1989)
Verifying Safety Properties Using Non-deterministic Infinite-state Automata
S. Bensalem, Vijay Ganesh, Y. Lakhnech, C. Muñoz, S. Owre, H. Ruess, J. Rushby, Vlad Rusu, Hassen Saiedi, N. Shankar (2000)
An Overview of SAL
M. Devillers, David Griffioen, J. Romijn, F. Vaandrager (2000)
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394Formal Methods in System Design, 16
N. Lynch, F. Vaandrager (1995)
Forward and Backward Simulations: I. Untimed SystemsInf. Comput., 121
M. Devillers, David Griioen, Olaf Uller (1997)
Possibly Infinite Sequences in Theorem Provers: A Comparative Study
B. Jonsson (1989)
On Decomposing and Refining Specifications of Distributed Systems
(2000)
Received July ACM Transactions on Computational Logic
W. Griffioen (2000)
Studies in computer aided verification of protocols
Seif Haridi (1992)
Distributed Algorithms, 647
(1998)
Data Refinement: Theory
Postscript and PVS sources
Jørgen Søgaard-Andersen, Stephen Garland, J. Guttag, N. Lynch, A. Pogosyants (1993)
Computer-Assisted Simulation Proofs
S. Owre, J. Rushby, N. Shankar, F. Henke (1995)
Formal Verification for Fault-Tolerant Architectures: Prolegomena to the Design of PVSIEEE Trans. Software Eng., 21
(1996)
Extended version as University of Oregon
Z. Ariola, J. Klop (1996)
Equational Term Graph RewritingFundam. Informaticae, 26
We leave it up to the reader to work out adapted versions of the normed history and prophecy relations
Kedar Namjoshi (1997)
A Simple Characterization of Stuttering Bisimulation
In existing simulation proof techniques, a single step in a lower-level specification may be simulated by an extended execution fragment in a higher-level one. As a result, it is cumbersome to mechanize these techniques using general-purpose theorem provers. Moreover, it is undecidable whether a given relation is a simulation, even if tautology checking is decidable for the underlying specification logic. This article studies various types of normed simulations . In a normed simulation, each step in a lower-level specification can be simulated by at most one step in the higher-level one, for any related pair of states. In earlier work we demonstrated that normed simulations are quite useful as a vehicle for the formalization of refinement proofs via theorem provers. Here we show that normed simulations also have pleasant theoretical properties: (1) under some reasonable assumptions, it is decidable whether a given relation is a normed forward simulation, provided tautology checking is decidable for the underlying logic; (2) at the semantic level, normed forward and backward simulations together form a complete proof method for establishing behavior inclusion, provided that the higher-level specification has finite invisible nondeterminism.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Oct 1, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.