Refinement is complete for implementations

Formal Aspects of Computing

Volumn 17, Issue 2, 2005, Pages 113-137

  Huth, Michael ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Implementation relation; Modal transition systems; Model checking; Refinement

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING; COMPUTER SOFTWARE; MATHEMATICAL MODELS; MODAL ANALYSIS;

IMPLEMENTATION RELATION; MODAL TRANSITION SYSTEM; MODEL CHECKING; REFINEMENT;

COMPUTER SCIENCE;

EID: 23844521586     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-005-0063-z     Document Type: Article

References (41)

1. [ABH97] Alessi F, Baldan P, Honsell F (1997) Partializing Stone spaces using SFP domains. In: Bidoit M, Dauchet M, (eds), TAPSOFT'97 conference proceedings, Lille, France, 14-18. lecture notes in computer science, vol. 1214. Springer, Berlin Heidelberg New York, pp 478-489
2. [AJ94] Abramsky S, Jung A (1994) Domain theory. In: Abramsky S, Gabbay DM, Maibaum TSE, (eds), Handbook of Logic in Computer Science, vol. 3. Oxford University Press, pp 1-168
3. [BCCZ99] Biere A, Cimatti A, Clarke E, Zhu Y (1999) Symbolic model checking without BDDs. In: Proceedings of tools and algorithms for the analysis and construction of systems, lecture notes in computer science, vol. 1579 pp 193-207
4. [BG99] Bruns G, Godefroid P (1999) Model checking partial state spaces with 3-valued temporal logics. In: Proceedings of the 11th conference on computer aided verification, lecture notes in computer science, vol. 1633. Springer, Berlin Heidelberg New York, pp 274-287
5. [BG00] Bruns G, Godefroid P (2000) Generalized model checking: reasoning about partial state spaces. In: Proceedings of the 11th international conference on concurrency theory, lecture notes in computer science, vol. 1877. Springer, Berlin Heidelberg New York, pp 168-182
6. [Bla80] Blarney S (1980) Partial-valued logic. PhD Thesis, University of Oxford, Oxford
7. [CC77] Cousot P, Cousot R (1977) Abstract interpretation: a unified lattice model for static analysis of programs. In: Proceedings 4th ACM symposium on principles of programming languages, Los Angeles
8. [CC00] Cousot P, Cousot R (2000) Temporal abstract interpretation. In: Conference record of the 27th annual ACM SIGPLAN-SIGACT symposium on principles of programming languages. Boston, MA, January 2000. ACM Press, New York, pp 12-25
9. [CE81] Clarke EM, Emerson EA (1981) Synthesis of synchronization skeletons for branching time temporal logic. In: Kozen D, (ed), Logic of programs workshop, Yorktown Heights, New York, May 1981. lecture notes in computer science, No. 131. Springer Berlin Heidelberg, New York
10. [CGL94] Clarke EM, Grumberg O, Long DE (1994) Model checking and abstraction. ACM Trans Program Lang Syst, 16(5): 1512-1542
11. [CN76] Courcelle B, Nivat M (1976) Algebraic families of interpretations. In: Proceedings of the 17th IEEE symposium on foundations of computer science, pp 137-146
12. [Dam96] Dams D (1996) Abstract interpretation and partition refinement for model checking. PhD Thesis, Technische Universiteit Eindhoven, The Netherlands
13. [DGG97] Dams D, Gerth R, Grumberg O (1997) Abstract interpretation of reactive systems. ACM Trans Program Lang Syst, 19:253-291
14. [DN04] Dams D, Namjoshi K (2004) The existence of finite abstractions for branching time model checking. In: Proceedings of the 19th annual IEEE symposium on logic in computer science, Turku, Finland, 13-17 July 2004. IEEE Computer Society Press, pp 335-344
15. [EJS03] Eisenbach S, Jurisic V, Sadler C (2003) Modeling the evolution of NET programs. In: IFIP international conference on formal methods for open distributed systems, Lecture notes in computer science. Springer, Berlin Heidelberg New York
16. [FdR03] Franceschet M, de Rijke M (2003) Model checking for hybrid logics. In: Proceedings of the workshop on methods for modalities. INRIA Lorraine, Nancy
17. [GHJ01] Godefroid P, Huth M, Jagadeesan R (2001) Abstraction-based model checking using modal transition systems. In: Proceedings of the 12th international conference on theory and practice of concurrency, lecture notes in computer science, vol 2154. Springer Berlin Heidelberg New York, pp 426-440
18. [GJ02] Godefroid P, Jagadeesan R (2002) Automatic abstraction using generalized model checking. In: Brinksma E, Larsen KG, (eds), Proceedings of the 14th international conference on computer aided verification, Copenhagen, Denmark, July 2002. lecture notes in computer science, Springer, Berlin Heidelberg New York, pp 137-150
19. [GJ03] Godefroid P, Jagadeesan R (2003) On the expressiveness of 3-valued models. In: Zuck LD, Attie PC, Cortesi A, Mukhopadhyay S, (eds), Proceedings of the 4th conference on verification, model checking and abstract interpretation, lecture notes in computer science, vol 2575. Springer, Berlin Heidelberg New York, pp 206-222
20. [GPVW95] Gerth R, Peled D, Vardi MY, Wolper P (1995) Simple on-the-fly verification of linear temporal logic. In: Protocol specification, testing and verification. Chapman & Hall, London, pp 3-18
21. [GTWW77] Goguen JA, Thatcher JW, Wagner EG, Wright JB (1977) Initial algebra semantics and continuous algebras. J ACM 24(1):44-67
22. [Gun92] Gunter C (1992) The mixed power domain. Theoret Comp Sci 103:311-334
23. [Hec90] Heckmann R (1990) Set domains. In: Proceedings of the 3rd European symposium on programming, Copenhagen, Denmark, 1990. Springer, Berlin Heidelberg New York, pp 177-196
24. [Hec91] Heckmann R (1991) Power domain constructions. Sci Comp Program, 17(1-3):77-117
25. [HH04] Hussain A, Huth M (2004) On model checking multiple hybrid views. In: Preliminary proceedings of the 1st international symposium on leveraging applications of formal method, Paphos, Cyprus, 30 October - 2 November 2004. Technical report TR-2004-6 department of computer science, University of Cyprus, pp 235-242
26. [HJS01] Huth M, Jagadeesan R, Schmidt DA (2001) Modal transition systems: a foundation for three-valued program analysis. In: Sands D. (ed), Proceedings of the European symposium on programming, lecture notes in computer science, vol 2028. Springer, Berlin Heidelberg New York, pp 155-169
27. [HJS04] Huth M, Jagadeesan R, Schmidt D (2004) A domain equation for refinement of partial systems. Math Struct Comp Sci 14(4):469-505
28. [HM81] Hofmann KH, Mislove M (1981) Local compactness and continuous lattices. In: Banaschewski B, Hoffmann RE, (eds), Continuous lattices, Bremen, Germany, 1981. lecture notes in mathematics, vol 871. Springer, Berlin Heidelberg New York, pp 209-248
29. [HM85] Hennessy M, Milner R (1985) Algebraic laws for nondeterminism and concurrency. J ACM 32(1): 137-161
30. [Hut04] Huth M (2004) Beyond image-finiteness: labelled transition systems as a Stone space. In: Proceedings of the 19th annual IEEE symposium on logic in computer science, Turku, Finland, 13-17 July 2004. IEEE Computer Society Press, pp 222-231
31. [Hut05] Huth M (2005) Labelled transition systems as a Stone space. Log Methods Comp Sci 1(1): 1-28. www.lmcs-online.org.
32. [Kle52] Kleene SC (1952) Introduction to metamathematics. Van Nostrand, Crystal city
33. [Koz83] Kozen D (1983) Results on the prepositional mu-calculus. Theor Comp Sci 27:333-354
34. [Lar89] Larsen KG (1989) Modal specifications. In: Sifakis J, (ed), Automatic verification methods for finite state systems, Grenoble, France, 12-14 June 1989. No. 407 lecture notes in computer science, Springer, Berlin Heidelberg New York, pp 232-246
35. [LT88] Larsen KG, Thomsen B (1988) A modal process logic. In: 3rd annual IEEE symposium on logic in computer science. IEEE Computer Society Press, Los Angeles, pp 203-210
36. [NNH99] Nielson F, Nielson HR, Hankin C (1999) Principles of program analysis. Springer, Berlin Heidelberg New York
37. [QS81] Quielle JP, Sifakis J (1981) Specification and verification of concurrent systems in CESAR. In: Proceedings of the 5th international symposium on programming
38. [RLS02] Reps T, Loginov A, Sagiv M (2002) Semantic minimization of 3-valued prepositional formulae. In: Proceedings of the 17th annual IEEE symposium on logic in computer science, Copenhagen, Denmark, 22-25 July 2002. IEEE Computer Society Press, pp 40-51
39. [Sti96] Stirling C (1996) Games and Modal Mu-Calculus. In: Margaria T, Steffen B, (eds), Proceedings of the 2nd international workshop in tools and algorithms for construction and analysis of systems, Passau, Germany, 27-29 March 1996. lecture notes in computer science, vol 1055. Springer, Berlin Heidelberg New York, pp 298-312
40. [UC04] Uchitel S, Chechik M (2004) Merging partial behavioural models. ACM SIGSOFT Notes 29(6):43-52
41. [vF66] van Fraassen BC (1966) Singular terms, truth-value gaps and free logic. J Philos 63:481-495