797 search results - page 24 / 160 » Eliminating Proofs from Programs |
110
click to vote
ENTCS
2007
15 years 22 days 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...
119
click to vote
ENTCS
2008
15 years 26 days 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...
ICLP
2010
Springer
15 years 4 months ago
2010
Springer
The proof-theoretic approach to logic programming has benefited from the
118
Voted
CORR
2010
Springer
14 years 10 months 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 ...
103
Voted
JUCS
2008
15 years 22 days 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...