Automated Reasoning in Some Local Extensions of Ordered Structures

Authors:
Viorica Sofronie-Stokkermans;Carsten Ihlemann
Affiliations:
Max-Planck-Institut fur Informatik, Germany;Max-Planck-Institut fur Informatik, Germany
Venue:
ISMVL '07 Proceedings of the 37th International Symposium on Multiple-Valued Logic
Year:
2007

Citing 0
Cited 5

Automatic Verification of Combined Specifications: An Overview

Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
On local reasoning in verification

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
Decision procedures for automating termination proofs

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a uniform method for automated reasoning in several types of extensions of ordered algebraic structures (definitional extensions, extensions with boundedness axioms or with monotonicity axioms). We show that such extensions are local and, hence, efficient methods for hierarchical reasoning exist in all these cases.