2062 search results - page 162 / 413 » Derivatives of Logical Formulas |
162
click to vote
ENTCS
2007
15 years 4 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
131
click to vote
ENTCS
2007
15 years 4 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
148
click to vote
IFIP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We introduce a calculus with mobile names, distributed principals and primitives for secure remote communication, without any reference to explicit cryptography. The calc...
168
click to vote
VMCAI
2010
Springer
16 years 1 months ago
2010
Springer
In the recent years, there have been a large amount of investigations on safety verification of uncertain continuous systems. In engineering and applied mathematics, this verificat...
125
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...