364 search results - page 60 / 73 » Model checking with Boolean Satisfiability |
LICS
2003
IEEE
14 years 2 months ago
2003
IEEE
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
LCPC
1999
Springer
14 years 1 months ago
1999
Springer
One of the challenges present to a Java compiler is Java’s frequent use of runtime exceptions. These exceptions affect performance directly by requiring explicit checks, as wel...
ESOP
2008
Springer
13 years 10 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
MKWI
2008
13 years 10 months ago
2008
: The advent of regulatory compliance requirements such as Sarbanes Oxley Act has forced enterprises to set up a process for managing an effective internal controls system on busin...
AAAI
1996
13 years 10 months ago
1996
We present a method for specifying temporal constraints on trajectories of dynamical systems and enforcing them during qualitative simulation. This capability can be used to focus...