Fred B. Schneider, Bowen Alpern  Home/Search
Context Related
| cornell.edu/fbs/publication...87848.ps From: cornell.edu/fbs/fullist (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An approach to proving temporal properties of concurrent programs that does not use temporal logic as an inference system is presented. The approach is based on using Buchi automata to specify properties. To show that a program satisfies a given property, proof obligations are derived from the Buchi automata specifying that property. These obligations are discharged by devising suitable invariant assertions and variant functions for the program. (Update)
Context of citations to this paper: More
.... for specifying properties [15, 16, 21] B uchi automata [20] are the most popular kind of nite automata used for specifying properties [2, 5, 6, 12]. B uchi automata are known to be quite expressive, demonstrably more expressive than linear time and branching time rst order...
.... commonly modeled by means of virtual components (Observers) which are composed in parallel with the system under analysis (SUA) e.g. [1,9]) In [8,10,11] we present a technique that, given the SUA and an observer, builds a smaller parallel composition equivalent to the...
Cited by: More
Enforcing Formal Security Properties - Bernard, Lee (2001) (Correct)
The Limit View of Infinite Computations - Klarlund (1994) (Correct)
A Security-Property Language for Self-Certified Code - Bernard (1999) (Correct)
Similar documents (at the sentence level):
40.1%: Verifying Temporal Properties without Temporal Logic - Alpern, Schneider (1989) (Correct)
9.3%: Proving Boolean Combinations of Deterministic Properties - Alpern, Schneider (1987) (Correct)
Active bibliography (related documents): More All
0.5: Partial Order Reduction of the state space - Holzmann, Peled (1995) (Correct)
0.5: Type Specialisation of a Subset of Haskell - Sjoers (1997) (Correct)
0.3: Hierarchical Correctness Proofs for Distributed Algorithms - Tuttle (1987) (Correct)
Similar documents based on text: More All
0.3: Extending Temporal Logic With Omega-Automata - Piterman (2000) (Correct)
0.3: An LTL Verification System Based on Automata Theory - van Wyk (1999) (Correct)
0.3: An Analysis of Message Sequence Charts - Ladkin, Leue (1992) (Correct)
Related documents from co-citation: More All
10: Recognizing safety and liveness - Alpern, Schneider - 1987
8: Communicating Sequential Processes (context) - Hoare - 1985
8: The Temporal Logic of Reactive and Concurrent Systems (context) - Manna, Pnueli - 1992
BibTeX entry: (Update)
B. Alpern and F.B. Schneider. Verifying temporal properties without temporal logic. ACM Transactions on Programming Languages, 11(1):147--167, jan 1989. http://citeseer.ist.psu.edu/schneider88verifying.html More
@misc{ alpern89verifying,
author = "B. Alpern and F. Schneider",
title = "Verifying temporal properties without temporal logic",
text = "B. Alpern and F.B. Schneider. Verifying temporal properties without temporal
logic. ACM Transactions on Programming Languages, 11(1):147--167, jan 1989.",
year = "1989",
url = "citeseer.ist.psu.edu/schneider88verifying.html" }
Citations (may not include all citations):1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1983
650 An axiomatic basis for computer programming (context) - Hoare - 1969
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
327 Languages and Machines (context) - Eilenberg - 1974
230 Checking that finite state concurrent programs satisfy theh'.. (context) - Lichtenstein, Pnueli - 1985
177 Temporal logic can be more expressive (context) - Wolper - 1983
104 Proving liveness properties of concurrent programs (context) - Owicki, Lampoft - 1982
79 Myths about the mutual exclusion problem (context) - Peterson - 1981
70 Verification of concurrent programs: The temporal framework (context) - Manna, Pnueli - 1981
59 Modalities for model checking: Branching time strikes back (context) - mea'son, C-L - 1985
52 Specification and Verification of Concurrent Programs by V-A.. (context) - Manna, Pnueli - 1987
47 Avoiding the state explosion problem in temporal logic model.. (context) - Clarke, rtunberg - 1987
43 Verification of concurrent programs: A temporal proof system (context) - Manna, Pnueli - 1983
43 Verification of concurrent programs: Temporal proof principl.. (context) - Manna, Pnueli - 1981
39 Texts and Monographs in Computer Science (context) - Francez - 1986
35 justice and fairness: The ethics of concurrent termination (context) - Lehmann, Pnueli et al. - 1981
35 How to cook a temporal proof system for your pet language (context) - Manna - 1983
33 Adequate proof principles for invariance and liveness proper.. (context) - Manna, Pnueli - 1984
23 Foundations of a theory of specification for distributed sys.. - Stark - 1984
17 A model and temporal proof system for networks of processes (context) - Nguyen, Cries et al. - 1985
14 ACM Transactions on Programming Languages and Systems (context) - Lainport, Schneider - 1984
11 Proving safety and liveness of communicating processes with .. (context) - Misra, Chandy et al. - 1982
10 Verifying Temporal Properties without using Temporal Logic (context) - Alpern, Schneider - 1985
4 th International Colloquium on Automata (context) - logic, programs - 1979
4 of the 18th Symposium on the Foundations of Computer Sci- en.. (context) - Pnueli - 1977
2 What good is temporal logic (context) - Lampoft - 1983
2 North-Holland Publishing Company (context) - CB, design et al. - 1983
1 Now you may compose temporal logic spe (context) - er, Kuiper et al. - 1984
1 Specifying concurrent program modules (context) - Lainport - 1983
1 Complementing deterministic Buchi automata in polynomial tim.. (context) - Kurshaa - 1987
1 Sixteenth Annual Symposium on Theory of Computing (context) - logic - 1984
1 Lecture Notes in Computer Science (context) - time, exponential et al. - 1983
1 Symposium on Logic in Computer Science Ithaca (context) - Sistla, German - 1987
1 Lecture Notes in Control and Information Sciences IIASA (context) - Kutshah - 1987
1 Proving Temporal Properties of Concurrent Programs: A Non-te.. (context) - Alper - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cornell.edu/fbs/fullist.htm): More
Implementing Fault-Tolerant Services Using the State Machine.. - Schneider (1990) (Correct)
IRM Enforcement of Java Stack Inspection - Erlingsson, Schneider (2000) (Correct)
User Recovery and Reversal in Interactive Systems - Archer, Jr., Conway, Schneider (1984) (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