Consistent Partial Model Checking

We propose assertion-consistency (AC) semi-lattices as suitable orders for the analysis of partial models. Such orders express semantic entailment, multiple-viewpoint and multiple-valued analysis, maintain internal consistency of reasoning, and subsume nite De Morgan lattices. We classify those orders that are nite and distributive and apply them to design an ecien t algorithm for multiple-viewpoint checking, where checks are delegated to single-viewpoint models | ecien tly driven by the order structure. Instrumentations of this algorithm enable the detection and location of inconsistencies across viewpoint boundaries. To validate the approach, we investigate multiple-valued models and their compositional property semantics over a nite distributive AC lattice. We prove that this semantics is computed by our algorithm above whenever the primes of the AC lattice determine ‘projected’ single viewpoints and the order between primes is preserved as renemen ts of single-viewpoint models. As a case study, we discuss a multiple-valued notion of state-machines with rst-order logic plus transitive closure.

[1]  K. Hofmann,et al.  A Compendium of Continuous Lattices , 1980 .

[2]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[3]  Bashar Nuseibeh,et al.  The process of inconsistency management: a framework for understanding , 1999, Proceedings. Tenth International Workshop on Database and Expert Systems Applications. DEXA 99.

[4]  Joseph Sifakis.  Automatic Verification Methods for Finite State Systems: International Workshop, Grenoble, France. June 12-14, 1989. Proceedings , 1990 .

[5]  M. Huth,et al.  Lifting assertion and consistency checkers from single to multiple viewpoints , 2002 .

[6]  Ken Martin.  Non-classical techniques for models of computation , 1999 .

[7]  Reinhard Wilhelm,et al.  Parametric shape analysis via 3-valued logic , 1999, POPL '99.

[8]  Bashar Nuseibeh,et al.  Managing inconsistent specifications: reasoning, analysis, and action , 1998, TSEM.

[9]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[10]  Pawel Waszkiewicz,et al.  Quantitative Continuous Domains , 2003, Appl. Categorical Struct..

[11]  Michael Huth,et al.  Abstraction and refinement for model checking inconsistent systems , 2001 .

[12]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[13]  Marsha Chechik,et al.  Implementing a Multi-valued Symbolic Model Checker , 2001, TACAS.

[14]  Andreas Podelski,et al.  Boolean and Cartesian abstraction for model checking C programs , 2001, International Journal on Software Tools for Technology Transfer.

[15]  Radha Jagadeesan,et al.  Modal Transition Systems: A Foundation for Three-Valued Program Analysis , 2001, ESOP.

[16]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[17]  Carl A. Gunter,et al.  The Mixed Powerdomain , 2008 .

[18]  André Schiper,et al.  Failure Detection vs Group Membership in Fault-Tolerant Distributed Systems: Hidden Trade-Offs , 2002, PAPM-PROBMIV.

[19]  Radha Jagadeesan,et al.  A domain equation for refinement of partial systems , 2004, Mathematical Structures in Computer Science.

[20]  Karl E. Wiegers.  First Things First: Prioritizing Requirements , 1999 .

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

[22]  Michael W. Mislove,et al.  A foundation for computation , 2000 .

[23]  Reinhold Heckmann.  Power Domains and Second-Order Predicates , 1993, Theor. Comput. Sci..

[24]  J. Dunn.  A Comparative Study of Various Model-Theoretic Treatments of Negation: A History of Formal Negation , 1999 .

[25]  Patrice Godefroid,et al.  Temporal logic query checking , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[26]  Manu Sridharan,et al.  A micromodularity mechanism , 2001, ESEC/FSE-9.

[27]  Matthew B. Dwyer,et al.  Finding Feasible Counter-examples when Model Checking Abstracted Java Programs , 2001, TACAS.

[28]  Bashar Nuseibeh,et al.  Expressing the relationships between multiple views in requirements specification , 1993, ICSE '93.

[29]  Patrice Godefroid,et al.  Generalized Model Checking: Reasoning about Partial State Spaces , 2000, CONCUR.

[30]  Radha Jagadeesan,et al.  Model checking partial state spaces with 3-valued temporal logics , 2001 .

[31]  D. J. Walker,et al.  Bisimulation and Divergence , 1990, Inf. Comput..

[32]  Melvin Fitting,et al.  Many-valued modal logics II , 1992 .

[33]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .