(Enter summary)
Abstract: In thes notes we will review the automata-theoretic verification method and propositional
linear temporal logic, with specific emphasis on their potential application to distributed
software verification.
An important issue in software verification is the establishment of a formal relation
between the concrete, implementation-level, software application and the abstract,
derived, automata-model that is the subject of the actual verification. In principle one can
either attempt to derive... (Update)
Cited by: More
On Verification Modelling of Embedded Systems - Ed Brinksma And
(Correct)
Active bibliography (related documents): More All
0.5: Logic Verification of ANSI-C code with SPIN - Holzmann (2000)
(Correct)
0.5: Analyse Algorithmique de Systèmes Hybrides Polygonaux - Schneider (2002)
(Correct)
0.5: A Sense of Life - Mishra, Raoul-SamDaruwala, Zhou..
(Correct)
Similar documents based on text: More All
0.2: From Code to Models - Holzmann (2000)
(Correct)
0.2: Software Analysis and Model Checking - Holzmann
(Correct)
0.1: Designing Bug-Free Protocols With SPIN - Holzmann (1997)
(Correct)
BibTeX entry: (Update)
G. Holzmann and M.H. Smith. Software model checking. In Proceeding FORTE 1999. http://citeseer.ist.psu.edu/holzmann00software.html More
@inproceedings{ holzmann99software,
author = "Gerard J. Holzmann and Margaret H. Smith",
title = "Software Model Checking",
booktitle = "{FORTE}",
pages = "481-497",
year = "1999",
url = "citeseer.ist.psu.edu/holzmann00software.html" }
Citations (may not include all citations):
1450
The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
1399
Compilers - principles (context) - Aho, Sethi et al. - 1986
1180
The temporal logic of reactive and concurrent systems: Speci.. (context) - Manna, Pnueli - 1991
476
Programming Language (context) - Kernighan, Ritchie - 1988
470
Design and validation of computer protocols (context) - Holzmann - 1991
434
An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
405
Depth first search and linear graph algorithms (context) - Tarjan - 1972
274
The existence of refinement mappings
- Abadi, Lamport - 1991
270
Bandera: Extracting finite-state models from Java source cod..
- Corbett, Dwyer et al. - 2000
259
A survey of program slicing techniques
- Tip - 1995
231
Model checking and abstraction
- Clarke, Grumberg et al. - 1994
206
The model checker Spin
- Holzmann - 1997
200
Construction of abstract state graphs with PVS
- Graf, Saidi - 1997
181
Spacetime trade-offs in hash coding with allowable errors
- Bloom - 1970
160
What good is temporal logic (context) - Lamport - 1983
142
Simple on-the-fly automatic verification of linear temporal ..
- Gerth, Peled et al. - 1995
140
Tense Logic and the Theory of Linear Order (context) - Kamp - 1968
128
An automata-theoretic approach to linear temporal logic
- Vardi - 1996
120
A note on reliable full-duplex transmission over half-duplex.. (context) - Bartlett, Scantlebury et al. - 1969
120
Handbook on Theoretical Computer Science (context) - Emerson, modal - 1990
108
Combining Partial Order Reductions with On-the-fly Model-Che.. (context) - Peled - 1996
108
An improvement in formal verification
- Holzmann, Peled - 1994
108
Combining partial order reductions with on-the-fly model che.. (context) - Peled - 1994
103
On communicating finite state machines (context) - Brand, Zafiropulo
81
Handbook on Theoretical Computer Science (context) - Thomas, infinite - 1990
78
Experience with Predicate Abstraction
- Das, Dill et al. - 1999
54
Static determination of dynamic properties of programs (context) - Cousot, Cousot - 1976
46
Springer Verlag (context) - Rescher, Urquhart et al. - 1971
45
Reliable hashing without collision detection
- Wolper, Leroy
42
tapes: a simplified approach (context) - Choueka, automata et al. - 1974
39
Abstract interpretation of reactive systems (context) - Dams, Gerth et al. - 1997
34
Improved automata generation for linear temporal logic
- Daniele, Giunchiglia et al. - 1999
34
Software model checking: extracting verification models from..
- Holzmann, Smith - 1999
28
the verification of temporal properties
- Godefroid, Holzmann - 1993
26
Formal methods in system design (context) - Holzmann, of et al. - 1998
18
th IEEE Symposium on Foundations of Computer Science (context) - Pnueli, logic et al. - 1977
16
Event fairness and non-interleaving concurrency (context) - Kwiatkowska - 1989
15
Automating software feature verification
- Holzmann, Smith - 2000
13
with an application to the Entscheidungs problem (context) - Turing, numbers - 1936
12
Designing executable abstractions (context) - Holzmann - 1998
12
Applying predicate abstraction to model checking objectorien.. (context) - Visser, Park et al. - 2000
11
Formal verification techniques for digital systems (context) - Levitt - 1998
8
Stutter-invariant temporal properties are expressible withou.. (context) - Peled, Wilke - 1997
7
Lightweight reasoning about program correctness
- Chechik, Ding - 2000
6
Formal verification of a partial order reduction technique f.. (context) - Chou, Peled - 1999
6
Scatter storage techniques (context) - Morris - 1968
6
Pan --- A protocol specification analyzer
- Holzmann - 1981
6
American Mathematical Society (context) - Holzmann, Peled et al. - 1996
6
A practical method for the verification of event driven syst.. (context) - Holzmann, Smith - 1999
6
A synchronization calculus for message oriented programming (context) - Cunha, Maibaum - 1981
4
Oxford: Clarendon Press (context) - Prior, Present - 1967
4
Oxford: Clarendon Press (context) - Prior, Modality - 1957
1
Spin --- A protocol analyzer (context) - Holzmann - 1990
1
chi Automata (context) - Etessami, Holzmann et al. - 2000
1
chi-automata from LTL formula (context) - Somenzi, Bloem et al. - 2000
1
th Spin Workshop (context) - The, of et al. - 1999
Documents on the same site (http://netlib.bell-labs.com/cm/cs/who/gerard/abs.html): More
Interval Reduction through Requirements Analysis - Holzmann, Smith (1998)
(Correct)
A Minimized Automaton Representation of Reachable States - Holzmann, Puri (1997)
(Correct)
Automated Protocol Validation in Argos , assertion proving and.. - Holzmann (1987)
(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