C.A.R. Hoare. Some properties of predicate transformers. Journal of the ACM, 25:461--480, 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Domain Theory for Concurrency - Nygaard, Winskel (2003) (1 citation) (Correct)
....followed in what seemed originally to be two di#erent directions, one being Matthew Hennessy s semantics for CCS with process passing [22] in which a process denotes the set of its computation paths. We ll call this kind of semantics a path semantics because of its similarity to trace semantics [24]; in both cases, processes denote downwards closed sets of computation paths and the corresponding notion of process equivalence, called path equivalence, is given by equality of such sets. Computation paths, however, may have more structure than traditional traces, e.g. allowing path semantics to ....
C. A. R. Hoare. Some properties of predicate transformers. Journal of the ACM, 25(3):461--480, 1987.
Compositional Experimental Analysis of Cellular.. - Flocchini, Geurts.. (1996) (Correct)
....program theory, where they prove most useful. 4 In computing science, programs are defined as relations, and predicate transformers express their semantics. Standard composition operators are introduced to build nondeterministic sequential programs, and their execution effect must be determined [18, 30, 19]. Parallel programs require further composition operators. There, the compositional analysis amounts to prove theorems extending specific properties from basic systems to composed ones [1, 43] For instance, a program is represented by the set of its possible execution traces; composition is then ....
C. A. R. Hoare. Some properties of predicate transformers. Journal of the ACM, 25(3):461--480, 1978.
Escape Analysis: Correctness Proof, Implementation and.. - Blanchet (1998) (1 citation) (Correct)
....which are useful to define the correctness of the analysis: a store is an association list to remember the history of its changes, but we also consider a store as a function which maps every location to its contents: Store = Loc SV . This is similar to Hoare s definition of execution traces [21] as sequences of tests and assignments. In environments, we memorize not only the value but also the store in which it has been created. 3 Escape Analysis on Paths The following analysis can be applied as it is to any functional language, even untyped. It is also very precise, so it can be used ....
Hoare, C. Some properties of predicate transformers. Journal of the ACM 25, 3 (1978), 461 -- 480.
On the Relations between Intelligent Backtracking and.. - Kambhampati (1997) (7 citations) (Correct)
No context found.
C.A.R. Hoare. Some properties of predicate transformers. Journal of the ACM, 25:461--480, 1978.
Domain Theory for Concurrency - Glynn (2003) (1 citation) (Correct)
No context found.
C. A. R. Hoare. Some properties of predicate transformers. Journal of the ACM, 25(3):461--480, 1987. 30
Formal Methods - Selected Historical References - Jones, McCauley (1992) (1 citation) (Correct)
No context found.
C. A. R. Hoare. Some properties of predicate transformers. Journal of the ACM, 25:461--80, July 1978.
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