Sciweavers

101 search results - page 18 / 21
» Generating Text with a Theorem Prover
Sort
View
180
Voted
POPL
2009
ACM
15 years 11 months ago
Automated verification of practical garbage collectors
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
Chris Hawblitzel, Erez Petrank
CC
2010
Springer
117views System Software» more  CC 2010»
15 years 5 months ago
Punctual Coalescing
Compilers use register coalescing to avoid generating code for copy instructions. For architectures with register aliasing such as x86, Smith, Ramsey, and Holloway (2004) presented...
Fernando Magno Quintão Pereira, Jens Palsbe...
90
Voted
TPHOL
2003
IEEE
15 years 3 months ago
First Order Logic with Domain Conditions
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...
Freek Wiedijk, Jan Zwanenburg
ICFEM
1997
Springer
15 years 2 months ago
Formally Specifying and Verifying Real-Time Systems
A real-time computer system is a system that must perform its functions within specified time bounds. These systems are generally characterized by complex interactions with the en...
Richard A. Kemmerer
85
Voted
CARDIS
2006
Springer
114views Hardware» more  CARDIS 2006»
15 years 2 months ago
A Low-Footprint Java-to-Native Compilation Scheme Using Formal Methods
Ahead-of-Time and Just-in-Time compilation are common ways to improve runtime performances of restrained systems like Java Card by turning critical Java methods into native code. H...
Alexandre Courbot, Mariela Pavlova, Gilles Grimaud...