Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
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...
rovides an abstract programmer’s model for the implementation of embedded control systems with hard real-time constraints. A typical control application consists of periodic soft...
Thomas A. Henzinger, Benjamin Horowitz, Christoph ...
Testing model transformations requires input models which are graphs of inter-connected objects that must conform to a meta-model and meta-constraints from heterogeneous sources su...
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...