An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Attributive concept descriptions with complements
Artificial Intelligence
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The pointer assertion logic engine
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parametric shape analysis via 3-valued logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
Results on the Propositional µ-Calculus
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
TVLA: A System for Implementing Static Analyses
SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Boolean and Cartesian Abstraction for Model Checking C Programs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
On the undecidability of logics with converse, nominals, recursion and counting
Artificial Intelligence
Complexity of the Two-Variable Fragment with Counting Quantifiers
Journal of Logic, Language and Information
SAS'05 Proceedings of the 12th international conference on Static Analysis
Modeling and Verifying Graph Transformations in Proof Assistants
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such programs involves reasoning about unbounded sets of graphs. Three-valued shape analysis (Sagiv et. al.) is an approach based on explicit manipulation of 3-valued shape graphs, which abstract sets of pointer graphs. Other approaches use symbolic representations, e. g., by describing (sets of) graphs as logical formulas. Unfortunately, many resulting logics are either undecidable or cannot express crucial properties like reachability and separation. In this paper, we investigate an alternative approach. We study well-known description logics as a framework for symbolic shape analysis. We propose a predicate abstraction based shape analysis, parameterized by description logics to represent the abstraction predicates. Depending on the particular logic chosen sharing, reachability and separation in pointer data structures are expressible.