2062 search results - page 299 / 413 » Derivatives of Logical Formulas |
151
click to vote
FOSSACS
2009
Springer
16 years 22 days ago
2009
Springer
Although cryptographic protocols are typically analyzed in isolation, they are used in combinations. If a protocol was analyzed alone and shown to meet some security goals, will it...
148
click to vote
VMCAI
2009
Springer
16 years 21 days ago
2009
Springer
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
165
click to vote
KBSE
2009
IEEE
16 years 20 days ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
149
click to vote
CEC
2008
IEEE
16 years 12 days ago
2008
IEEE
Abstract— Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most o...
143
click to vote
CAV
2007
Springer
16 years 3 days ago
2007
Springer
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...