2 search results - page 1 / 1 » Scalable formula decomposition for propositional satisfiabil... |
C3S2E
2010
ACM
13 years 12 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
POPL
2009
ACM
14 years 11 months ago
2009
ACM
We study modular, automatic code generation from hierarchical block diagrams with synchronous semantics. Such diagrams are the fundamental model behind widespread tools in the emb...