Solving Non-Linear Arithmetic Dejan Jovanovi´c1 and Leonardo de Moura2 1 2 New York University

Source URL: csl.sri.com

• Algebra
• Mathematics
• Polynomials
• Abstract algebra
• Computer algebra
• Polynomial
• Factorization of polynomials
• Constraint programming
• Resultant
• Constraint logic programming
• Polynomial ring

Property-Directed k-Induction Dejan Jovanovi´c Bruno Dutertre SRI International

Source URL: csl.sri.com

Finding Inconsistencies in Programs with Loops? Temesghen Kahsai1 , Jorge A. Navas2 , Dejan Jovanovi´c3 , Martin Sch¨af3 1 2

Source URL: csl.sri.com

• Software engineering
• Programming language theory
• Computing
• Logic in computer science
• Horn clause
• Control flow
• ALGOL 68
• Formal methods
• Logic programming

A Tale Of Two Solvers: Eager and Lazy Approaches to Bit-vectors? Liana Hadarean1 , Kshitij Bansal1 , Dejan Jovanovi´c3 , Clark Barrett1 , and Cesare Tinelli2 1 2

Source URL: csl.sri.com

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean algebra
• Satisfiability modulo theories
• Boolean satisfiability problem
• Conflict-driven clause learning
• Solver

SMT Beyond DPLL(T): A New Approach to Theory Solvers and Theory Combination by Dejan Jovanovi´c

Source URL: csl.sri.com

• Theoretical computer science
• Mathematical logic
• Mathematics
• Formal methods
• Logic in computer science
• Computability theory
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Solver
• Entscheidungsproblem
• Decidability

Abduction by Non-Experts Nikolaj Bjørner2 , Dejan Jovanovi´c1 , Tancr`ede Lepoint1 , Philipp R¨ ummer3 , and 1 Martin Sch¨af 1

Source URL: csl.sri.com

• Theoretical computer science
• Logic in computer science
• Mathematical logic
• Computational complexity theory
• Electronic design automation
• Formal methods
• NP-complete problems
• Constraint programming
• Satisfiability modulo theories
• Horn clause
• Clause
• Logic programming

Designing Theory Solvers with Extensions Andrew Reynolds1 , Cesare Tinelli1 , Dejan1 Jovanovi´c3 , and Clark Barrett2 1 Department of Computer Science, The University of Iowa Department of Computer Science, Stanford Uni

Source URL: csl.sri.com

• Theoretical computer science
• Mathematics
• Mathematical logic
• Logic in computer science
• Automated theorem proving
• Electronic design automation
• Formal methods
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Substitution
• Model theory

Solving Nonlinear Integer Arithmetic with MCSAT? Dejan Jovanovi´c SRI International Abstract. We present a new method for solving nonlinear integer arithmetic constraints. The method relies on the MCSat approach to sol

Source URL: csl.sri.com

• Theoretical computer science
• Mathematical logic
• Mathematics
• Logic in computer science
• Constraint programming
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability modulo theories
• Boolean algebra
• Local consistency

A Separation Logic with Data: Small Models and Automation? Jens Katelaan1 , Dejan Jovanovi´c2 , and Georg Weissenbacher1 1 TU Wien, Vienna, Austria

Source URL: csl.sri.com

• Mathematical logic
• Logic
• Predicate logic
• Mathematics
• Model theory
• Semantics
• Philosophical logic
• First-order logic
• FO
• Quantifier
• Constructible universe
• Interpretation

PDF Document

Source URL: pl.csl.sri.com