188 search results - page 10 / 38 » Logic of Proofs for Bounded Arithmetic |
141
click to vote
FOSSACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
163
click to vote
IFIP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract We introduce a generic framework for proof carrying code, developed and mechanically verified in Isabelle/HOL. The framework defines and proves sound a verification con...
126
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
122
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
153
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...