• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Automatic verification of finite-state concurrent systems using temporal logic specifications (1986)

Cached

  • Download as a PDF

Download Links

  • [research.microsoft.com]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [rockfish.cs.unc.edu]
  • [www2.informatik.uni-stuttgart.de]
  • [rockfish-cs.cs.unc.edu]
  • [www-users.cs.umn.edu]
  • [www.cs.cmu.edu]
  • [research.microsoft.com]
  • [www.cis.upenn.edu]
  • [ix.cs.uoregon.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-users.cs.umn.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [ix.cs.uoregon.edu]
  • [www.cis.upenn.edu]
  • [users.ece.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by E. M. Clarke , E. A. Emerson , A. P. Sistla
Venue:ACM Transactions on Programming Languages and Systems
Citations:1387 - 61 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Clarke86automaticverification,
    author = {E. M. Clarke and E. A. Emerson and A. P. Sistla},
    title = {Automatic verification of finite-state concurrent systems using temporal logic specifications},
    journal = {ACM Transactions on Programming Languages and Systems},
    year = {1986},
    volume = {8},
    pages = {244--263}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent system. We also show how this approach can be adapted to handle fairness. We argue that our technique can provide a practical alternative to manual proof construction or use of a mechanical theorem prover for verifying many finite-state concurrent systems. Experimental results show that state machines with several hundred states can be checked in a matter of seconds.

Keyphrases

finite-state concurrent system    automatic verification    temporal logic specification    efficient procedure    state machine    complexity linear    temporal logic    concurrent system    manual proof construction    many finite-state concurrent system    practical alternative    experimental result    global state graph    mechanical theorem prover   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University