632 search results - page 71 / 127 » Proving Invariants of Functional Programs |
120
click to vote
CAV
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. We describe a tool that applies theorem proving technology to synthesize code fragments that use given library functions. To determine candidate code fragments, our appro...
131
click to vote
STEP
2003
IEEE
15 years 8 months ago
2003
IEEE
When testing a program, correctly executed test cases are seldom explored further, even though they may carry useful information. Metamorphic testing proposes to generate follow-u...
118
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
205
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
118
click to vote
LISP
2002
15 years 2 months ago
2002
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...