Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Extended abstract)

Electronic Notes in Theoretical Computer Science

Volumn 6, Issue , 1997, Pages 77-102

  Cousot, Patrick ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; FUNCTIONS; LOGIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; SUPERVISORY AND EXECUTIVE PROGRAMS; THEOREM PROVING;

DENOTATIONAL SEMANTICS; GALOIS CONNECTION; HOARE LOGIC; PROGRAM SEMANTICS;

HIERARCHICAL SYSTEMS;

EID: 18944390494     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80168-9     Document Type: Conference Paper

References (37)

1. Abramsky S., Jung A. Domain theory. Abramsky S., Gabbay Dov M., Maibaum T.S.E. Vol. 3 of Handbook of Logic in Computer Science, ch. 1. 1994;1-168 Clarendon Press
2. Apt K.R., Plotkin G.D. Countable nondeterminism and random assignment. J. ACM. 33:(4):oct 1986;724-767
3. Arnold A., Nivat M. Formal computations of non deterministic recursive program schemes. Math. System Theory. 13:1980;219-236
4. Back R.J.R. A continuous semantics for unbounded nondeterminism. TCS. 23:1983;187-210
5. Broy M., Gnatz R., Wirsing M. Semantics of nondeterministic and noncontinuous constructs. LNCS 69. 1979;553-592 Springer
6. Broy M., Nelson G. Can fair choice be added to Dijkstra's calculus. TOPLAS. 16:(3):1994;924-938
7. Cousot P. Semantic foundations of program analysis. Muchnick S.S., Jones N.D. Program Flow Analysis: Theory and Applications, ch. 10. 1981;303-342 Prentice-Hall
8. Cousot P. Abstract interpretation. ACM Comput. Surv. 28:(2):1996;324-328
9. Cousot R., Cousot P. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. 4th POPL. 1977;238-252 ACM Press
10. Cousot P., Cousot R. Systematic design of program analysis frameworks. 6th POPL. 1979;269-282 ACM Press
11. Cousot P., Cousot R. Induction principles for proving invariance properties of programs. Neel D. Tools & Notions for Program Construction. 1982;43-119 Cambridge Univ. Press
12. Cousot P., Cousot R. Inductive definitions, semantics and abstract interpretation. 19th POPL. 1992;83-94 ACM Press
13. P. Cousot fe R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper. In Proc. 1994 ICCL, pp. 95 - 112. IEEE Comp. Soc. Press, 1994.
14. de Bakker J.W., Meyer J.-J.Ch., Zucker J.I. On infinite computations in denotational semantics. TCS. 26:1983;53-82. Corrigendum: TCS 29:229-230
15. Dijkstra E.W. Guarded commands, nondeterminacy and formal derivation of programs. Comm. ACM. 18:(8):aug 1975;453-457
16. Dijkstra E.W., Scholten C.S. Predicate Calculus and Program Semantics. 1990;Springer
17. Dijkstra E.W., van Gasteren A.J.M. A simple fixpoint argument without the restriction to continuity. Acta Inf. 23:1986;1-7
18. R.W. Floyd. Assigning meaning to programs. In J.T. Schwartz, ed., Proc. Symposium in Applied Mathematics, vol. 19, pp. 19 - 32. AMS, 1967.
19. Gunter C.A., Scott D.S. Semantic domains. van Leeuwen J. ol. B of Handbook of Theoretical Computer Science, ch. 12. 1990;633-674 Elsevier
20. Hoare C.A.R. An axiomatic basis for computer programming. Comm. ACM. 12:(10):1969;576-580. 583, oct
21. Jacobs D., Gries D. General correctness: A unification of partial and total correctness. Acta Inf. 22:1985;67-83
22. Kahn G. Natural semantics. Fuchi K. Programming of Future Generation Computers. 1988;237-258 Elsevier
23. Majster-Cederbaum M.E. A simple relation between relational and predicate transformer semantics for nondeterministic programs. Inf. Process. Lett. 11:(4, 5):1980, 12 dec;190-192
24. Manna Z., Pnueli A. Axiomatic approach to total correctness. Acta Inf. 3:1974;253-263
25. Milner R. Operational and algebraic semantics of concurrent processes. van Leeuwen J. olume B of Handbook of Theoretical Computer Science, ch. 19. 1990;1201-1242 Elsevier
26. Milner R., Tofte M. Co-induction in relational semantics. TCS. 87:1991;209-220
27. Naur P. Proofs of algorithms by general snapshots. BIT. 6:1966;310-316
28. Nelson G. A generalization of Dijkstra's calculus. TOPLAS. 11:(4):apr 1989;517-561
29. Park D. Fixpoint, induction and proofs of program properties. Meltzer B., Michie D. Machine Intelligence. volume 5:1969;59-78 Edinburgh Univ. Press
30. Park D. On the semantics of fair parallelism. LNCS. 86:1980;504-526. Springer
31. Pitts A.M. Operational semantics for program equivalence. Invited address, MFPS XIII, CMU, Pittsburgh. mar 1997;23-26. http://www.cl.cam.ac.uk/ users/ap/talks
32. G.D. Plotkin. A structural approach to operational semantics. Tech. Report DAIMI FN-19, Aarhus Univ., 1981.
33. Scott D. Outline of a mathematical theory of computation. Tech. Monograph PRG-2, Oxford Univ. Computing Lab. 1970;Programming Research Group, Oxford
34. Scott D. The lattice of flow diagrams. Engeler E. Semantics of Algorithmic Languages LNM. 188:1971;311-366. Springer
35. Shmuely Z. The structure of Galois connections. Pacific J. Math. 54:(2):1974;209-225
36. van Glabbeek R.J. The linear time - branching time spectrum (extended abstract). LNCS. 458:1990;278-297. Springer
37. Ward M. The closure operators of a lattice. Ann. Math. 43:1942;191-196