The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
We present an algorithm for the runtime monitoring of business process properties with data parameterization. The properties are expressed in LTL-FO+ , an extension to traditional...
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
Even though the speed of software ray tracing has recently been increased to interactive performance even on standard PCs, these systems usually only supported triangles as geomet...
We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.