Reasoning about sequences of memory states-Reference-Cited by-同舟云学术

Reasoning about sequences of memory states

Published:2009-12 Issue:3 Volume:161 Page:305-323
ISSN:0168-0072
Container-title:Annals of Pure and Applied Logic
language:en
Short-container-title:Annals of Pure and Applied Logic

Author:

Brochenin Rémi,Demri Stéphane,Lozes Etienne

Publisher

Elsevier BV

Subject

Logic

Reference36 articles.

1. A really temporal logic;Alur;Journal of the Association for Computing Machinery,1994

2. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning;Balbiani,2002

3. Beyond shapes: Lists with ordered data;Bansal,2009

4. S. Bardin, A. Finkel, E. Lozes, A. Sangnier, From pointer systems to counter systems using shape analysis, in: 5th International Workshop on Automated Verification of Infinite-State Systems (AVIS’06)

5. S. Bardin, A. Finkel, D. Nowak, Toward symbolic verification of programs handling pointers, in: 3rd International Workshop on Automated Verification of Infinite-State Systems (AVIS’04), 2004

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Complete Axiomatisation for Quantifier-Free Separation Logic;Logical Methods in Computer Science;2021-08-10

2. Concrete domains in logics;ACM SIGLOG News;2021-07

3. The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic;ACM Transactions on Computational Logic;2021-06-21

4. Internal proof calculi for modal logics with separating conjunction;Journal of Logic and Computation;2021-04

5. The power of modal separation logics;Journal of Logic and Computation;2019-12