-
Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2011, Chicago, IL, USA, April 12-14, 2011; 01/2011
-
Mathematics in Computer Science. 01/2011; 5:469-497.
-
[show abstract]
[hide abstract]
ABSTRACT: The focus of this paper is on reducing the complexity in verification by exploiting modularity at various levels: in specification, in verification, and structurally. For specifications, we use the modular language CSP-OZ-DC, which allows us to decouple verification tasks concerning data from those concerning durations. At the verification level, we exploit modularity in theorem proving for rich data structures and use this for invariant checking. At the structural level, we analyze possibilities for modular verification of systems consisting of various components which interact.We illustrate these ideas by automatically verifying safety properties of a case study from the European Train Control System standard, which extends previous examples by comprising a complex track topology with lists of track segments and trains with different routes. Comment: The original publication is available at http://www.springerlink.com
10/2010;
-
[show abstract]
[hide abstract]
ABSTRACT: This system description provides an overview of H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions), a program for hierarchical reasoning in extensions of logical theories. H-PILoT reduces deduction problems in the theory extension to deduction problems in the base theory. Specialized provers and standard SMT solvers can be used for testing the satisfiability of the formulae obtained after the reduction. For a certain type of theory extension (namely for local theory extensions) this hierarchical reduction is sound and complete and -- if the formulae obtained this way belong to a fragment decidable in the base theory -- H-PILoT provides a decision procedure for testing satisfiability of ground formulae, and can also be used for model generation. Comment: 43 pages; A version of this system description appeared as AVACS technical report Nr. 61 (SFB/TR 14) http://www.avacs.org
09/2010;
-
Automated Reasoning, 5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010. Proceedings; 01/2010
-
[show abstract]
[hide abstract]
ABSTRACT: This system description provides an overview of H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions),
a program for hierarchical reasoning in extensions of logical theories with functions axiomatized by a set of clauses. H-PILoT
reduces deduction problems in the theory extension to deduction problems in the base theory. Specialized provers and standard
SMT solvers can be used for testing the satisfiability of the formulae obtained after the reduction. For local theory extensions
this hierarchical reduction is sound and complete and – if the formulae obtained this way belong to a fragment decidable in
the base theory – H-PILoT provides a decision procedure for testing satisfiability of ground formulae, and can also be used
for model generation.
07/2009: pages 131-139;
-
Automated Deduction - CADE-22, 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings; 01/2009
-
[show abstract]
[hide abstract]
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.
04/2008: pages 265-281;
-
Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings; 01/2008
-
[show abstract]
[hide abstract]
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.
Multiple-Valued Logic, 2007. ISMVL 2007. 37th International Symposium on; 06/2007
-
[show abstract]
[hide abstract]
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.
Ramakrishnan, C. R.; Rehof, Jakob: Tools and Algorithms for the Construction and Analysis of Systems : 14th International Conference, TACAS 2008 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Springer, 265-281 (2008).
-
[show abstract]
[hide abstract]
ABSTRACT: H-PILoT (Hierarchical Proving by Instantiation in Local Theory extensions) is a program for hierarchical reasoning in extensions of logical theories with additional functions axiomatized by a set of (universally quantified) clauses: deduction problems in the theory extension are reduced to deduction problems in the base theory. Specialized provers, as well as standard SMT solvers, are then used for testing the satisfiability of the formulae obtained after the reduction. The hierarchical reduction used in H-PILoT is always sound; it is complete for the class of so-called local extensions of a base theory. If the clauses obtained by this reduction belong to a fragment decidable in the base theory, H-PILoT provides a decision procedure for testing satisfiability of ground formulae w.r.t.\ a theory extension, and can also be used for model generation. This is the major advantage of H-PILoT compared with other state-of-the art SMT solvers. H-PILoT can alternatively be used as a tool for ``steering'' the instantiation mechanism of standard SMT provers, in order to provide decision procedures in the case of local theory extensions. This system description provides an overview of H-PILoT and illustrates on some examples the main advantage of using H-PILoT for satisfiability checking in local extensions, in comparison with the performance of general state of the art SMT-provers.
Schmidt, Renate: 22nd International Conference on Automated Deduction (CADE-22), Springer, 131-139 (2009).
-
[show abstract]
[hide abstract]
ABSTRACT: Many problems occurring in verification can be reduced to proving the satisfiability of conjunctions of literals in a background theory. This can be a concrete theory (e.g. the theory of real or rational numbers), the extension of a theory with additional functions (free, monotone, or recursively defined) or a combination of theories. It is therefore very important to have efficient procedures for checking the satisfiability of conjunctions of ground literals in such theories. We present some new results on hierarchical and modular reasoning in complex theories, as well as several examples of application domains in which efficient reasoning is possible. We show, in particular, that various phenomena analyzed in the verification literature can be explained in a unified way using the notion of local theory extension. @InProceedings{sofroniestokkermans_et_al:DSP:2007:1250, author = {Viorica Sofronie-Stokkermans and Carsten Ihlemann and Swen Jacobs}, title = {Local Theory Extensions, Hierarchical Reasoning and Applications to Verification}, booktitle = {Deduction and Decision Procedures}, year = {2007}, editor = {Franz Baader and Byron Cook and J{"u}rgen Giesl and Robert Nieuwenhuis}, number = {07401}, series = {Dagstuhl Seminar Proceedings}, ISSN = {1862-4405}, publisher = {Internationales Begegnungs- und Forschungszentrum f{"u}r Informatik (IBFI), Schloss Dagstuhl, Germany}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2007/1250}, annote = {Keywords: Automated reasoning, Combinations of decision procedures, Verification} }
