Some Completeness Results in the Mathematical Theory of Computation
Journal of the ACM (JACM)
Assignment Commands with Array References
Journal of the ACM (JACM)
A Practical Decision Procedure for Arithmetic with Function Symbols
Journal of the ACM (JACM)
Reasoning About Recursively Defined Data Structures
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
Fast decision algorithms based on congruence closure
Fast decision algorithms based on congruence closure
A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Automated theorem proving: mapping logic into AI
ISMIS '86 Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
m-EVES: A tool for verifying software
ICSE '88 Proceedings of the 10th international conference on Software engineering
TEAM: a support environment for testing, evaluation, and analysis
SDE 3 Proceedings of the third ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
A decision procedure for conjunctive query disjointness
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Penelope, an Ada verification system
TRI-Ada '89 Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment
Developing formally verified Ada programs
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
Formal Verification of Ada Programs
IEEE Transactions on Software Engineering
CAKE: an implemented hybrid knowledge representation and limited reasoning system
ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
Seven Layers of Knowledge Representation and Reasoning in Support of Software Development
IEEE Transactions on Software Engineering - Special issue on knowledge representation and reasoning in software development
A multi-theory constraint satisfaction system
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Efficient validity checking for processor verification
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
The design and implementation of a certifying compiler
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Coordination of heterogeneous distributed cooperative constraint solving
ACM SIGAPP Applied Computing Review - Special issue on coodination languages and models
Checking properties of safety critical specifications using efficient decision procedures
FMSP '98 Proceedings of the second workshop on Formal methods in software practice
Formal verification in hardware design: a survey
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Reasoning About Recursively Defined Data Structures
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
A framework for combining analysis and verification
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Implementing non-linear constraints with cooperative solvers
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Constraints in computational logics
ESP: path-sensitive program verification in polynomial time
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Methodological View of Constraint Solving
Constraints
Journal of Automated Reasoning
A General Setting for Flexibly Combining and Augmenting Decision Procedures
Journal of Automated Reasoning
Unions of non-disjoint theories and combinations of satisfiability procedures
Theoretical Computer Science
Using BDDs with Combinations of Theories
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
On Solving Presburger and Linear Arithmetic with SAT
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Solving Mixed Quantified Constraints over a Domain Based on Real Numbers and Herbrand Terms
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
A Light-Weight Framework for Hardware Verification
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Theorem Proving for Verification
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Using Decision Procedures with a Higher-Order Logic
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
A Control Language for Designing Constraint Solvers
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Rule Based Programming with Constraints and Strategies
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
A Generalization of Shostak's Method for Combining Decision Procedures
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
A Rewrite Rule Based Framework for Combining Decision Procedures
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
A Tableau Calculus for Combining Non-disjoint Theories
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Automated Theorem Proving in a Combination of Theories with Disjoint Signatures
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Combining Decision Procedures for Positive Theories Sharing Constructors
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Extended Static Checking: A Ten-Year Perspective
Informatics - 10 Years Back. 10 Years Ahead.
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
CVC: A Cooperating Validity Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Safe, Untrusted Agents Using Proof-Carrying Code
Mobile Agents and Security
Basic Operators for Solving Constraints via Collaboration of Solvers
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Theorem proving for verification
Modeling and verification of parallel processes
Automatically proving the correctness of compiler optimizations
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
SDVS: A system for verifying microcode correctness
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
The design and implementation of a certifying compiler
ACM SIGPLAN Notices - Best of PLDI 1979-1999
ACM SIGSOFT Software Engineering Notes
SDVS: a system for verifying microcode correctness
ACM SIGSOFT Software Engineering Notes - Proceedings of VERkshop III -- a formal verification workshop
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Model-Theoretic Methods in Combined Constraint Satisfiability
Journal of Automated Reasoning
Journal of Automated Reasoning
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Canonization for disjoint unions of theories
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Verifying properties of well-founded linked lists
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpolating theorem prover
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Combining abstract interpreters
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Strategies for combining decision procedures
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
EXE: automatically generating inputs of death
Proceedings of the 13th ACM conference on Computer and communications security
Soundness and completeness warnings in ESC/Java2
Proceedings of the 2006 conference on Specification and verification of component-based systems
Information and Computation - Special issue: Combining logical systems
Modular proof systems for partial functions with Evans equality
Information and Computation - Special issue: Combining logical systems
Efficient theory combination via boolean search
Information and Computation - Special issue: Combining logical systems
Decision procedures for term algebras with integer constraints
Information and Computation - Special issue: Combining logical systems
A SAT-based procedure for verifying finite state machines in ACL2
ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
Applications of Hierarchical Reasoning in the Verification of Complex Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Programmed Strategies for Program Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributing the Workload in a Lazy Theorem-Prover
Electronic Notes in Theoretical Computer Science (ENTCS)
Enforcing resource bounds via static verification of dynamic checks
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special Issue ESOP'05
Memory modeling in ESL-RTL equivalence checking
Proceedings of the 44th annual Design Automation Conference
Decision procedures for extensions of the theory of arrays
Annals of Mathematics and Artificial Intelligence
Strength Induction in a Haskell Program Verifier
Electronic Notes in Theoretical Computer Science (ENTCS)
Back to the future: revisiting precise program verification using SMT solvers
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
Lightweight integration of the Ergo theorem prover inside a proof assistant
Proceedings of the second workshop on Automated formal methods
Using SMT solvers to verify high-integrity programs
Proceedings of the second workshop on Automated formal methods
Model-based Theory Combination
Electronic Notes in Theoretical Computer Science (ENTCS)
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Cooperation of constraint domains in the TOY system
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Logical Interpretation: Static Program Analysis Using Theorem Proving
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
${\mathcal{T}}$-Decision by Decomposition
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Automatic Decidability and Combinability Revisited
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
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
Noetherianity and Combination Problems
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Combining Proof-Producing Decision Procedures
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
An SMT Approach to Bounded Reachability Analysis of Model Programs
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Theorem Proving for Verification (Invited Tutorial)
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Efficient Hierarchical Reasoning about Functions over Numerical Domains
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Constrained types for object-oriented languages
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
EXE: Automatically Generating Inputs of Death
ACM Transactions on Information and System Security (TISSEC)
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
Expressive and modular predicate dispatch for Java
ACM Transactions on Programming Languages and Systems (TOPLAS)
Equality saturation: a new approach to optimization
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unifying type checking and property checking for low-level code
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Software Engineering for Ensembles
Software-Intensive Systems and New Computing Paradigms
On Bounded Reachability of Programs with Set Comprehensions
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Deciding Extensions of the Theories of Vectors and Bags
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
A semantic approach to interpolation
Theoretical Computer Science
Verification of arithmetic datapaths using polynomial function models and congruence solving
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Deciding array formulas with frugal axiom instantiation
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Symbolic program analysis using term rewriting and generalization
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Common knowledge does not have the Beth property
Information Processing Letters
Ground Interpolation for the Theory of Equality
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
A decision procedure for subset constraints over regular languages
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Combining Decision Procedures by (Model-)Equality Propagation
Electronic Notes in Theoretical Computer Science (ENTCS)
Linear Functional Fixed-points
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Efficient Term-ITE Conversion for Satisfiability Modulo Theories
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Automated deduction for verification
ACM Computing Surveys (CSUR)
Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations
Formal Methods in System Design
On Deciding Satisfiability by DPLL($\Gamma+{\mathcal T}$) and Unsound Theorem Proving
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Combinable Extensions of Abelian Groups
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Automated deduction by theory resolution
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
The LPSAT engine & its application to resource planning
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A Precise Yet Efficient Memory Model For C
Electronic Notes in Theoretical Computer Science (ENTCS)
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
Automated reasoning: past story and new trends
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
User control and direction of a more efficient simplifier in ACL2
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Theorem proving with structured theories
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Annals of Mathematics and Artificial Intelligence
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Theory decision by decomposition
Journal of Symbolic Computation
Combination of convex theories: Modularity, deduction completeness, and explanation
Journal of Symbolic Computation
Recursive Abstractions for Parameterized Systems
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
FM '09 Proceedings of the 2nd World Congress on Formal Methods
A Practical Approach to Partial Functions in CVC Lite
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining Non-stably Infinite, Non-first Order Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Decision Procedures for Set-Valued Fields
Electronic Notes in Theoretical Computer Science (ENTCS)
Decision procedures for algebraic data types with abstractions
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Electronic Notes in Theoretical Computer Science (ENTCS)
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Canonization for disjoint unions of theories
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
A reachability predicate for analyzing low-level software
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Combined satisfiability modulo parametric theories
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Decidability of invariant validation for paramaterized systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
An online proof-producing decision procedure for mixed-integer linear arithmetic
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Strategies for combining decision procedures
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A short survey of automated reasoning
AB'07 Proceedings of the 2nd international conference on Algebraic biology
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
A decision procedure for bit-vectors and arrays
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Verifying CSP-OZ-DC specifications with complex data types and timing parameters
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Building extended canonizers by graph-based deduction
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Verifying heap-manipulating programs in an SMT framework
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Deciding equality in the constructor theory
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Efficient interpolant generation in satisfiability modulo theories
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
Cover algorithms and their combination
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
A survey of automated deduction
Artificial intelligence today
Mixing type checking and symbolic execution
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Combining equational reasoning
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Combinations of theories for decidable fragments of first-order logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Data structures with arithmetic constraints: a non-disjoint combination
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Combining theories with shared set operations
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Efficient generation of craig interpolants in satisfiability modulo theories
ACM Transactions on Computational Logic (TOCL)
Theory-specific automated reasoning
A 25-year perspective on logic programming
Statically inferring complex heap, array, and numeric invariants
SAS'10 Proceedings of the 17th international conference on Static analysis
An overview of the Jahob analysis system: project goals and current status
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Decidable logics combining heap structures and data
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Decision procedures for automating termination proofs
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Automatic decidability and combinability
Information and Computation
A theory of skiplists with applications to the verification of concurrent datatypes
NFM'11 Proceedings of the Third international conference on NASA Formal methods
The reduced product of abstract domains and the combination of decision procedures
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Canonized rewriting and ground AC completion modulo shostak theories
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Satisfiability modulo theories: introduction and applications
Communications of the ACM
Counterexample generation for Markov chains using SMT-based bounded model checking
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
On interpolation in decision procedures
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
Journal of Automated Reasoning
Efficient decision procedures for heaps using STRAND
SAS'11 Proceedings of the 18th international conference on Static analysis
Combining theories: the Ackerman and guarded fragments
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Sharing is caring: combination of theories
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Modular termination and combinability for superposition modulo counter arithmetic
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Accurate theorem proving for program verification
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
Monotonicity Inference for Higher-Order Formulas
Journal of Automated Reasoning
A Decidability Result for the Model Checking of Infinite-State Systems
Journal of Automated Reasoning
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Splitting on demand in SAT modulo theories
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automatic combinability of rewriting-based satisfiability procedures
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Validity checking for finite automata over linear arithmetic constraints
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A semantic approach to interpolation
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Zap: automated theorem proving for software analysis
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decision procedures for SAT, SAT modulo theories and beyond. the barcelogictools
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Nelson-Oppen, shostak and the extended canonizer: a family picture with a newborn
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Nested refinements: a logic for duck typing
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
Decision procedures for the formal analysis of software
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Building a calculus of data structures
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Automatic verification for a class of proof obligations with SMT-solvers
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
A scalable method for solving satisfiability of integer linear arithmetic logic
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Abstract interpretation with alien expressions and heap structures
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Flexible interpolation with local proof transformations
Proceedings of the International Conference on Computer-Aided Design
Inference systems for logical algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Decision procedures for queues with integer constraints
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Solving sparse linear constraints
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Decidability and undecidability results for nelson-oppen and rewrite-based decision procedures
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Interpolation for predefined types
Mathematical Structures in Computer Science
A two-tier technique for supporting quantifiers in a lazily proof-explicating theorem prover
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Enforcing resource bounds via static verification of dynamic checks
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Combining decision procedures by (model-)equality propagation
Science of Computer Programming
Invited contribution: a comprehensive framework for combined decision procedures
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Connecting many-sorted structures and theories through adjoint functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
An efficient decision procedure for UTVPI constraints
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Predicate abstraction via symbolic decision procedures
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Efficient satisfiability modulo theories via delayed theory combination
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Decision procedures customized for formal verification
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
An algorithm for deciding BAPA: boolean algebra with presburger arithmetic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Connecting many-sorted theories
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
A combination method for generating interpolants
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Join algorithms for the theory of uninterpreted functions
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On superposition-based satisfiability procedures and their combination
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Extension of first-order theories into trees
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
From propositional satisfiability to satisfiability modulo theories
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Lemma learning in SMT on linear constraints
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A progressive simplifier for satisfiability modulo theories
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
On hierarchical reasoning in combinations of theories
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Active learning of combinatorial features for interactive optimization
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Modular SMT proofs for fast reflexive checking inside coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
A practical and complete approach to predicate refinement
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Assertion checking over combined abstraction of linear arithmetic and uninterpreted functions
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Bounded model checking of software using SMT solvers instead of SAT solvers
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Decision procedures for region logic
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Science of Computer Programming
FDCC: a combined approach for solving constraints over finite domains and arrays
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Challenging SMT solvers to verify neural networks
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
From strong amalgamability to modularity of quantifier-free interpolation
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Combination of disjoint theories: beyond decidability
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Optimization in SMT with LA(Q) cost functions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Automated and efficient analysis of role-based access control with attributes
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
An Open Automated Framework for Constraint Solver Extension: the SoleX Approach
Fundamenta Informaticae
Rule-Based Constraint Programming
Fundamenta Informaticae
Green: reducing, reusing and recycling constraints in program analysis
Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering
Theories, solvers and static analysis by abstract interpretation
Journal of the ACM (JACM)
Producing and verifying extremely large propositional refutations
Annals of Mathematics and Artificial Intelligence
Integration of SMT-solvers in B and Event-B development environments
Science of Computer Programming
Being careful about theory combination
Formal Methods in System Design
Interpolation in logics with constructors
Theoretical Computer Science
Proof tree preserving interpolation
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Instantiation Schemes for Nested Theories
ACM Transactions on Computational Logic (TOCL)
Quantifier-free interpolation in combinations of equality interpolating theories
ACM Transactions on Computational Logic (TOCL)
Generating non-linear interpolants by semidefinite programming
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Automating separation logic using SMT
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Validating library usage interactively
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.02 |
A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean connectives, the equality predicate =, the conditional function if-then-else, the integers, the arithmetic functions and predicates +, -, and ≤, the Lisp functions and predicates car, cdr, cons, and atom, the functions store and select for storing into and selecting from arrays, and uninterpreted function symbols. If the expression is a theorem it is simplified to the constant true, so the simplifier can be used as a decision procedure for the quantifier-free theory containing these functions and predicates. The simplifier is currently used in the Stanford Pascal Verifier.