See this document in CiteSeerX!

Bounded Model Checking for Verifying Concurrent Programs (2002)  (Make Corrections)  
Toni Jussila



  Home/Search   Context   Related

 
View or download:
tcs.hut.fi/Publicat...HUTTCSA73.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  tcs.hut.fi/Publ...year2002.shtml (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: A simple, parallel programming language is introduced and an operational semantics for it is developed. The language combines the syntax of C and Java together with the communication primitives taken from PROMELA. (Update)

Active bibliography (related documents):   More   All
0.2:   The ForSpec Temporal Logic: A New Temporal.. - Armoni, Fix.. (2001)   (Correct)
0.2:   Branching vs. Linear Time: Final Showdown - Vardi (2001)   (Correct)
0.2:   Integrating Logic into the Computer Science Curriculum - Barland, Felleisen..   (Correct)

Similar documents based on text:   More   All
1.2:   Authorization and Availability - Aspects of Open Network Security - Aura (2000)   (Correct)
0.4:   A Reachability Analyser for Algebraic System Nets - Mäkelä (2001)   (Correct)
0.3:   Neural Network Methods In Analysing And Modelling Time Varying.. - Koskela (2003)   (Correct)

BibTeX entry:   (Update)

@misc{ jussila-bounded,
  author = "Toni Jussila",
  title = "Bounded Model Checking for Verifying Concurrent Programs",
  url = "citeseer.ist.psu.edu/jussila02bounded.html" }
Citations (may not include all citations):
539   The temporal logic of programs (context) - Pnueli - 1977
222   The complexity of propositional linear temporal logics (context) - Sistla, Clarke - 1985
92   Present and Future (context) - Prior - 1967
26   linear time: Final showdown (context) - Vardi - 2031
9   On characterization of safety and liveness properties in tem.. (context) - Sistla - 1985
5   Formal Specification of Programming Languages (context) - Pagan - 1981
5   Formal Verification Based on Boolean Expression Diagrams (context) - Williams
4   Formal verification made easy (context) - Schlipf, Buechner et al. - 1997

Documents on the same site (http://www.tcs.hut.fi/Publications/year-2002.shtml):   More
Towards Ambitious Approximation Algorithms in Stubborn Set.. - Varpaaniemi (2002)   (Correct)
Symmetry Reduction Algorithms For Data Symmetries - Junttila (2002)   (Correct)
New Canonical Representative Marking Algorithms For.. - Junttila (2002)   (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