On local reasoning in verification

Authors:
Carsten Ihlemann;Swen Jacobs;Viorica Sofronie-Stokkermans
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2008

Citing 12
Cited 19

Automatic recognition of tractability in inference relations

Journal of the ACM (JACM)
Polynomial-time computation via local inference relations

ACM Transactions on Computational Logic (TOCL)
Relating Semantic and Proof-Theoretic Concepts for Polynomial Time Decidability of Uniform Word Problems

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Modular proof systems for partial functions with Evans equality

Information and Computation - Special issue: Combining logical systems
Automated Reasoning in Some Local Extensions of Ordered Structures

ISMVL '07 Proceedings of the 37th International Symposium on Multiple-Valued Logic
Applications of Hierarchical Reasoning in the Verification of Complex Systems

Electronic Notes in Theoretical Computer Science (ENTCS)
Verifying CSP-OZ-DC specifications with complex data types and timing parameters

IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Deciding extensions of the theory of arrays by integrating decision procedures and instantiation strategies

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Interpolation in local theory extensions

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
What's decidable about arrays?

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Data structure specifications via local equality axioms

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Hierarchic reasoning in local theory extensions

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Towards SMT Model Checking of Array-Based Systems

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Efficient Hierarchical Reasoning about Functions over Numerical Domains

KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Deciding Extensions of the Theories of Vectors and Bags

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Incremental Instance Generation in Local Reasoning

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Locality Results for Certain Extensions of Theories with Bridging Functions

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
System Description: H-PILoT

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Decision procedures for algebraic data types with abstractions

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic verification of parametric specifications with complex topologies

IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Towards complete reasoning about axiomatic specifications

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Decision procedures for automating termination proofs

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
An efficient decision procedure for imperative tree data structures

CADE'11 Proceedings of the 23rd international conference on Automated deduction
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning
On hierarchical reasoning in combinations of theories

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Hierarchical reasoning for the verification of parametric systems

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Automatic verification of real-time systems with rich data: an overview

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Complete instantiation-based interpolation

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Instantiation Schemes for Nested Theories

ACM Transactions on Computational Logic (TOCL)
Hierarchical reasoning and model generation for the verification of parametric hybrid systems

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a general framework which allows to identify complex theories important in verification for which efficient reasoning methods exist. The framework we present is based on a general notion of locality. We show that locality considerations allow us to obtain parameterized decidability and complexity results for many (combinations of) theories important in verification in general and in the verification of parametric systems in particular. We give numerous examples; in particular we show that several theories of data structures studied in the verification literature are local extensions of a base theory. The general framework we use allows us to identify situations in which some of the syntactical restrictions imposed in previous papers can be relaxed.