797 search results - page 29 / 160 » Eliminating Proofs from Programs |
118
click to vote
TPHOL
2008
IEEE
15 years 7 months ago
2008
IEEE
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
104
Voted
IFL
1997
Springer
15 years 5 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
102
Voted
VSTTE
2005
Springer
15 years 6 months ago
2005
Springer
: Verifying design instead of code can be an effective and practical approach to obtaining verified software. This paper argues that proof scores are an attractive method for ver...
104
click to vote
ICTAC
2004
Springer
15 years 6 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
102
click to vote
FUIN
2007
15 years 21 days ago
2007
Proof-carryingcode provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set o...