Program verification based on denotational semantics

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1981, Pages 149-158

  Polak, Wolfgang ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

ASSERTION LANGUAGE; COMPUTABLE FUNCTIONS; CONTINUATION SEMANTICS; DENOTATIONAL SEMANTICS; MECHANICAL CONSTRUCTION; PROGRAM VERIFICATION; SEQUENTIAL LANGUAGES; VERIFICATION CONDITION;

SEMANTICS;

EID: 84942007189     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/567532.567549     Document Type: Conference Paper

References (24)

1. [C177] Clarke, E.M.: Program Invariants as Fixed Points; Dept. of Computer Science, Duke University, CS-1977-5
2. [Di76] Dijkstra, E.W.: A Discipline of Programming; Prentice Hall, 1976
3. [Do76] Donahue, J. E.: Complementary Definitions of Programming Language Semantics; Lecture Notes in Computer Science 42, Springer, 1976
4. [F167] Floyd, R. W.: Assigning Meanings to Programs; Proceedings of Symp. in Applied Mathematics 19 (1967)
5. [GM77] Gordon, M., Milner, R., Wadsworth, C.: Edinburgh LCF; Internal report CSR-11-77, University of Edinburgh
6. [Ho69] Hoare, C. A. R.: An Axiomatic Basis of Computer Programming; CACM 12, Oct, pp 576-580 (1969)
7. [HL74] Hoare, C. A. R., Lauer, P.E: Consistent and Complementary Formal Theories of the Semantics of Programming Languages; Acta Informatica 3, pp 135-154, (1974)
8. [IL75] Igarashi, S., London, R. L., Luckham, D. C.: Automatic Program Verification 1: Logical Basis and Its Implementation; Acta Informatica, Vol 4, pp 145-182 (1975)
9. [Li75] Ligler, G.: Surface Properties of Programming Language Constructs; in Proving and improving programs, G. Huet, G. Kahn (ed.), Arc-et-Senans, 1975
10. [Ma7l] Maiurldewicz, A.: Proving Algorithms by Tail Functions; Information and Control, 18 (1971), pp 220-226
11. [MS76] Milne, R., Strachey, C.: A theory of programming language temantict; Chapman and Hall, London 1976
12. [Mi77] Milne, R.: Transforming Predicate Transformers; IFIP working conference on formal description of programming concepts, Saint Andrews, 1977
13. [OC78] Oppen, D. C., Cartwright, R: Reasoning about recursively defined data structures; Proc. fifth ACM Symp. on Principles of Programming languages, 1978
14. [P176] Plotkin G.: A powerdomain construction.; SIAM Journal of Computing 5, 1976, 452-487.
15. ω a Universal Domain; Journal of computer and system sciences 17, pp 209-236 (1978)
16. [Re74] Reynolds, J.C.: On the Relation between Direct and Continuation Semantics; Proc. 2nd Coll. on Automata, Languages and Programming, Saarbriicken, pp. 157-168, 1974
17. [Sc78] Schwartz, R.L.: An Axiomatic Semantic Definition of ALGOL 68; CS Dept, UCLA, UCLA-34-P214-75, Aug. 78
18. [Sc72] Scott, D.: Lattice Theory, Data Types and Semantics; NYU Symp. on Formal Semantics, Prentice-Hall, New York (1972)
19. [SS7l] Scott, D., Straehey, C.: Toward a Mathematical Semantics for Computer Languages; Tech. Monograph PRG-6, Programming Research Group, University of Oxford (1971)
20. [Sm78] Smyth M.B.: Power domains, Journal of Computer and System Sciences 16, 1978, 23-36.
21. [St77] Stoy, J.: Denotational Semantics - The Scott-Strachey Approach to Language Theory; MIT Press, Cambridge (1977)
22. [SW74] Straehey, C., Wadsworth, C. P.: Continuations, a Mathematical Semantics for Handling Full Jumps; Technical Monograph PRG-11, Oxford University, 1974
23. [Te76] Tennent, R.D.: The Denotational Semantics of Programming Languages; CACM, 19 (1976) pp437-453
24. [Te77] Tennent, R.D.: A Denotational Definition of the Programming Language Pascal; Tech. Report 77-47, Queen's University, Kingston, Ontario (1977), revised 1978