The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Reasoning about infinite computations
Information and Computation
Automatic verification of pointer programs using monadic second-order logic
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
BI as an assertion language for mutable data structures
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
TVLA: A System for Implementing Static Analyses
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
An automata-theoretic approach to constraint LTL
Information and Computation
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Verifying temporal heap properties specified via evolution logic
ESOP'03 Proceedings of the 12th European conference on Programming
Symbolic execution with separation logic
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Characterizing provability in BI's pointer logic through resource graphs
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Programs with lists are counter automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
From separation logic to first-order logic
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
An Automata-based Approach for CTL*; With Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of complex dynamic data tree with mu-calculus
Automated Software Engineering
| Hi-index | 0.00 |
In order to verify programs with pointer variables, we introduce a temporal logic LTLmemwhose underlying assertion language is the quantifier-free fragment of separation logic and the temporal logic on the top of it is the standard linear-time temporal logic LTL. We analyze the complexity of various model-checking and satisfiability problems for LTLmem, considering various fragments of separation logic (including pointer arithmetic), various classes of models (with or without constant heap), and the influence of fixing the initial memory state. We provide a complete picture based on these criteria. Our main decidability result is -completeness of the satisfiability problems on the record fragment and on a classical fragment allowing pointer arithmetic. ${\Sigma^{0}_{1}}$-completeness or $\Sigma^{1}_{1}$-completeness results are established for various problems by reducing standard problems for Minsky machines, and underline the tightness of our decidability results.