(Enter summary)
Abstract: The contribution of the paper is two-fold. We give a set of properties expressible as temporal logic formulas such that any system satisfying them is a sequentially consistent memory, and which is sufficiently precise such that every reasonable concrete system that implements a sequentially consistent memory satisfies these properties. Then, we verify these properties on a distributed cache memory system by means of a verification method, based on the use of abstract interpretation which has... (Update)
Context of citations to this paper: More
.... largely theoretical, by Clarke et al. Clarke, Grumberg and Long, 1994) Loiseaux et al. Loiseaux et al., 1995) Graf and Loiseaux (Graf, 1994, Graf and Loiseaux, 1993) Dams et al. Dams and Gerth, 1997) and Kurshan (Kurshan, 1994) Below, we describe four significant...
.... [Plaisted 1981] model checking [Clarke et al. 1994; Dams et al. 1997; Loiseaux et al. 1995] verification of distributed memory systems [Graf 1997], type inference [Cousot 1997b] constraint solving [Caseau 1991] query optimization [Helm et al. 1995] and comparative semantics...
Cited by: More
Abstraction as the Key for Invariant Verification - Bensalem, Graf, Lakhnech
(Correct)
Using Timestamping and History Variables to Verify Sequential.. - Arons (2001)
(Correct)
Verifying a Design Pattern for the Fault-Tolerant Execution.. - Kindler, Shasha (2000)
(Correct)
Similar documents (at the sentence level):
45.6%: Characterization of a Sequentially Consistent Memory and.. - Graf (1995)
(Correct)
Active bibliography (related documents): More All
0.3: Property Preserving Abstractions for the Verification of.. - Loiseaux, Graf, al. (1995)
(Correct)
0.1: A Correctness Proof of a Cache Coherence Protocol - Felty, Stomp (1996)
(Correct)
0.1: Eternity Variables to Simulate Specifications - Hesselink (2002)
(Correct)
Similar documents based on text: More All
0.1: Compositional Minimisation of Finite State Systems.. - Graf, Steffen.. (1996)
(Correct)
0.1: Verification Experiments on the MASCARA Protocol - Jia, Graf (2001)
(Correct)
0.1: Construction of abstract state graphs with PVS - Graf, Saidi (1997)
(Correct)
Related documents from co-citation: More All
7: Model checking for infinite state systems using data abstraction
- Dingel, Filkorn - 1994
6: Property preserving abstractions for the verification of concurrent systems
- Loiseaux, Graf et al. - 1995
6: Experiments in theorem proving and model checking for protocol verification
- Havelund, Shankar - 1996
BibTeX entry: (Update)
S. Graf. Characterization of a sequentially consistent memory and verification of a cache memory by abstraction. Journal of Distributed Computing, 1995. http://citeseer.ist.psu.edu/article/graf95characterization.html More
@article{ graf99characterization,
author = "Susanne Graf",
title = "Characterization of a Sequentially Consistent Memory and Verification of a Cache Memory by Abstraction",
journal = "Distributed Computing",
volume = "12",
number = "2--3",
pages = "75--90",
year = "1999",
url = "citeseer.ist.psu.edu/article/graf95characterization.html" }
Citations (may not include all citations):
815
Abstract interpretation: a unified lattice model for static .. (context) - Cousot, Cousot - 1977
625
ACM Transactions on Programming Languages and Systems (context) - Lamport, logic - 1994
407
Introduction to the ISO specification language LOTOS (context) - Bolognesi, Brinksma - 1988
231
Model checking and abstraction
- Clarke, Grumberg et al. - 1992
195
Parallel Program Design (context) - Chandy, Misra - 1988
106
An algebraic definition of simulation between programs (context) - Milner - 1971
96
Property preserving abstractions for the verification of con..
- Loiseaux, Graf et al. - 1995
75
Analysis of discrete event coordination (context) - Kurshan - 1989
60
Property preserving simulations (context) - Bouajjani, Bensalem et al. - 1992
49
ACM Transactions on Programming Languages and Systems (context) - Afek, Brown et al. - 1993
46
A tool box for the verification of lotos programs
- Cl, Garavel et al. - 1992
40
A tool for symbolic program verification and abstraction
- Graf, Loiseaux - 1993
40
Results on the propositional ¯-calculus (context) - Kozen - 1983
39
not never' revisited: On branching versus linear time (context) - Emerson, Halpern - 1983
35
Specification and development of reactive systems (context) - Pnueli - 1986
33
Verification of a distributed cache memory by using abstract.. (context) - Graf - 1994
28
How to make a multiprocessor that correctly executes multipr.. (context) - Lamport - 1979
18
The Modular Framework of Computer-aided Verification: Motiva.. (context) - Shurek, Grumberg - 1990
17
Introduction to sequential consistency and the lazy caching .. (context) - Gerth - 1994
16
abstraction and compositional verification (context) - Long - 1993
8
Proving refinement using transduction
- Jonsson, Pnueli et al. - 1994
5
V'erification symbolique de programmes r'eactifs `a l'aide d.. (context) - Loiseaux - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://gaspard.imag.fr/PEOPLE/Susanne.Graf/biblio-sg.html): More
Safety for Branching Time Semantics - Bouajjani, Fernandez, Graf.. (1991)
(Correct)
An Algebra of Boolean Processes - Courcoubetis, Graf, Sifakis
(Correct)
A Tool for Symbolic Program Verification and Abstraction - Graf, Loiseaux (1993)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC