136 search results - page 17 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
STEP
2003
IEEE
14 years 4 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...
HYBRID
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. A methodology for safety verification using barrier certificates has been proposed recently. Conditions that must be satisfied by a barrier certificate can be formula...
PLPV
2011
ACM
13 years 1 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
CHARME
2003
Springer
14 years 4 months ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...