See this document in CiteSeerX!

Model Checking and Abstraction (1992)  (Make Corrections)  (231 citations)
EDMUND M. CLARKE Carnegie Mellon University ORNA GRUMBERG The Technion and...
ACM Transactions on Programming Languages and Systems



  Home/Search   Context   Related

 
View or download:
cmu.edu/~emc/paper...20Abstraction94.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cmu.edu/~emc/papers (more)
(Enter author homepages)

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

Abstract: MODELS In this section, we consider the problem of deriving an approximate abstract model of M directly from a finite-state program describing M . The actual process will be described in subsection 4.2. However, we would like this discussion to be relatively independent of the particular finite-state language used. To accomplish this, we are going to argue that a program in a finite-state language can be transformed into relational expressions I and R that can be evaluated to obtain the... (Update)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

E.M.Clarke, O.Grumberg, D.E.Long. Model Checking and Abstraction. POPL, Albuquerque, New Mexico, January 1992. http://citeseer.ist.psu.edu/clarke92model.html   More

@article{ clarke94model,
    author = "Edmund M. Clarke and Orna Grumberg and David E. Long",
    title = "Model Checking and Abstraction",
    journal = "ACM Transactions on Programming Languages and Systems",
    volume = "16",
    number = "5",
    month = "September",
    publisher = "ACM Press",
    pages = "1512--1542",
    year = "1994",
    url = "citeseer.ist.psu.edu/clarke92model.html" }
Citations (may not include all citations):
1726   Graph-based algorithms for boolean function manipulation - Bryant - 1986
1097   Automatic verification of finitestate concurrent systems usi.. (context) - Clarke, Emerson et al. - 1986
1097   Automatic verification of finitestate concurrent systems usi.. (context) - Clarke, Emerson et al. - 1983
815   Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
312   Systematic design of program analysis frameworks (context) - Cousot, Cousot - 1979
230   Checking that finite state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1985
223   Assigning meanings to programs (context) - Floyd - 1967
221   Specification and verification of concurrent systems in CESA.. (context) - Quielle, Sifakis - 1981
198   Trace Theory for Automatic Hierarchical Verification of Spee.. (context) - Dill - 1989
143   Sequential circuit verification using symbolic model checkin.. (context) - Burch, Clarke et al. - 1990
122   Synthesis of synchronization skeletons for branching time te.. (context) - Clarke, Emerson - 1981
121   Compositional model checking - Clarke, Long et al. - 1989
117   Semantic domains - Gunter, Scott - 1990
106   Implicit state enumeration of finite state machines using BD.. (context) - Touati, Savoj et al.
96   Expressing interesting properties of programs in proposition.. (context) - Wolper - 1986

[Article contains additional citations not shown here]



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.cmu.edu/~emc/papers.htm):   More
Hybrid Spectral Transform Diagrams - Clarke, Fujita, Heinle (1997)   (Correct)
Another Look at LTL Model Checking - Clarke, Grumberg, Hamaguchi (1994)   (Correct)
Verification of the Futurebus+ Cache Coherence Protocol - Clarke, Grumberg.. (1992)   (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