Media Weekends at Bernie’s (and other highlights of the first wave of presidential candidate announcements) May 28, 2015 A PEORIA Project Report Associate Professors Michael Cornfield and Lara M. Brown

Source URL: gspm.gwu.edu

• Carly Fiorina
• Political campaign

Executing Specifications using Synthesis and Constraint Solving Viktor Kuncak?1 , Etienne Kneuss1 , and Philippe Suter1,2 1 2

Source URL: lara.epfl.ch

• Computer programming
• Constraint satisfaction problem
• Satisfiability Modulo Theories
• Constraint satisfaction
• Constraint logic programming
• Constraint programming
• Theoretical computer science
• Software engineering

Reductions for Synthesis Procedures? Swen Jacobs1 , Viktor Kuncak2 , and Philippe Suter2 1 2

Source URL: lara.epfl.ch

• Automated theorem proving
• Logic programming
• Unification
• Function
• Expected value
• Integration by substitution
• First-order logic
• Μ operator
• Mathematics
• Mathematical logic
• Functions and mappings

Software Tools for Technology Transfer manuscript No. (will be inserted by the editor) Functional Synthesis for Linear Arithmetic and Sets Viktor Kuncak, Mika¨ el Mayer, Ruzica Piskac, Philippe Suter?

Source URL: lara.epfl.ch

• Model theory
• Logic in computer science
• Constraint programming
• Predicate logic
• Semantics
• Satisfiability Modulo Theories
• Quantifier elimination
• First-order logic
• Function
• Logic
• Mathematical logic
• Mathematics

Mässan: Vi kommer att ha ca 15 lätta fordon samt ca 4 tunga fordon på mässan utanför hotell Strandbaden att lära känna närmare. Under konferensblocken är mässan stängd. Vissa fordon går att provköra. Transpo

Source URL: www.lansstyrelsen.se

Motorcycle Lane-splitting and Safety in California By Thomas Rice, PhD Lara Troszak, MA Taryn Erhardt

Source URL: www.ots.ca.gov

• Road transport
• Cycling
• Lane splitting
• Traffic law
• Motorcycle
• Motorcycling
• Lane
• Segregated cycle facilities
• Traffic
• Transport
• Land transport
• Motorcycle safety

Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic Viktor Kuncak1 and Martin Rinard2 1 Ecole Politechnique F´ed´erale de Lausanne, Lausanne, VD, Switzerland

Source URL: lara.epfl.ch

• Logic in computer science
• Model theory
• Complexity classes
• Boolean algebra
• Electronic design automation
• Boolean satisfiability problem
• Presburger arithmetic
• Quantifier elimination
• Decision problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Symbolic Resource Bound Inference for Functional Programs Ravichandhran Madhavan1 and Viktor Kuncak2 1 2

Source URL: lara.epfl.ch

• Formal methods
• Electronic design automation
• Logic in computer science
• NP-complete problems
• Model theory
• Function
• Boolean satisfiability problem
• Structure
• Parameter
• Mathematics
• Theoretical computer science
• Mathematical logic

Software Synthesis Procedures ∗ Viktor Kuncak Mikaël Mayer LARA, I&C

Source URL: lara.epfl.ch

• Model theory
• Logic in computer science
• Constraint programming
• Electronic design automation
• Formal methods
• Satisfiability Modulo Theories
• Boolean satisfiability problem
• First-order logic
• Interpretation
• Mathematical logic
• Theoretical computer science
• Mathematics

Effect Analysis for Programs with Callbacks Etienne Kneuss1 , Viktor Kuncak1? , and Philippe Suter1,2 1 2 ´

Source URL: lara.epfl.ch

• Graph theory
• Networks
• Routing algorithms
• Scene graph
• Knowledge representation
• Tree
• Mathematics