Sciweavers

2 search results - page 1 / 1
» Secure and Optimal Base Contraction in Graded Lukasiewicz Lo...
Sort
View
CCIA
2009
Springer
13 years 6 months ago
Secure and Optimal Base Contraction in Graded Lukasiewicz Logics
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...
Pere Pardo, Pilar Dellunde, Lluis Godo
SAC
2010
ACM
13 years 3 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...