R. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7:23--50, 1972. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Semantics of General References by a Hierarchy of Gödel.. - Ahmed, Appel, Virga (Correct)
....of programs with mutable references as long as these properties are expressed as types. There has been a great deal of work on program proving for pointers; here, we discuss only the formalism described by Ishtiaq and O Hearn [9] which is closely related to the work of Burstall and Reynolds [4, 21]) When proving properties of programs that mutate the heap, a great deal of effort is spent reasoning about what does not change. Ishtiaq and O Hearn use the BI logic [14] which 9 provides a spatial form of conjunction # such that the statement P #Q is true just when the current heap can be ....
Rodney M. Burstall. Some techniques for proving correctness of programs which alter data structures. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland, 1972.
A Stratified Semantics of General References Embeddable in.. - Ahmed, Appel, Virga (2002) (5 citations) (Correct)
....of programs with mutable references as long as these properties are expressed as types. There has been a great deal of work on program proving for pointers; here, we discuss only the formalism described by Ishtiaq and O Hearn [14] which is closely related to the work of Burstall and Reynolds [7, 28]) When proving properties of programs that mutate the heap, a great deal of effort is spent reasoning about what does not change. Ishtiaq and O Hearn use the BI logic [20] which provides a spatial form of conjunction such that the statement P Q is true just when the current heap can be ....
R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland, 1972.
Separation Logic: A Logic for Shared Mutable Data Structures - Reynolds (2002) (104 citations) (Correct)
....rule called the frame rule , one can infer directly that the program does not affect the list x from the fact that assertions such as (3) do not refer to this list. The central concept of a separating conjunction is implicit in Burstall s early idea of a distinct nonrepeating tree system [2]. In lectures in the fall of 1999, I described the concept explicitly, and embedded it in a flawed extension of Hoare logic [16, 17] Soon thereafter, an intuitionistic logic based on this idea was discovered independently by Ishtiaq and O Hearn [19] and by myself [28] Realizing that this logic ....
R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland, 1972.
BI as an Assertion Language for Mutable Data Structures - Ishtiaq, O'Hearn (2000) (82 citations) (Correct)
....a cell that is altered, in which case assignment to the cell a#ects seemingly unrelated expressions. The real problem is to control, or understand, this complexity, rather than simply to axiomatize it. A striking advance has been recently made by Reynolds [35] building on early work of Burstall [5]. The main novelty is the use of a spatial form of conjunction P Q, that splits the heap into distinct portions that the di#erent conjuncts talk about. In addition, there is a form of assertion, the points to relation which is used to make statements about the contents of heap cells. For ....
....significant here. For, if we had = #x. 1, 2, and y then we could obtain 1, 2) the consequent of which is contradictory. 10. SUMMARY AND RELATED WORK The most relevant related work is contained in the two main precursors, the papers of Burstall and Reynolds [5, 35]. To summarize our additions to [35] we have: i) provided a classical model, and investigated the relation between classical and intuitionistic variants; ii) added BI s spatial implication to the assertion language, and used it to express weakest preconditions; iii) given a treatment of ....
Burstall, R. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence 7 (1972), 23--50.
Alias Types for Recursive Data Structures - Walker, Morrisett (2000) (67 citations) (Correct)
.... builds upon foundational work by other groups on syntactic control of interference [31] linear logic [13] and linear type systems in functional programming languages [20, 42, 1, 15, 3, 8, 40] Our research also has much in common with e orts to de ne program logics for reasoning about aliasing [6, 9, 26, 32, 17]. In particular, if we view propositions as types, there are striking similarities with recent work by Reynolds [32] who builds on earlier research by Burstall [6] Reynolds logic employs a spatial conjunction, which, like our operator, joins two operands that depend upon disjoint portions of ....
.... 15, 3, 8, 40] Our research also has much in common with e orts to de ne program logics for reasoning about aliasing [6, 9, 26, 32, 17] In particular, if we view propositions as types, there are striking similarities with recent work by Reynolds [32] who builds on earlier research by Burstall [6]. Reynolds logic employs a spatial conjunction, which, like our operator, joins two operands that depend upon disjoint portions of the store. Updating a single memory cell can alter at most one of the propositions joined by Reynolds conjunction, making it possible to state simple Hoare logic ....
Rodney M. Burstall. Some techniques for proving correctness of programs which alter data structures. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence, pages 23-50, Edinburgh, 1972. Edinburgh University Press.
Expressions, Commands, and Assertions - Reynolds (2002) Self-citation (Burstall) (Correct)
No context found.
Rodney M. Burstall. Some techniques for proving correctness of programs which alter data structures. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence 7, pages 23-50. Edinburgh University Press, Edinburgh, Scotland, 1972.
Permission Accounting in Separation Logic - Richard Bornat School (2005) (1 citation) (Correct)
No context found.
R. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7:23--50, 1972.
Safety and Liveness in Concurrent Pointer Programs - Distefano, Katoen, Rensink (Correct)
No context found.
R. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence 6: 23--50, 1971.
On Spatial Conjunction as Second-Order Logic - Kuncak, Rinard (2004) (Correct)
No context found.
R. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7, 1972.
BI as an Assertion Language for Mutable Data Structures - Samin Ishtiaq Peter (2000) (82 citations) (Correct)
No context found.
Burstall, R. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence 7 (1972), 23-50.
Who is Pointing When to Whom? On the Automated.. - Distefano, Katoen.. (2004) (Correct)
No context found.
R. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence 6: 23--50, 1971.
Using Separation Logic to go from Functional Specifications to .. - Rezk, Blanco (2003) (Correct)
No context found.
Burstall R. M. Some techniques for proving correctness of programs which alter data structures.In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 23-50. Edinburgh University Press, Edinburgh, Scotland, 1972.
Multi-Prover Veri - Cation Of Programs (Correct)
No context found.
R. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7:23-50, 72.
The Semantics of C++ Data Types: Towards Verifying Low-Level.. - Hohmuth, Tews (2003) (Correct)
No context found.
R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Mitchie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland., 1972.
The Semantics of C++ Data Types: Towards Verifying Low-Level.. - Hohmuth, Tews (2003) (Correct)
No context found.
R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Mitchie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland., 1972.
Theorem Proving in Higher Order Logics - Basin, (eds.) (2003) (Correct)
No context found.
R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Mitchie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland., 1972.
Permission Accounting in Separation Logic (Extended.. - Bornat, Calcagno.. (Correct)
No context found.
R. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7:23--50, 1972.
The Semantics of C++ Data Types: Towards Verifying Low-Level.. - Hohmuth, Tews (2003) (Correct)
No context found.
R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Mitchie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland., 1972.
Proving Pointer Programs in Higher-Order Logic - Mehta, Nipkow (2003) (16 citations) (Correct)
No context found.
Rod Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, 1972.
The Semantics of C++ Data Types: Towards Verifying Low-Level.. - Hohmuth, Tews (2003) (Correct)
No context found.
R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Mitchie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland., 1972.
BI as an Assertion Language for Mutable Data Structures - Samin Ishtiaq Peter (2000) (82 citations) (Correct)
No context found.
Burstall, R. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence 7 (1972), 23-50.
Semantic and Logical Properties of Stateful Programming - Calcagno (2002) (2 citations) (Correct)
No context found.
R.M. Burstall. Some techniques for proving correctness of programs which alter data structures. Machine Intelligence, 7:23--50, 1972.
Memory Taggings and Dynamic Data Structures - Moore (Correct)
No context found.
R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. In Machine Intelligence 7, pages 23-50. Edinburgh University Press, 1972.
Case Studies For The Derivation Of Pointer Algorithms - Ehm (2003) (Correct)
No context found.
R. M. Burstall. Some techniques for proving correctness of programs which alter data structures. In B. Meltzer and D. Mitchie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland, 1972.
Intuitionistic Reasoning about Shared Mutable Data Structure - Reynolds (2000) (82 citations) (Correct)
No context found.
Rodney M. Burstall. Some techniques for proving correctness of programs which alter data structures. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence 7, pages 23--50. Edinburgh University Press, Edinburgh, Scotland, 1972.
First 50 documents
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