three-valued program analysis Michael Huth, Radha Jagadeesan, and David...  Home/Search
Context
Related
| depaul.edu/rjagadeesan/ftp/esop01.ps Cached: PS.gz PS 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.
Image Update HelpPS.gz PS PDF From: depaul.edu/rjagadeesan/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present Kripke modal transition systems (Kripke MTSs), a generalization of modal transition systems [27, 26], as a foundation for three-valued program analysis. The semantics of Kripke MTSs are presented by means of a mixed power domain of states; soundness and consistency are proved. Two major applications, model checking partial state spaces and three-valued program shape analysis, are presented as evidence of the suitability of Kripke MTSs as a foundation for threevalued analyses. (Update)
Similar documents (at the sentence level):
14.9%: Modal Transition Systems: A Foundation for Three-Valued.. - Huth, Jagadeesan.. (2000) (Correct)
7.1%: Under consideration for publication in Math. Struct. in.. - Domain Equation For (Correct)
Active bibliography (related documents): More All
0.8: Domains of View: A Foundation for Specification and Analysis - Huth (2000) (Correct)
0.6: Math. Struct. in Comp. Science (2004), vol. 14, pp.. - Cambridge University Press (Correct)
0.4: Abstraction-based Model Checking using Modal Transition.. - Godefroid, Huth.. (2001) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ analysis-modal,
author = "Three-Valued Program Analysis",
title = "Modal Transition Systems: A Foundation for",
url = "citeseer.ist.psu.edu/758717.html" }
Citations (may not include all citations):779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1990
357 Algebraic laws for non-determinism and concurrency (context) - Hennessy, Milner - 1985
291 Theoretical Computer Science (context) - Gunter, power - 1992
252 Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
225 Flow Analysis of Computer Programs (context) - Hecht - 1977
207 Flow analysis and optimization of LISP-like structures (context) - Jones, Muchnick - 1979
206 Results on the propositional mu-calculus (context) - Kozen - 1983
193 Abstract interpretation: a uni ed lattice model for static a.. (context) - Cousot, Cousot - 1977
181 Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
155 ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
150 Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps et al. - 1999
127 Information and Computation (context) - Walker, divergence - 1990
119 Compositional pointer and escape analysis for Java programs - Whaley, Rinard - 1999
99 A Shape Analysis for Heap-Directed Pointers in C (context) - Ghiya, Hendren et al. - 1996
78 Modal logics for communicating systems (context) - Stirling - 1987
68 Program Flow Analysis: Theory and Applications (context) - Muchnick, Jones - 1981
61 Alcoa: the alloy constraint analyzer (context) - Jackson, Schechter et al. - 2000
52 A Modal Process Logic (context) - Larsen, Thomsen - 1988
47 Program analysis via graph reachability - Reps - 1997
42 A modal characterisation of observable machine behaviours (context) - Milner - 1981
41 Boolean and Cartesian Abstraction for Model Checking C Progr.. - Ball, Podelski et al. - 2000
37 Three Logics for Branching Bisimulation (context) - de Nicola, Vaandrager - 1995
34 Many-valued modal logics - Fitting - 1992
29 Temporal abstract interpretation (context) - Cousot, Cousot - 2000
22 Model Checking Partial State Spaces with 3-Valued Temporal L.. - Bruns, Godefroid - 1999
22 Abstract interpretation and partition re nement for model ch.. (context) - Dams - 1996
20 Applications of temporal logic to the speci cation and veri .. (context) - Pnueli - 1985
15 Power domains and second order predicates - Heckmann - 1993
14 as Fragments of the Modal mu-Calculus (context) - Dam, ECTL - 1994
12 Model checking and abstraction: a framework preserving both .. (context) - Kelb - 1994
9 Some modal logics based on a three-valued logic (context) - Morikawa - 1989
9 Modal Speci cations (context) - Larsen - 1989
9 Some modal logics based on a three-valued logic (context) - Segerberg - 1967
8 A symbolic semantics for abstract model checking (context) - Levi - 1998
7 Global data ow analysis and iterative algorithms (context) - Kam, Ullman - 1976
5 Verifying Temporal Properties Of Systems (context) - eld - 1991
5 A Unifying Framework for Model Checking Labeled Kripke Struc.. - Huth - 1999
4 Modal transition systems: new foundations and new applicatio.. (context) - Huth, Jagadeesan et al. - 2000
4 Binary relations for abstraction and re nement (context) - Schmidt - 1999
2 Gernalized Model Checking: Reasoning about Partial State Spa.. (context) - Bruns, Godefroid - 2000
Documents on the same site (http://fpl.cs.depaul.edu/rjagadeesan/pubs.html): More
On The Expressiveness of 3-Valued Models - Godefroid, Jagadeesan (2003) (Correct)
Metrics for Labeled Markov Systems - Desharnais, Jagadeesan, Gupta, al. (1999) (Correct)
Probabilistic Concurrent Constraint Programming - Gupta, Jagadeesan, Saraswat (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