797 search results - page 27 / 160 » Eliminating Proofs from Programs |
SIGADA
2005
Springer
15 years 6 months ago
2005
Springer
Recent trends in software re-engineering have included tools to extract program slices from existing Ada procedures. One such tool has already been developed that extracts program...
134
click to vote
TPHOL
1999
IEEE
15 years 5 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
83
Voted
ENTCS
2007
15 years 22 days ago
2007
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
108
click to vote
ESOP
2001
Springer
15 years 5 months ago
2001
Springer
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
129
click to vote
LOPSTR
2000
Springer
15 years 4 months ago
2000
Springer
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...