22 search results - page 4 / 5 » Invariants and Well-Foundedness in Program Algebra |
IFIP
2004
Springer
14 years 23 days ago
2004
Springer
We analyze an algebraic representation of AES–128 as an embedding in BES, due to Murphy and Robshaw. We present two systems of equations S and K concerning encryption and key gen...
VMCAI
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
ERSHOV
2009
Springer
13 years 11 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
TPHOL
2005
IEEE
14 years 29 days ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...