Consistent partial model checking

Electronic Notes in Theoretical Computer Science

Volumn 73, Issue , 2004, Pages 45-85

  Huth, Michael ^a   Pradhan, Shekhar ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b VASSAR COLLEGE   (United States)

Author keywords

DeMorgan lattices; Lattices; Model checking; Refinement; Requirements; Verification; Viewpoints

Indexed keywords

DEMORGAN LATTICES; LATTICES; MODEL CHECKING; REFINEMENT; REQUIREMENTS; VERIFICATION; VIEWPOINTS;

ALGORITHMS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SCIENCE; CONSTRAINT THEORY; DATA STRUCTURES; FINITE ELEMENT METHOD; MATHEMATICAL MODELS; MODAL ANALYSIS; SEMANTICS; SET THEORY;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 18944373169     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.08.003     Document Type: Conference Paper

References (37)

1. S. Abramsky and A. Jung. Domain theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Oxford Univ. Press, 1994.
2. T. Ball, A. Podelski, and S. K. Rajamani. Boolean and Cartesian Abstraction for Model Checking C Programs. In T. Margaria and W. Yi, editors, Proceedings of TACAS'2001, volume 2031 of LNCS, pages 268-283, Geneva, Italy, April 2001. Springer Verlag.
3. N. Belnap. A useful four-valued logic. In J. M. Dunn, editor, Modern Uses of Many- Valued Logic, pages 8-37. Reidel, 1977.
4. S. Blarney. Partial logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, Volume 3: Alternatives to Classical Logic, pages 1-70, 1986.
5. G. Bruns and P. Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In Proceedings of the 11th Conference on Computer Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 274-287. Springer Verlag, July 1999.
6. G. Bruns and P. Godefroid. Generalized Model Checking: Reasoning about Partial State Spaces. In Proceedings of CONCUR'2000 (11th International Conference on Concurrency Theory), volume 1877 of Lecture Notes in Computer Science, pages 168-182. Springer Verlag, August 2000.
7. G. Bruns and P. Godefroid. Temporal Logic Query Checking. In Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, pages 409-417, Boston, Massachusetts, 16-19 June 2001. IEEE Computer Society Press.
8. M. Chechik, B. Devereux, and S. M. Easterbrook. Implementing a Multi-Valued Symbolic Model Checker. In Proceedings of the Fourth European Joint Conferences on Theory and Practice of Software (ETAPS2001) - Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2001), Lecture Notes in Computer Science, pages 404-419, Genova, Italy, 2-6 April 2001. Springer Verlag.
9. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs. In Proc. 4th ACM Symp. on Principles of Programming Languages, pages 238-252. ACM Press, 1977.
10. J. M. Dunn. What Is Negation?, chapter A Comparative Study of Various Model-Theoretic Treatments of Negation: A History of Formal Negation. Kluwer Academic Publishers, 1999.
11. M. Fitting. Many-valued modal logics II. Fundamenta Informaticae, 17:55-73, 1992.
12. G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, and D. S. Scott, A Compendium of Continuous Lattices. Springer Verlag, 1980.
13. M. L. Ginsberg. Multivalued Logics. In Proceedings of the 5th International Conference on Artificial Intelligence (AAAI'86), pages 243-247. Morgan-Kaufmann, 1986.
14. C. Gunter. The mixed power domain. Theoretical Computer Science, 103:311-334, 1992.
15. R. Heckmann. Power domains and second order predicates. Theoretical Computer Science, 111:59-88, 1993.
16. A. Hunter and B. Nuseibeh. Managing Inconsistent Specifications: Reasoning, Analysis, and Action. ACM Transactions on Software Engineering and Methodology, 7(4):335-367, October 1998.
17. M. Huth and S. Pradhan. Abstraction and refinement for model checking inconsistent systems. Position paper presented at The Second International Workship on Living with Inconsistencies, 13 May 2001, Toronto, Canada. URL: www.cis.ksu.edu/~huth/lwi2.ps
18. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: a foundation for threevalued program analysis. In Sands D., editor, Proceedings of the European Symposium on Programming (ESOP'2001), pages 155-169. Springer Verlag, April 2001.
19. M. Huth, R. Jagadeesan, and D. A. Schmidt. A domain equation for refinement of partial systems. Accepted for publication in the journal Mathematical Structures in Computer Science, January 2003.
20. M. Huth and S. Pradhan. Lifting assertion and consistency checkers from single to multiple viewpoints. Technical Report TR 2002/11, Imperial College London. Department of Computing. London, UK, March 2002.
21. D. Jackson. Alloy: A Lightweight Object Modelling Language. Technical Report TR-797, Laboratory of Computer Science, Massachusetts Institute of Technology, 28 July 2000.
22. D. Jackson, I. Shlyakhter, and M. Sridliaran. A Micromodularity Mechanism, In Proceedings of the ACM SIGSOFT Conference on the Foundations of Software Engineering/European Software Engineering Conference (FSE/ESEC'01), September 2001.
23. P. T. Johnstone. Stone spaces. Number 3 in Cambridge studies in advanced mathemathics. Cambridge University Press, 1982.
24. S. C. Kleene. Introduction to Metamathematics. Van Nostrand, 1952.
25. K. G. Larsen. Modal Specifications. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems, number 407 in Lecture Notes in Computer Science, pages 232-246. Springer Verlag, June 12-14 1989. International Workshop, Grenoble, France.
26. K. G. Larsen and B. Thomsen. A Modal Process Logic. In Third Annual Symposium on Logic in Computer Science, pages 203-210. IEEE Computer Society Press, 1988.
27. K. Martin. Nonclassical techniques for models of computation. In Topology Proceedings, volume 24, 1999.
28. K. Martin. A Foundation for Computation. PhD thesis, Department of Mathematics, Tulane University of Louisiana, New Orleans, LA 70118, 2000.
29. B. Nuseibeh and S. M. Easterbrook. The Process of Inconsistency Management: A framework for understanding. In Proceedings of the First International Workshop on the Requirements Engineering Process (REP'99), 2-3 September 1999.
30. B. Nuseibeh, J. Kramer, and A. Finkelstein. A Framework for Expressing the Relationships Between Multiple Views in Requirements Specification. IEEE Transactions on Software Engineering, 20(10):760-773, October 1994.
31. C. S. Pasareanu, M. B. Dwyer, and W. Visser. Finding Feasible Counter-examples when Model Checking Abstracted Java Programs. In T. Margaria and W. Yi, editors, In: Proc. of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'Ol), volume 2031 of LNCS, pages 284-298, Genova, Italy, April 2-4 2001. Springer Verlag.
32. M. Sagiv, T. Reps, and R. Wilhelm. Parametric Shape Analysis via 3-Valued Logic. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages, pages 105-118, January 20-22, San Antonio. Texas 1999.
33. A. Schiper. Failure Detection vs Group Membership. In H. Hermanns and R. Segala, editors, Process Algebra and Probabilistic Methods. Performance Modeling and Verification, Second Joint International Workshop PAPM-PROBMIV 2002, volume 2399 of Lecture Notes in Computer Science, pages 1-15, Copenhagen, Denmark, July 25-26 2002. Springer.
34. A. van Lamsweerde. Goal-Oriented Requirements Engineering. Invited talk at the BSC-RESG One-Day Symposium on "Using Formal Models to Understand Requirements Better." Imperial College London, 6 November 2002.
35. D. J. Walker. Bisimulation and divergence. Information and Computation, 85(2):202-241, 1990.
36. P. Waszkiewicz. Quantitative Continuous Domains. PhD thesis, School of Computer Science, University of Birmingham, Birmingham, B15 2TT, United Kingdom, August 2002.
37. K. Wiegers. First Things First: Prioritizing Requirements. Software Development Online, September 1999.