MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Axiomatizing operational equivalence in the presence of side effects (1989) [14 citations — 7 self]

Download:
pdf | ps
by Ian A. Mason, Carolyn Talcott
In Fourth Annual Symposium on Logic in Computer Science. IEEE
http://turing.une.edu.au/~iam/Data/Papers/89lics.ps
Add To MetaCart

Abstract:

In this paper we present a formal system for deriving assertions about programs with side effects. The assertions we consider are of the following two forms:

Citations

138 Fast decision procedures based on congruence closure – Nelson, Oppen - 1980
131 Call-by-name, call-by-value, and the lambda calculus – Plotkin - 1975
126 Lambda-Calculus Models of Programming Languages – Morris - 1968
28 Programming, transforming, and proving with function abstractions and memories – Mason, Talcott - 1989
25 Reasoning about recursively defined data structures – Oppen - 1980
23 The Semantics of Destructive Lisp – Mason - 1986
21 Side Effects and Aliasing Can Have Simple Axiomatic Descriptions – Boehm - 1985
18 The Calculi of Lambda-v-cs Conversion: A Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages – Felleisen - 1987
14 v-CS: An extended *-calculus for Scheme – Felleisen - 1988
8 A sound and complete axiomatization of operational equivalence between programs with memory – Mason, Talcott - 1989
3 Equivalence of first order Lisp programs: Proving properties of destructive programs via transformation – Mason - 1986
2 Memories of S-expressions: Proving properties of Lisp-like programs that destructively alter memory – Mason, Talcott - 1985
1 Deriving and using destructive data types, IFIP TC2 working conference on program specification and transformation – J��rring, Scherlis - 1986
1 Verification of programs which destructively alter data – Mason - 1988
1 A basic abstract semantic algebra, in: Semantics of data types, international symposium, Sophia-Antipolis – Mosses - 1984