C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis  Home/Search
Context Related
| rice.edu/~vardi/papers/cav90rj.ps.gz rice.edu/~achauhan/work/fall96...cav.ps montefiore.ulg.ac.be/~pw/pa...CVWY92.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: rice.edu/~vardi/papers/index (more) From: abo.fi/~jolilius/mcintro/mcbib (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper addresses the problem of designing memory-efficient algorithms for the verification of temporal properties of finite-state programs. Both the programs and their desired temporal properties are modeled as automata on infinite words (Buchi automata). Verification is then reduced to checking the emptiness of the automaton resulting from the product of the program and the property. This problem is usually solved by computing the strongly connected components of the graph representing the ... (Update)
Cited by: More
Automata-Theoretic Model Checking Revisited - Vardi (Correct)
Shortest Counterexamples for Symbolic Model Checking of LTL.. - Schuppan, Biere (2005) (Correct)
Designing a LTL Model-Checker based on Unfolding Graphs - Couvreur, Grivet, Poitrenaud (2000) (Correct)
Active bibliography (related documents): More All
1.0: Report on Analysis and Verification Techniques - Herrmann, Krumm (1993) (Correct)
0.6: Symbolic Verification with Periodic Sets - Boigelot, Wolper (1994) (Correct)
0.5: A Partial Approach to Model Checking - Godefroid, Wolper (1994) (Correct)
Similar documents based on text: More All
0.8: Reliable Hashing without Collision Detection - Pierre Wolper And (1993) (Correct)
0.7: Partial-Order Methods for Temporal - Verification Pierre Wolper (Correct)
0.6: Constraint-Generating Dependencies - Baudinet, Chomicki, Wolper (1995) (Correct)
Related documents from co-citation: More All
50: An automata-theoretic approach to automatic program verification (context) - Vardi, Wolper - 1986
34: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic S.. (context) - Clarke, Emerson et al. - 1986
29: The Design and Validation of Computer Protocols (context) - Holzmann - 1991
BibTeX entry: (Update)
Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory Efficient Algorithms for the Verification of Temporal Properties, Formal Methods in System Design 1(1992), pp. 275--288 http://citeseer.ist.psu.edu/courcoubetis92memoryefficient.html More
@article{ courcoubetis92memoryefficient,
author = "Constantin Courcoubetis and Moshe Y. Vardi and Pierre Wolper and Mihalis Yannakakis",
title = "Memory-Efficient Algorithms for the Verification of Temporal Properties",
journal = "Formal Methods in System Design",
volume = "1",
number = "2/3",
pages = "275-288",
year = "1992",
url = "citeseer.ist.psu.edu/courcoubetis92memoryefficient.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
452 Data Structures and Algorithms (context) - Aho, Hopcroft et al. - 1982
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
230 Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
221 Specification and verification of concurrent systems in cesa.. (context) - Quielle, Sifakis - 1981
71 Reasoning about infinite computation paths (context) - Vardi, Wolper - 1988
59 the relation of programs and computations to models of tempo.. (context) - Wolper - 1989
50 State space caching revisited - Godefroid, Holzmann et al. - 1992
47 Avoiding the state explosion problem in temporal logic model.. (context) - Clarke, Grumberg - 1987
39 An improved protocol reachability analysis technique - Holzmann - 1988
29 line model-checking for finite linear temporal logic specifi.. (context) - Jard, Jeron - 1989
28 PrenticeHall International Editions (context) - Holzmann, Validation et al. - 1991
25 Protocol engineering (context) - Liu - 1989
23 Technical Journal (context) - Holzmann, AT - 1985
22 Bounded-memory algorithms for verification on the fly (context) - Jard, Jeron - 1991
17 Adding liveness properties to coupled finite-state machines (context) - Aggarwal, Courcoubetis et al. - 1990
14 Network protocols and tools to help produce them (context) - Rudin - 1987
8 Automated validation of a communication protocol: the ccitt .. (context) - West, Zafiropulo - 1978
7 From Modal Logic to Deductive Databases: Introducing a Logic.. (context) - Thayse - 1989
5 Unified verification theory (context) - Vardi - 1989
2 A validation technique for tightly-coupled protocols (context) - Rudin, West - 1982
2 Experience with automated protocol verification (context) - Sunshine - 1983
2 Generalized technique for communication protocol validation (context) - West - 1978
1 Attacking a complex distributed systems from different sides.. (context) - Grotz, Jard et al. - 1984
1 Tools for verifying network protocols (context) - Hailpern - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994) (Correct)
Nontraditional Applications of Automata Theory - Vardi (1994) (Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997) (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