1076 search results - page 34 / 216 » Operations on proofs and labels |
123
Voted
APLAS
2011
ACM
14 years 25 days ago
2011
ACM
The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to co...
LPAR
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We discuss a collection of mechanized formal proofs of symmetric key block encryption algorithms (AES, MARS, Twofish, RC6, Serpent, IDEA, and TEA), performed in an imple...
117
Voted
LOPSTR
2001
Springer
15 years 5 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
110
Voted
APAL
2008
15 years 29 days ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
104
Voted
LOGCOM
2007
15 years 21 days ago
2007
Various forms of rely/guarantee conditions have been used to record and reason about interference in ways that provide compositional development methods for concurrent programs. Th...