See this document in CiteSeerX!

A Sound and Complete Axiomatization of Operational Equivalence between Programs with Memory (1989)  (Make Corrections)  (8 citations)
Ian Mason, Carolyn Talcott



  Home/Search   Context   Related

 
View or download:
une.edu.au/~iam/Data/Paper...89cmtr.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  une.edu.au/~iam...ublicationlist (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper we present a formal system for deriving assertions about programs with memory. The assertions we consider are of the following three forms: (i) e diverges (i.e. fails to reduce to a value), written " e; (ii) e 0 and e 1 reduce to the same value and have exactly the same effect on memory, written e 0 ¸ e 1 ; and (iii) e 0 and e 1 reduce to the same value and have the same effect on memory up to production of garbage (are strongly isomorphic), written e 0 ' e 1 . The e, e j are... (Update)

Context of citations to this paper:   More

...of the operational semantics which is also useful for reasoning about programs in general. A full account of the proof may be found in [10]. We conclude this section with a summary of notational conventions. We use the usual notation for set membership and function...

.... system which is complete for zero order terms (first order expressions not involving recursively defined functions) is given in [10, 12, 14]. Constrained equivalence restricted to the empty set of constraints implies operational equivalence and is the same as operational...

Cited by:   More
Notions of Computation and Monads - Moggi (1989)   (Correct)
A First Order Logic of Effects - Mason (1996)   (Correct)
Equivalence in Functional Languages with Effects - Mason, Talcott (1991)   (Correct)

Similar documents (at the sentence level):
46.7%:   Inferring the Equivalence of Functional Programs that Mutate Data - Mason, Talcott (1992)   (Correct)
36.9%:   Axiomatizing Operational Equivalence in the presence of Side.. - Mason, Talcott (1989)   (Correct)
6.4%:   Programming, Transforming, and Proving with Function.. - Mason, Talcott   (Correct)

Active bibliography (related documents):   More   All
0.0:   Situated Modeling of Epistemic Puzzles - Ersan, Akman (1995)   (Correct)
0.0:   Lectures on Reasoning about Shared Mutable Data Structure Part 1 - Reynolds (2000)   (Correct)
0.0:   Some notes on HPSG binding theory for Polish - Kupsc, Marciniak   (Correct)

Similar documents based on text:   More   All
0.5:   A Theory of Binding Structures and Applications to Rewriting - Talcott (1991)   (Correct)
0.3:   FOL Contexts -- the Data Structures - Richard Weyhrauch Ibuki (1997)   (Correct)
0.3:   Reasoning about Programs with Effects - Mason, Talcott (1990)   (Correct)

Related documents from co-citation:   More   All
5:   Computational lambda-calculus and monads - Moggi - 1989
4:   The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
4:   CS Conversion: A Syntactic Theory of Control and State in Imperative Higher-Orde.. (context) - Felleisen, of - 1987

BibTeX entry:   (Update)

Mason, I.A. and C. Talcott. A sound and complete axiomatization of operational equivalence between programs with memory. In Proc. Symposium on Logic in Computer Science, 1989, 284--293. http://citeseer.ist.psu.edu/mason89sound.html   More

@techreport{ mason89sound,
    author = "Ian A. Mason and Carolyn L. Talcott",
    title = "A Sound and Complete Axiomatization of Operational Equivalence between Programs with Memory",
    number = "STAN-CS-89-1250",
    year = "1989",
    url = "citeseer.ist.psu.edu/mason89sound.html" }
Citations (may not include all citations):
11   Center for the Study of Language and Information (context) - of, Lisp et al. - 1986
2   cs conversion: A syntactic theory of control and state in im.. (context) - of - 1987
1   Massachusetts Institute of Technology (context) - models, languages et al. - 1968
1   ACM TOPLAS (context) - effects, have et al. - 1985
1   IFIP TC2 working conference on program specification and tra.. (context) - using, types - 1986
1   Computer Science Department Report STAN--CS (context) - procedures, congruence - 1977
1   and Proving with function abstractions and memories (context) - Transforming - 1989
1   Science of Computer Programing (context) - programs, alter - 1988
1   Computer Science Department Report STAN--CS (context) - recursively, structures - 1978
1   Fourth Annual Symposium on logic in computer science (context) - Equivalence, presence et al.



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://turing.une.edu.au/~iam/Data/hand-made-publication-list.html):   More
Metamathematics Of Contexts - Buvac, Buvac, Mason   (Correct)
Program Transformation via Contextual Assertions - Mason, Talcott (1994)   (Correct)
References, Local Variables and Operational Reasoning - Mason, Talcott   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC