C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In FSTTCS, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Separation Logic: A Logic for Shared Mutable Data Structures - Reynolds (2002) (104 citations) (Correct)
....(and, for total correctness, variants) can be reduced to a collection of assertions, called verification conditions, whose validity will insure the original specification. Thus the central question for computability and complexity is to decide the validity of assertions in separation logic. Yang [8, 34] has examined the decidability of classical separation logic without arithmetic (where expressions are variables, values are addresses or nil, and the heap maps addresses into two field records) He showed that, even when the characteristic operations of separation logic (emp, 7 , and , but ....
....consequence, we cannot hope to find an axiomatic description of 7 . On the other hand, Yang and Calcagno showed that if the characteristic operations are permitted but quantifiers are prohibited, then the validity of assertions is algorithmically decidable. For the latter case, Calcagno and Yang [8] have investigated complexity. Specifically, for the languages tabulated below they considered MC The model checking problem: Does [ p] sh hold for a specified state (s; h) VAL The validity problem: Does [ p] asrt sh hold for all states (s; h) In each case, they determined that the ....
C. Calcagno, H. Yang, and P. W. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In R. Hariharan, M. Mukund, and V. Vinay, editors, FST TCS 2001.
A Decidable Fragment of Separation Logic - Berdine, Calcagno, O'Hearn (2004) (3 citations) Self-citation (Calcagno O'hearn) (Correct)
No context found.
Calcagno, C., Yang, H., O'Hearn, P.: Computability and complexity results for a spatial assertion language for data structures. In: FSTTCS. Volume 2245 of LNCS., Springer (2001) 108--119
Expressions, Commands, and Assertions - Reynolds (2002) Self-citation (O'hearn) (Correct)
No context found.
Cristiano Calcagno, Hongseok Yang, and Peter W. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Ramesh Hariharan, Madhavan Mukund, and V. Vinay, editors, FST TCS 2001.
A Decidable Fragment of Separation Logic - Berdine, Calcagno, O'Hearn (2004) (3 citations) Self-citation (Calcagno O'hearn) (Correct)
No context found.
Calcagno, C., Yang, H., O'Hearn, P.: Computability and complexity results for a spatial assertion language for data structures. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01). Volume 2245 of Lecture Notes in Computer Science., Springer (2001) 108--119
Semantic and Logical Properties of Stateful Programming - Calcagno (2002) (2 citations) Self-citation (Calcagno O'hearn) (Correct)
No context found.
Cristiano Calcagno, Hongseok Yang, and Peter O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Proceedings of FSTTCS'01, LNCS. Springer, 2001.
Deciding Validity in a Spatial Logic for Trees - Calcagno, Cardelli, Gordon (2002) (33 citations) Self-citation (Calcagno) (Correct)
....Scedrov, and Shankar [LMSS92] prove undecidability for both propositional linear logic and propositional intuitionistic linear logic. See Cardelli and Gordon [CG00] for a detailed discussion of the di#erences between the ambient logic and relevant and linear logics. Calcagno, Yang, and O Hearn [CYO01] show decidability of validity in a propositional substructural logic for reasoning about heaps. The proof in this paper is an adaptation of their proof technique. We briefly consider the prospects of extending our results: Charatonik and Talbot [CT01] show that validity becomes undecidable ....
C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01), volume 2245 of Lecture Notes in Computer Science, pages 108--119. Springer, 2001.
Deciding Validity in a Spatial Logic for Trees - Calcagno, Cardelli, Gordon (2002) (33 citations) Self-citation (Calcagno) (Correct)
....Scedrov, and Shankar [19] prove undecidability for both propositional linear logic and propositional intuitionistic linear logic. See Cardelli and Gordon [10] for a detailed discussion of the di#erences between the ambient logic and relevant and linear logics. Calcagno, Yang, and O Hearn [7] show decidability of validity in a propositional substructural logic for reasoning about heaps. The proof in this paper is an adaptation of their proof technique. We briefly consider the prospects of extending our results: Charatonik and Talbot [13] show that validity becomes undecidable in a ....
C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS'01), volume 2245 of Lecture Notes in Computer Science, pages 108--119. Springer, 2001.
A Semantic Basis for Local Reasoning - Yang, O'Hearn (2002) (6 citations) Self-citation (Yang O'hearn) (Correct)
.... q 0 ) that might be much more dicult to establish than if the invariant were chosen di erently. So it is natural to ask under what circumstances this price might be controlled, in particular by taming the quanti cation in 8X: q r) and perhaps incorporated into the decidable sublogic of [2]. ....
C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. To appear in the Proceedings of FSTTCS, 2001.
On Spatial Conjunction as Second-Order Logic - Kuncak, Rinard (2004) (Correct)
No context found.
C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In FSTTCS, 2001.
A Logic You Can Count On - Zilio, Lugiez, Meyssonnier (2003) (2 citations) (Correct)
No context found.
C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Foundations of Software Technology and Theoretical Computer Science (FST & TCS), volume 2245 of LNCS. Springer, 2001.
A Logic You Can Count On - Zilio, Lugiez, Meyssonnier (2004) (2 citations) (Correct)
No context found.
C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Foundations of Software Technology and Theoretical Computer Science (FST & TCS), volume 2245 of LNCS. Springer, 2001.
A Separation Logic for Resource Distribution (Extended Abstract) - Biri, Galmiche (Correct)
No context found.
C. Calcagno, H. Yang, and P. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In 21st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'01, LNCS 2245, pages 108-119, Bangalore, India, 2001.
Separability, Expressiveness, and Decidability in the.. - Hirschkoff, Lozes.. (Correct)
No context found.
C. Calcagno, H. Yang, and P. O'Hearn. Computability and Complexity Results for a Spatial Assertion Language for Data Structures. In Proceedings of FSTTCS '01, volume 2245 of LNCS. Springer Verlag, 2001.
Elimination of Quantifiers and Undecidability in Spatial.. - Caires, Lozes (2004) (1 citation) (Correct)
No context found.
C. Calcagno, H. Yang, and O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In R. Hariharan, M. Mukund, and V. Vinay, editors, FSTTCS'2001, volume 2245. Springer-Verlag, 2001.
Separation Logic Preserves the Expressive Power of Classical Logic - Lozes (Correct)
No context found.
C. Calcagno, H. Yang, and P. O'Hearn. Computability and Complexity Results for a Spatial Assertion Language for Data Structures. In Proceedings of FSTTCS '01, volume 2245 of LNCS. Springer Verlag, 2001.
Elimination of Spatial Connectives in Static Spatial Logics - Lozes (2004) (Correct)
No context found.
C. Calcagno, H. Yang, and P. O'Hearn. Computability and Complexity Results for a Spatial Assertion Language for Data Structures. In Proceedings of FSTTCS '01, volume 2245 of LNCS. Springer Verlag, 2001.
Expressiveness and Complexity of Graph Logic - Anuj Dawar Philippa (2004) (Correct)
No context found.
C. Calcagno, H. Yang, and P. W. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In FSTTCS: 21st Conference, volume 2245 of Springer LNCS, pages 108--119, 2001.
Elimination of Quantifiers and Undecidability in Spatial.. - Caires, Lozes (2004) (1 citation) (Correct)
No context found.
C. Calcagno, H. Yang, and O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In R. Hariharan, M. Mukund, and V. Vinay, editors, FSTTCS'2001, volume 2245. Springer-Verlag, 2001.
Elimination of Quantifiers and Undecidability in Spatial Logics .. - Caires, al. (2004) (1 citation) (Correct)
No context found.
C. Calcagno, H. Yang, and O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Hariharan, Mukund, and Vinay, editors, Proc. of FST TCS'2001.
Comparing the expressive power of Separation logic and classical.. - Lozes (2004) (Correct)
No context found.
C. Calcagno, H. Yang, and P. O'Hearn. Computability and Complexity Results for a Spatial Assertion Language for Data Structures. In Proceedings of FSTTCS '01, volume 2245 of LNCS. Springer Verlag, 2001.
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