Abstract interpretation of reactive systems : preservation of CTL*

Interpretation of Reactive Systems: Preservation of CTL Dennis Dams Orna Grumberg Rob Gerth

[1]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[2]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

[3]  M. Dal Cin,et al.  The Algebraic Theory of Automata , 1980 .

[4]  C. W. A. M. van Overveld,et al.  Stars or Stripes: a comparative study of finite and transfinite techniques for surface modelling , 1994 .

[5]  P. Niebert,et al.  On the connection of partial order logics and partial order reduction methods , 1995 .

[6]  R. Backhouse,et al.  Mathematical induction made calculational , 1994 .

[7]  Kim Marriott,et al.  Suspension analyses for concurrent logic programs , 1994, TOPL.

[8]  Ralph-Johan Back,et al.  Decentralization of process nets with centralized control , 1983, PODC '83.

[9]  Susanne Graf,et al.  Verification of a Distributed Cache Memory by Using Abstractions , 1994, CAV.

[10]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[11]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[12]  Patrick Cousot,et al.  Abstract Interpretation Frameworks , 1992, J. Log. Comput..

[13]  Rance Cleaveland,et al.  Testing-Based Abstractions for Value-Passing Systems , 1994, CONCUR.

[14]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[15]  Jos C. M. Baeten,et al.  Delayed choice: an operator for joining Message Sequence Charts , 1994, FORTE.

[16]  Orna Grumberg,et al.  Abstract interpretation of reactive systems : abstractions preserving .. , 1994 .

[17]  Dieter Kratsch,et al.  Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph , 1995, Inf. Process. Lett..

[18]  J. Davenport.  Editor , 1960 .

[19]  Nicolas Halbwachs,et al.  Minimal State Graph Generation , 1992, Sci. Comput. Program..

[20]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[21]  Joseph Sifakis,et al.  Property Preserving Homomorphisms of Transition Systems , 1983, Logic of Programs.

[22]  Robert P. Kurshan,et al.  Analysis of Discrete Event Coordination , 1989, REX Workshop.

[23]  Claire Loiseaux,et al.  A Tool for Symbolic Program Verification and Abstration , 1993, CAV.

[24]  Günter Asser,et al.  Zeitschrift für mathematische Logik und Grundlagen der Mathematik , 1955 .

[25]  Amir Pnueli,et al.  Checking that finite state concurrent programs satisfy their linear specification , 1985, POPL.

[26]  Rance Cleaveland,et al.  Abstractions for Preserving All CTL* Formulae , 1994 .

[27]  Amir Pnueli,et al.  Verifying sequentially consistent memory , 1994 .

[28]  Orna Grumberg,et al.  Abstract Interpretation of Reactive Systems: Abstractions Preserving 'I1CTL *. 3CTL * and CTL * , 1994 .

[29]  Ron Selj.  A New Method for Integrity Constraint Checking in Deductive Databases , 1994 .

[30]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[31]  Patrick Cousot,et al.  Abstract Interpretation and Application to Logic Programs , 1992, J. Log. Program..

[32]  Orna Grumberg,et al.  Generation of Reduced Models for Checking Fragments of CTL , 1993, CAV.

[33]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[34]  Hardi Hungar,et al.  Statecharts: Using graphical specification languages and symbolic model checking in the verification of a production cell , 1995 .

[35]  Hergen Pargmann,et al.  Model Checking Using Adaptive State and Data Abstraction , 1994, CAV.

[36]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[37]  Ajh Jan Hidders,et al.  An isotopic invariant for planar drawings of connected planar graphs , 1995 .

[38]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[39]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[40]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.