1895 search results - page 133 / 379 » Using ATL for Checking Models |
136
click to vote
PDPTA
2003
15 years 6 months ago
2003
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
123
Voted
SPIN
2007
Springer
15 years 11 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
153
click to vote
ATAL
2008
Springer
15 years 7 months ago
2008
Springer
We explore the problem of specification and verification of compliance in agent based Web service compositions. We use the formalism of temporal-epistemic logic suitably extended ...
110
click to vote
DATE
2010
IEEE
15 years 10 months ago
2010
IEEE
—Module paths are often used to specify the delays of cells in a Verilog cell library description, which define the propagation delay for an event from an input to an output. Sp...
118
click to vote
ASIACRYPT
2003
Springer
15 years 10 months ago
2003
Springer
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...