797 search results - page 61 / 160 » Eliminating Proofs from Programs |
100
Voted
ENTCS
2008
15 years 22 days ago
2008
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
105
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
111
click to vote
ESOP
2007
Springer
15 years 4 months ago
2007
Springer
Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate i...
105
click to vote
CACM
2010
14 years 10 months ago
2010
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
112
Voted
ICSE
2010
IEEE-ACM
15 years 5 months ago
2010
IEEE-ACM
The efficacy of mutation analysis depends heavily on its capability to mutate programs in such a way that they remain executable and exhibit deviating behaviour. Whereas the forme...