63 search results - page 3 / 13 » 06111 Abstracts Collection -- Complexity of Boolean Function... |
VMCAI
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
SAS
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
VMCAI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
DLT
2009
13 years 5 months ago
2009
Abstract. We analyze Hmelevskii's theorem, which states that the general solutions of constant-free equations on three unknowns are expressible by a finite collection of formu...