System Description: H-PILoT

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.

[1]  Henny B. Sipma,et al.  What's Decidable About Arrays? , 2006, VMCAI.

[2]  Viorica Sofronie-Stokkermans,et al.  Interpolation in Local Theory Extensions , 2006, Log. Methods Comput. Sci..

[3]  Viorica Sofronie-Stokkermans,et al.  Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators , 2003, J. Symb. Comput..

[4]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[5]  Viorica Sofronie-Stokkermans,et al.  Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions , 2007, FroCoS.

[6]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[7]  Harald Ganzinger.  Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[8]  Carsten Ihlemann,et al.  On Local Reasoning in Verification , 2008, TACAS.

[9]  Viorica Sofronie-Stokkermans,et al.  Hierarchic Reasoning in Local Theory Extensions , 2005, CADE.

[10]  Bruno Dutertre,et al.  Integrating Simplex with DPLL(T ) , 2006 .

[11]  George C. Necula,et al.  Data Structure Specifications via Local Equality Axioms , 2005, CAV.

[12]  Carsten Ihlemann,et al.  Automated Reasoning in Some Local Extensions of Ordered Structures , 2007, 37th International Symposium on Multiple-Valued Logic (ISMVL'07).

[13]  Viorica Sofronie-Stokkermans.  Efficient Hierarchical Reasoning about Functions over Numerical Domains , 2008, KI.

[14]  Thomas Sturm,et al.  REDLOG: computer algebra meets computer logic , 1997, SIGS.