Locality Results for Certain Extensions of Theories with Bridging Functions

We study possibilities of reasoning about extensions of base theories with functions which satisfy certain recursion (or homomorphism) properties. Our focus is on emphasizing possibilities of hierarchical and modular reasoning in such extensions and combinations thereof. We present practical applications in verification and cryptography.

[1]  Graham Steel,et al.  Deduction with XOR Constraints in Security API Modelling , 2005, CADE.

[2]  Robert Givan,et al.  Polynomial-time computation via local inference relations , 2000, TOCL.

[3]  Stéphanie Delaune,et al.  Easy intruder deduction problems with homomorphisms , 2006, Inf. Process. Lett..

[4]  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.

[5]  Frank Bomarius,et al.  KI 2008: Advances in Artificial Intelligence, 31st Annual German Conference on AI, KI 2008, Kaiserslautern, Germany, September 23-26, 2008. Proceedings , 2008, KI.

[6]  Hubert Comon-Lundh,et al.  Challenges in the Automated Verification of Security Protocols , 2008, IJCAR.

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

[8]  Peter F. Patel-Schneider,et al.  DLP System Description , 1998, Description Logics.

[9]  Harald Ganzinger,et al.  Modular proof systems for partial functions with Evans equality , 2006, Inf. Comput..

[10]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

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

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

[13]  David Walker,et al.  Types and full abstraction for polyadic pi-calculus , 2005, Inf. Comput..

[14]  Cesare Tinelli,et al.  An Abstract Decision Procedure for a Theory of Inductive Data Types , 2007, J. Satisf. Boolean Model. Comput..

[15]  Nachum Dershowitz,et al.  Verification: Theory and Practice , 2004, Lecture Notes in Computer Science.

[16]  Bernhard Nebel,et al.  Principles of knowledge representation and reasoning: proceedings of the Third International Conference (KR'92) , 1992 .

[17]  Maria Paola Bonacina,et al.  Rewrite-Based Decision Procedures , 2007, STRATEGIES@IJCAR.

[18]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[19]  Michaël Rusinowitch,et al.  A rewriting approach to satisfiability procedures , 2003, Inf. Comput..

[20]  Robert Givan,et al.  New Results on Local Inference Relations , 1992, KR.

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

[22]  Ralf Treinen,et al.  Easy Intruder Deductions , 2003, Verification: Theory and Practice.

[23]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[24]  Henny B. Sipma,et al.  Decision procedures for term algebras with integer constraints , 2006, Inf. Comput..

[25]  Carsten Ihlemann,et al.  System Description: H-PILoT , 2009, CADE.

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

[27]  Hans Kleine Büning,et al.  The Complexity of Some Subclasses of Minimal Unsatis able Formulas , 2007, J. Satisf. Boolean Model. Comput..

[28]  Derek C. Oppen,et al.  Reasoning about recursively defined data structures , 1978, POPL.