Sciweavers

1128 search results - page 41 / 226
» Little Engines of Proof
Sort
View
FSTTCS
2005
Springer
15 years 3 months ago
Quantitative Models and Implicit Complexity
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...
Ugo Dal Lago, Martin Hofmann
VSTTE
2005
Springer
15 years 3 months ago
Specified Blocks
This paper argues that specified blocks have every advantage over the combination of assertions, preconditions, postconditions, invariants, and variants, both for verifying program...
Eric C. R. Hehner
VSTTE
2005
Springer
15 years 3 months ago
Tool Integration for Reasoned Programming
We argue for the importance of tool integration in achieving the Program Verifier Grand Challenge. In particular, we argue for what we call strong integration, i.e. a co-operative...
Andrew Ireland
TAPSOFT
1987
Springer
15 years 1 months ago
Induction Principles Formalized in the Calculus of Constructions
The Calculus of Constructions is a higher-order formalism for writing constructive proofs in a natural deduction style, inspired from work of de Bruijn [2, 3], Girard [12], Martin...
Gérard P. Huet
85
Voted
AMAST
2010
Springer
14 years 4 months ago
Type Fusion
Fusion is an indispensable tool in the arsenal of techniques for program derivation. Less well-known, but equally valuable is type fusion, which states conditions for fusing an app...
Ralf Hinze