Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krsti...
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
—Spectrum awareness is a crucial first step of a cognitive radio (CR). This provides information necessary for the CR to adapt to the radio frequency environment, and involves re...
Qiyun Zhang, Octavia A. Dobre, Sreeraman Rajan, Ro...
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of phys...
Patrick Schaller, Benedikt Schmidt, David A. Basin...
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...