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

The 4th Reactive Synthesis Competition SYNTCOMP 2017 Swen Jacobs Saarland University Roderick Bloem TU Graz

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

• Numerical software
• Model checking
• Neuropsychology
• Solver
• Problem solving

SYNT Workshop - SyGuS Comp’17 SaturdayE3Solver: Decision Tree Unification by Enumeration

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

• Multiplexing
• T-carrier
• Schedule

Decoupled State Space Search – Dissertation Abstract Daniel Gnad Saarland University Saarbr¨ucken, Germany

Source URL: icaps16.icaps-conference.org

• A* search algorithm
• Combinatorial optimization
• Game artificial intelligence
• Mathematics
• Information science
• Information retrieval
• C*-algebras

Synthesizing Universally-Quantified Inductive Invariants Sharon Shoham Tel Aviv University

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

* CTL synthesis via LTL synthesis

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

• Temporal logic
• Logic in computer science
• Computation tree logic
• Linear temporal logic
• CTL*

Critical Constrained Planning and an Application to Network Penetration Testing Marcel Steinmetz Saarland University Saarbr¨ucken, Germany {steinmetz}@cs.uni-saarland.de

Source URL: icaps16.icaps-conference.org

• Search algorithms
• Theoretical computer science
• Heuristic
• State space search
• Mathematical optimization
• Algorithm
• Mathematics
• Philosophy of mathematics
• Cognitive science

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

Do Portfolio Solvers Harm? Christoph Weidenbach Max Planck Insitute for Informatics Saarland Informatics CampusSaarbr¨ ucken, Germany

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Logic in computer science
• Formal methods
• Automated reasoning
• Constraint programming
• Automated theorem proving
• Satisfiability modulo theories
• Solver
• Answer set programming
• Satz
• Model checking
• Algorithm selection

LoopInvGen: Data-Driven Loop Invariant Inference using Learned Features SyGuS-COMPSaswat Padhi

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

• Formal methods
• I0
• Loop invariant