SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for...
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
Kevin J. Hoffman, Patrick Eugster, Suresh Jagannat...
Many general-purpose, object-oriented scripting languages are dynamically typed, to keep the language flexible and not reject any programs unnecessarily. However, dynamic typing ...
Michael Furr, Jong-hoon (David) An, Jeffrey S. Fos...
Programming language specifications mandate static and dynamic analyses to preclude syntactic and semantic errors. Although individual languages are usually well-specified, comp...
Byeongcheol Lee, Ben Wiedermann, Martin Hirzel, Ro...