Noname manuscript No. (will be inserted by the editor) Cutting to the Chase Solving Linear Integer Arithmetic

Source URL: csl.sri.com

• Mathematics
• Algebra
• Linear programming
• Linear algebra
• Elementary algebra
• Inequality
• Linear inequality
• Expected value
• Simplex algorithm
• Boolean satisfiability problem
• Cutting-plane method
• Equation solving

Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1

Source URL: csl.sri.com

Programming with “Big Code”: Lessons, Techniques and Applications Pavol Bielik1 , Veselin Raychev1 , and Martin Vechev1 1 Department of Computer Science, ETH Zurich, Switzerland

Source URL: files.sri.inf.ethz.ch

• Probability and statistics
• Probability theory
• Artificial intelligence
• Machine learning
• Computational statistics
• Graphical models
• Computational linguistics
• Natural language processing
• Conditional random field
• Probabilistic programming language
• Inference
• Support vector machine

Securify: Practical Security Analysis of Smart Contracts Petar Tsankov Andrei Dan Dana Drachsler-Cohen

Source URL: files.sri.inf.ethz.ch

Noname manuscript No. (will be inserted by the editor) Being Careful about Theory Combination Dejan Jovanovi´

Source URL: csl.sri.com

• Model theory
• Mathematics
• Metalogic
• Logic
• Mathematical logic
• Interpretation
• Structure

Robust Relational Layout Synthesis from Examples for Android

Source URL: files.sri.inf.ethz.ch

• Computational chemistry
• Constraint
• Computational science
• Physics
• Applied mathematics

A Model-Constructing Satisfiability Calculus Leonardo de Moura1 and Dejan Jovanovi´c2 1 2 Microsoft Research

Source URL: csl.sri.com

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Logic in computer science
• Automated theorem proving
• NP-complete problems
• Electronic design automation
• Formal methods
• Conflict-driven clause learning
• Boolean satisfiability problem
• Clause
• Unit propagation

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Logic in computer science
• Boolean algebra
• Circuit complexity
• Complexity classes
• Electronic design automation
• True quantified Boolean formula
• Satisfiability modulo theories
• NC
• FO
• Boolean circuit

PDF Document

Source URL: files.sri.inf.ethz.ch

PDF Document

Source URL: files.sri.inf.ethz.ch