Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
The paper argues, that a direct formalization of the way common sense thinks about the numerical identity of enduring entities, requires that traditional predicate logic is develo...
Compared are different methods for evaluation of formulas expressing microprocessor correctness in the logic of Equality with Uninterpreted Functions and Memories (EUFM) by transl...
This paper presents a modular framework for the specification of certain inductivelydefined coalgebraic types. Modal logics for coalgebras of polynomial endofunctors on the catego...
A pervasive system features a plethora of devices, services and applications organized as a large distributed system. One approach to managing such systems is by policies where ad...