1128 search results - page 35 / 226 » Little Engines of Proof |
AOSD
2012
ACM
13 years 5 months ago
2012
ACM
In this work we consider specification and compositional verification for interference detection when several aspects are woven together under joint-weaving semantics without re...
FSE
2006
Springer
15 years 1 months ago
2006
Springer
The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model dating back to Shannon [24] and has seen frequent use in proving the security of various cryptographi...
ESOP
2010
Springer
15 years 24 days ago
2010
Springer
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser inter...
FMICS
2008
Springer
14 years 11 months ago
2008
Springer
There has been relatively little work on the implementability of timing requirements. We have previously provided definitions of fundamental timing operators that explicitly consid...
IJCAI
2003
14 years 11 months ago
2003
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...