CL
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Many key verification problems such as boundedmodel-checking,circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e....
FSTTCS
2005
Springer
14 years 14 days ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...