797 search results - page 82 / 160 » Eliminating Proofs from Programs |
147
Voted
WCRE
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper describes how a program called dup can be used to locate instances of duplication or nearduplication in a software system. D u p reports both textually identical sectio...
166
Voted
HASKELL
2009
ACM
15 years 10 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
138
click to vote
PLDI
2003
ACM
15 years 8 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
138
Voted
IADIS
2008
15 years 4 months ago
2008
Programming and developing of small scale software applications can be accomplished with simple command-line compilers that can be used to compile, test, and execute code generati...
110
click to vote
MSCS
2006
15 years 3 months ago
2006
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...