DryadSynth: A Concolic SyGuS Solver Xiaokang Qiu (joint work with Kangjing Huang and Yanjun Wang) Purdue University SYNT Workshop

Source URL: www.react.uni-saarland.de

• Automated theorem proving
• Concolic testing
• Software testing
• Equations
• Z3
• Solver
• Equation solving
• Mathematics
• Abstraction
• Software engineering

Bounded Model Generation for Isabelle/HOL Using a SAT Solver Tjark Weber

Source URL: user.it.uu.se

• Mathematical logic
• Type theory
• Computability theory
• Lambda calculus
• Theoretical computer science
• Model theory
• Higher-order logic
• Constructible universe
• Mathematics

Integrating a SAT Solver with an LCF-style Theorem Prover A Fast Decision Procedure for Propositional Logic for the Isabelle System Tjark Weber

Source URL: user.it.uu.se

• Proof assistants
• Theoretical computer science
• Logic in computer science
• Mathematical logic
• Isabelle
• Logic for Computable Functions
• Mathematics
• Resolution
• Constructible universe
• Theorem prover
• LCF
• Formal methods

The Barcelogic SMT Solver (Tool Paper)? Miquel Bofill† , Robert Nieuwenhuis? , Albert Oliveras? , Enric Rodr´ıguez-Carbonell? and Albert Rubio? †

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Logic in computer science
• Constraint programming
• Electronic design automation
• Formal methods
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Maximum satisfiability problem

Multi-Solver Support in Symbolic Execution Hristina Palikareva, Cristian Cadar SMT Workshop 2014, Vienna, 17 July 2014 Dynamic Symbolic Execution

Source URL: smt2014.it.uu.se

• Software engineering
• Computing
• Computer programming
• Cross-platform software
• High-level programming languages
• Abstract interpretation
• Computer science
• Symbolic execution
• D
• Pure
• Concolic testing

Integrating a SAT Solver with Isabelle/HOL Tjark Weber (joint work with Alwen Tiu et al.) First Munich-Nancy Workshop on

Source URL: user.it.uu.se

Introduction Applications SMT Solver Use Algorithms Conclusion

Source URL: user.it.uu.se

• Theoretical computer science
• Logic in computer science
• Formal methods
• Mathematics
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Formal verification
• Model checking
• SMT

Solver Paramter Tuning and Runtime Predictions of Flexible Hybrid Mathematical models. Michael Barry University of Basel / HES-SO / Universitt Basel Petersplatz 1, 4001 Basel / Tec

Source URL: icaps16.icaps-conference.org

• Mathematics
• Applied mathematics
• Modeling and simulation
• Numerical software
• Solver
• Mathematical model
• Mathematical modeling
• Artificial neural network
• Economic model
• Open energy system models
• PLPAK

MiniMaxSat: a New Weighted Max-SAT Solver Federico Heras, Javier Larrosa, and Albert Oliveras Universitat Politecnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain Abstract. In this paper we introduce M INI M A

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Logic in computer science
• Automated theorem proving
• Boolean algebra
• NP-complete problems
• Combinatorial optimization
• Maximum satisfiability problem
• Boolean satisfiability problem
• Resolution
• Unit propagation

SyGuS Techniques in the Core of an SMT Solver Andrew Reynolds SYNT Workshop July 22, 2017

Source URL: www.react.uni-saarland.de

• Theoretical computer science
• Logic in computer science
• Constraint programming
• Electronic design automation
• Satisfiability modulo theories