—We present a middleware platform for assembling pervasive applications that demand fault-tolerance and adaptivity in distributed, dynamic environments. Unlike typical adaptive m...
Hubert Pham, Justin Mazzola Paluska, Umar Saif, Ch...
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
In this work we focus on a new technique for making cloning of parallel simulations more efficient. Cloning provides a means for running multiple similar simulations in parallel ...
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
Peter Baumgartner, Ulrich Furbach, Margret Gro&szl...