A domain equation for refinement of partial systems

Mathematical Structures in Computer Science

Volumn 14, Issue 4, 2004, Pages 469-505

  Huth, Michael R A ^a   Jagadeesan, Radha ^b   Schmidt, David A ^c  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b DEPAUL UNIVERSITY   (United States)

^c Kansas State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23844521156     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129504004268     Document Type: Article

References (52)

1. Abramsky, S. (1991) A domain equation for bisimulation. Information and Computation 92 (2) 161–218.
2. Abramsky, S. and Jung, A. (1994) Domain theory. In: Abramsky, S., Gabbay, D. M. and Maibaum, T. S. E. (eds.) Handbook of Logic in Computer Science, Oxford University Press, 3 1–168.
3. Ball, T., Podelski, A. and Rajamani, S. K. (2001) Boolean and Cartesian Abstraction for Model Checking C Programs. In: Margaria, T. and Yi, W. (eds.) Proceedings of TACAS’2001, Genova, Italy. Springer-Verlag Lecture Notes in Computer Science 2031 268–283.
4. Bradfield, J. C. (1991) Verifying Temporal Properties of Systems, Birkhauser, Boston, Mass.
5. Bruns, G. and Godefroid, P. (1999) Model Checking Partial State Spaces with 3-Valued Temporal Logics. In: Proceedings of the 11th Conference on Computer Aided Verification. Springer-Verlag Lecture Notes in Computer Science 1633 274–287.
6. Bruns, G. and Godefroid, P. (2000) Generalized Model Checking: Reasoning about Partial State Spaces. In: Proceedings of CONCUR’2000 (11th International Conference on Concurrency Theory). Springer-Verlag Lecture Notes in Computer Science 1877 168–182.
7. Burch, J. R., Clarke, E. M., Dill, D. L., McMillan, K. L. and Hwang, J. (1990) Symbolic model checking: 1020 states and beyond. Proceedings of the Fifth Annual Symposium on Logic in Computer Science.
8. Chase, D., Wegman, M. and Zadeck, F. (1990) Analysis of pointers and structures. In: SIGPLAN Conf on Prog. Lang. Design and Implementation, ACM Press 296–310.
9. Clarke, E. M. and Emerson, E. A. (1981) Synthesis of synchronization skeletons for branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs Workshop. Springer-Verlag Lecture Notes in Computer Science 131 52–71.
10. Cousot, P. and Cousot, R. (1977) Abstract interpretation: a unified lattice model for static analysis of programs. In: Proc. 4th ACM Symp. on Principles of Programming Languages, ACM Press 238–252.
11. Cousot, P. and Cousot, R. (2000) Temporal abstract interpretation. In: Conference Record of the 27 th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Boston, Mass., ACM Press.
12. Dam, M. (1994) CTL* and ECTL* as Fragments of the Modal mu-Calculus. Theoretical Computer Science 126 77–96.
13. Dams, D. (1996) Abstract interpretation and partition refinement for model checking, Ph.D. thesis, Technische Universiteit Eindhoven, The Netherlands.
14. Dams, D., Gerth, R. and Grumberg, O. (1997) Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems 19 (2) 253–291.
15. Ghiya, R. and Hendren, L. J. (1996) Is it a Tree, a DAG, or a Cyclic Graph? A Shape Analysis for Heap-Directed Pointers in C. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 1–15. Godefroid, P., Huth, M. and Jagadeesan, R. (2001) Abstraction-based Model Checking using Modal Transition Systems. In: Proceedings of the International Conference on Theory and Practice of Concurrency. Springer-Verlag Lecture Notes in Computer Science 2154 426–440.
16. Gunter, C. (1992) The mixed power domain. Theoretical Computer Science 103 311–334.
17. Heckmann, R. (1990) Set Domains. In: Jones, N. D. (ed.) European Symposium on Programming. Springer-Verlag Lecture Notes in Computer Science 432 177–196.
18. Hennessy, M. C. B. and Milner, R. (1985) Algebraic laws for non-determinism and concurrency. JACM 32 137–161.
19. Hoare, C. A. R. (1985) Communicating Sequential Processes, Prentice-Hall.
20. Hofmann, K. H. and Mislove, M. (1981) Local compactness and continuous lattices. In: Banaschewski, B. and Hoffmann, R.-E. (eds.) Continuous Lattices. Springer-Verlag Lecture Notes in Computer Science 871 209–248.
21. Holzmann, G. (1997) The model checker SPIN. IEEE Transactions on Software Engineering 23 279–295.
22. Huth, M. (1999) A Unifying Framework for Model Checking Labeled Kripke Structures, Modal Transition Systems, and Interval Transition Systems. In: Proceedings of the 19th International Conference on the Foundations of Software Technology & Theoretical Computer Science, IIT Chennai, India. Springer-Verlag Lecture Notes in Computer Science 1738 369–380.
23. Huth, M. (2001) Domains of view: a foundation for specification and analysis. Chapter in: Domains and Processes, Kluwer Academic Press 183–218.
24. Huth, M. (2002a) Model checking modal transition systems using Kripke structures. In: Third International Workshop on Verification, Model Checking and Abstract Interpretation, Venice, Italy. Springer-Verlag Lecture Notes in Computer Science 2294 302–316.
25. Huth, M. (2002b) Possibilistic and Probabilistic Abstraction-Based Model Checking. In: Hermanns, H. and Segala, R. (eds.) Process Algebra and Probabilistic Methods, Performance Modeling and Verification, Second Joint International Workshop PAPM-PROBMIV 2002, Copenhagen, Denmark. Springer-Verlag Lecture Notes in Computer Science 2399 115–134.
26. Huth, M., Jagadeesan, R. and Schmidt, D. (2001) Modal transition systems: a foundation for three-valued program analysis. In: Sands, D. (ed.) Proceedings of the European Symposium on Programming (ESOP’2001), Springer Verlag 155–169.
27. Huth, M. and Pradhan, S. (2001) Model-Checking View-Based Partial Specifications. In: Brookes, S. and Mislove, M. (eds.) Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers 45.
28. Huth, M. and Pradhan, S. (2002) Lifting assertion and consistency checkers from single to multiple viewpoints. Technical Report TR 2002/11, Imperial College London, Department of Computing.
29. Jackson, D., Schechter, I. and Shlyakhter, I. (2000) Alcoa: the alloy constraint analyser. In: Proc. International Conference on Software Engineering, Limerick, Ireland.
30. Jackson, D., Shlyakhter, I. and Sridharan, M. (2001) A Micromodularity Mechanism. In Proceedings of the ACM SIGSOFT Conference on the Foundations of Software Engineering/European Software Engineering Conference (FSE/ESEC’01).
31. Jones, N. D. and Muchnick, S. (1979) Flow analysis and optimization of LISP-like structures. In: Proc. 6th ACM Symp. Principles of Programming Languages 244–256.
32. Jung, A. (1988) Cartesian Closed Categories of Domains, Ph.D. thesis, Fachbereich Mathematik, Technische Hochschule Darmstadt.
33. Kelb, P. (1994) Model checking and abstraction: a framework preserving both truth and failure information. Technical Report OFFIS, University of Oldenburg, Germany.
34. Kleene, S. C. (1952) Introduction to Metamathematics, Van Nostrand.
35. Kozen, D. (1983) Results on the propositional mu-calculus. Theoretical Computer Science 27 333–354. Kupferman, O. and Vardi, M. Y. (1998) Modular model checking. In: Proc. Compositionality Workshop. Springer-Verlag Lecture Notes in Computer Science 1536 381–401.
36. Larsen, K. G. (1989) Modal Specifications. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems, International Workshop, Grenoble, France. Springer-Verlag Lecture Notes in Computer Science 407 232–246.
37. Larsen, K. (1990) Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoretical Computer Science 72 265–288.
38. Larsen, K. G. and Thomsen, E. (1988) A Modal Process Logic. In: Third Annual Symposium on Logic in Computer Science, IEEE Computer Society Press 203–210.
39. Milner, R. (1981) A modal characterisation of observable machine behaviours. In: Astesiano, G. and Bohm, C. (eds.) CAAP '81. Springer-Verlag Lecture Notes in Computer Science 112 25–34.
40. Milner, R. (1989) Communication and Concurrency, Prentice-Hall.
41. Morikawa, O. (1989) Some modal logics based on a three-valued logic. Notre Dame J. of Formal Logic 30 130–137.
42. de Nicola, R. and Vaandrager, F. (1995) Three Logics for Branching Bisimulation. Journal of the Association of Computing Machinery 42 (2) 458–487.
43. Nuseibeh, B., Kramer, J. and Finkelstein, A. (1994) A Framework for Expressing the Relationships Between Multiple Views in Requirements Specification. IEEE Transactions on Software Engineering 20 (10) 760–773.
44. Park, D. M. R. (1989) Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) In: Proc. of the 5th GI Conference. Springer-Verlag Lecture Notes in Computer Science 104 167–183.
45. Plotkin, G. D. (1976) A powerdomain construction. SIAM Journal on Computing 5 452–487.
46. Plotkin, G. D. (1981) A Structural Approach to Operational Semantics. Technical Report FN-19, DAIMI, Computer Science Department, Aarhus University, Ny Munkegade, Building 540, DK-8000 Aarhus, Denmark. (Reprinted April 1991.)
47. Sagiv, M., Reps, T. and Wilhelm, R. (1999) Parametric Shape Analysis via 3-Valued Logic. In: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, Texas 105–118.
48. Schmidt, D. A. (2001) From Trace Sets to Modal-Transition Systems by Stepwise Abstract Interpretation. (Submitted for publication.)
49. Segerberg, K. (1967) Some modal logics based on a three-valued logic. Theoria 33 53–71.
50. Smyth, M. B. (1978) Powerdomains. Journal of Computer and Systems Sciences 16 23–36.
51. Walker, D. J. (1990) Bisimulation and divergence. Information and Computation 85 (2) 202–241.
52. Whaley, J. and Rinard, M. (1999) Compositional pointer and escape analysis for Java programs. In: Proc. OOPSLAV9, ACM 187–206.