Results 1 
3 of
3
Constraints: A Uniform Approach to Aliasing and Typing
 In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, ACM SIGACTSIGPLAN
, 1984
"... A constraint is a relation among program variables that is maintained throughout execution. Type declarations and a very general form of aliasing can be expressed as constraints. A proof system based upon the interpretation of Hoare triples as temporal logic formulas is given for reasoning about pro ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
A constraint is a relation among program variables that is maintained throughout execution. Type declarations and a very general form of aliasing can be expressed as constraints. A proof system based upon the interpretation of Hoare triples as temporal logic formulas is given for reasoning about programs with constraints. The proof system is shown to be sound and relatively complete, and example program proofs are given. 1 Introduction Type declarations and aliasing relations have traditionally been thought of as unrelated concepts. However, both can be viewed as specifying properties that do not change during program execution. This view leads to a uniform method for reasoning about types and aliasing in which the usual Hoare logic triples are regarded as temporal logic formulas. Aliasing two variables x and y means they always have the same value. This is usually implemented by allocating the same memory location to x # Work supported in part by the National Science Foundation unde...
Reasoning about Programs by Exploiting The Environment
 In Annual International Colloquium on Automata, Languages and Programming
, 1994
"... A method for making aspects of a computational model explicit in the formulas of a programming logic is given. The method is based on a new notion of environmentan environment augments the state transitions defined by a program's atomic actions rather than being interleaved with them. Two simp ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
A method for making aspects of a computational model explicit in the formulas of a programming logic is given. The method is based on a new notion of environmentan environment augments the state transitions defined by a program's atomic actions rather than being interleaved with them. Two simple semantic principles are presented for extending a programming logic in order to reason about executions feasible in various environments.
An Axiomatic Semantics of Concurrent Programming Languages
, 1984
"... this paper, I present a new compositional, truly axiomatic semantics for concurrent programming languages. It is based upon temporal logic, but employs five fundamental ideas beyond those found in most temporal logic methods: ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
this paper, I present a new compositional, truly axiomatic semantics for concurrent programming languages. It is based upon temporal logic, but employs five fundamental ideas beyond those found in most temporal logic methods: