Combining Lists with Non-stably Infinite Theories

In program verification one has often to reason about lists over elements of a given nature. Thus, it becomes important to be able to combine the theory of lists with a generic theory T modeling the elements. This combination can be achieved using the Nelson-Oppen method only ifT is stably infinite.

[1]  T. Melham.  Automating recursive type definitions in higher order logic , 1989 .

[2]  Natarajan Shankar,et al.  ICS: Integrated Canonizer and Solver , 2001, CAV.

[3]  Pascal Fontaine,et al.  Combining Non-stably Infinite, Non-first Order Theories , 2005, D/PDPAR@IJCAR.

[4]  Alan Bundy,et al.  Automated Deduction — CADE-12 , 1994, Lecture Notes in Computer Science.

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

[6]  David L. Dill,et al.  An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic , 2003, TACAS.

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

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

[9]  Robert E. Shostak,et al.  Deciding Combinations of Theories , 1982, JACM.

[10]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[11]  Silvio Ranise,et al.  Light-weight theorem proving for debugging and verifying units of code , 2003, First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings..

[12]  Calogero G. Zarba,et al.  Combining Sets with Integers , 2002, FroCoS.

[13]  Henny B. Sipma,et al.  Decision Procedures for Recursive Data Structures with Integer Constraints , 2004, IJCAR.

[14]  Andrei Voronkov,et al.  Automated Deduction—CADE-18 , 2002, Lecture Notes in Computer Science.

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

[16]  Calogero G. Zarba,et al.  Combining Non-Stably Infinite Theories , 2003, FTP.

[17]  Lawrence C. Paulson,et al.  A Fixedpoint Approach to Implementing (Co)Inductive Definitions , 1994, CADE.

[18]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[19]  David L. Dill,et al.  CVC: A Cooperating Validity Checker , 2002, CAV.

[20]  Harald Ganzinger,et al.  Shostak Light , 2002, CADE.

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

[22]  Z. Manna,et al.  Integrating decision procedures for temporal verification , 1998 .

[23]  Zbigniew W. Ras,et al.  Methodologies for Intelligent Systems , 1991, Lecture Notes in Computer Science.

[24]  Pierre Wolper,et al.  On the Construction of Automata from Linear Arithmetic Constraints , 2000, TACAS.

[25]  William Pugh,et al.  The Omega test: A fast and practical integer programming algorithm for dependence analysis , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[26]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[27]  Calogero G. Zarba.  Combining Multisets with Integers , 2002, CADE.

[28]  Calogero G. Zarba.  Combining Sets with Elements , 2003, Verification: Theory and Practice.

[29]  Natarajan Shankar,et al.  Justifying Equality , 2005, Electron. Notes Theor. Comput. Sci..

[30]  Owre Sam,et al.  Abstract Datatypes in PVS , 1997 .