Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) integer-valued state variables, such as pipelined processor designs and timed systems. In this paper, we present a fast decision procedure for separation logic, which combines Boolean satisfiability (SAT) with a graph based ...

We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the first family of compact spaces shown to be NP-complete in a geometric setting. Valiant's theory of algebraic/arithmetic complexity classes is an algebraic analo...

Several concepts of a Boolean derivative have been investigated in the literature. In this paper we find out whether a Boolean operator can satisfy all of the three basic derivative-like properties: additivity, homogeneity and the Leibniz rule. In a certain sense, the answer is negative. The attempts to establish Boolean analogues of several concepts and results from Calculus begun in 1917 with...

in this paper the concept of an $omega$- almost boolean ring is introduced and illistrated how a sheaf of algebras can be constructed from an $omega$- almost boolean ring over a locally boolean space.