• Publications
  • Influence
Satisfiability Modulo Theories
Many applications of formal methods rely on generating formulas of First-Order Logic and proving or disproving their validity and general-purpose theorem provers, such as for instance provers based on the resolution calculus, are typically inadequate to work with the sort of formulas generated by formal methods tools. Expand
Combinatorial sketching for finite programs
SKETCH is a language for finite programs with linguistic support for sketching and its combinatorial synthesizer is complete for the class of finite programs, guaranteed to complete any sketch in theory, and in practice has scaled to realistic programming problems. Expand
Introduction to Embedded Systems - A Cyber-Physical Systems Approach
The most visible use of computers and software is processing information for human consumption. The vast majority of computers in use, however, are much less visible. They run the engine, brakes,Expand
Syntax-guided synthesis
  • R. Alur, R. Bodík, +7 authors A. Udupa
  • Computer Science, Engineering
  • Formal Methods in Computer-Aided Design
  • 1 October 2013
This work describes three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the synthesis problem, reports on prototype implementations, and presents experimental results on an initial set of benchmarks. Expand
Semantics-aware malware detection
Experimental evaluation demonstrates that the malware-detection algorithm can detect variants of malware with a relatively low run-time overhead and the semantics-aware malware detection algorithm is resilient to common obfuscations used by hackers. Expand
Oracle-guided component-based program synthesis
A novel approach to automatic synthesis of loop-free programs based on a combination of oracle-guided learning from examples, and constraint-based synthesis from components using satisfiability modulo theories (SMT) solvers is presented. Expand
Model predictive control with signal temporal logic specifications
This work describes the use of STL to specify a wide range of properties of these systems, including safety, response and bounded liveness, and encode STL specifications as mixed integer-linear constraints on the system variables in the optimization problem at each step of a model predictive control framework. Expand
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions
CLU generalizes the logic of equality with uninterpreted functions (EUF) with constrained lambda expressions, ordering, and successor and predecessor functions to model many infinite-state systems including those with infinite memories, finite and infinite queues including lossy channels, and networks of identical processes. Expand
Handbook of Satisfiability
The number of particles in the solution is likely to increase, but the amount of particles bound to cover the solution will not increase as much as previously thought. Expand
Secure State Estimation for Cyber-Physical Systems Under Sensor Attacks: A Satisfiability Modulo Theory Approach
A novel algorithm is presented that uses a satisfiability modulo theory approach to harness the complexity of secure state estimation and leverages results from formal methods over real numbers to provide guarantees on the soundness and completeness of the algorithm. Expand