220 search results - page 41 / 44 » Coq Modulo Theory |
107
click to vote
LPAR
2012
Springer
13 years 5 months ago
2012
Springer
traction with Interpolants for Arrays Francesco Alberti1 , Roberto Bruttomesso2 , Silvio Ghilardi2 , Silvio Ranise3 , Natasha Sharygina1 1 Universit`a della Svizzera Italiana, Luga...
CSFW
2009
IEEE
15 years 1 months ago
2009
IEEE
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
171
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
TPHOL
2007
IEEE
15 years 3 months ago
2007
IEEE
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...