364 search results - page 51 / 73 » Model checking with Boolean Satisfiability |
VMCAI
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Symmetry reduction is a technique to alleviate state explosion in model checking by replacing a model of replicated processes with a bisimilar quotient model. The size of...
KBSE
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract—We describe BPELCheck, a tool for statically analyzing interactions of composite web services implemented in BPEL. Our algorithm is compositional, and checks each proces...
CAV
1994
Springer
14 years 26 days ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
BIRTHDAY
2009
Springer
14 years 3 months ago
2009
Springer
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
CCECE
2006
IEEE
14 years 2 months ago
2006
IEEE
Several approaches have been proposed to accelerate the NP-complete Boolean Satisfiability problem (SAT) using reconfigurable computing. We present an FPGA based clause evaluator,...