797 search results - page 14 / 160 » Eliminating Proofs from Programs |
106
click to vote
APLAS
2011
ACM
13 years 9 months ago
2011
ACM
The well-known third list homomorphism theorem states that if a function h is both an instance of foldr and foldl, it is a list homomorphism. Plenty of previous works devoted to co...
PADO
2001
Springer
15 years 1 months ago
2001
Springer
Tag elimination is a program transformation for removing unnecessary tagging and untagging operations from automatically generated programs. Tag elimination was recently proposed a...
PEPM
2010
ACM
15 years 6 months ago
2010
ACM
We present two tools which together allow reasoning about (a substantial subset of) Haskell programs. One is the code generator of the proof assistant Isabelle, which turns speci...
CAV
2007
Springer
15 years 3 months ago
2007
Springer
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
93
Voted
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...