797 search results - page 24 / 160 » Eliminating Proofs from Programs |
123
click to vote
ENTCS
2007
15 years 2 months ago
2007
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
136
Voted
ENTCS
2008
15 years 2 months ago
2008
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
109
Voted
ICLP
2010
Springer
15 years 6 months ago
2010
Springer
The proof-theoretic approach to logic programming has benefited from the
131
Voted
CORR
2010
Springer
15 years 13 hour ago
2010
Springer
We propose a lightweight approach for certification of Java bytecode monitor inlining using proof-carrying code. The main purpose of such a framework is to enable development use ...
121
click to vote
JUCS
2008
15 years 2 months ago
2008
: Weak References constitute an elegant mechanism for an application to interact with its garbage collector. In most of its typical uses, weak references are used through weak tabl...