Sciweavers

184 search results - page 14 / 37
» Formal Verification of an Optimizing Compiler
Sort
View
KBSE
1997
IEEE
13 years 11 months ago
Application of Formal Methods to the Development of a Software Maintenance Tool
Partial evaluation is an optimization technique traditionally used in compilation. We have adapted this technique to the understanding of scientic application programs during t...
Sandrine Blazy, Philippe Facon
AIPS
2006
13 years 8 months ago
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
Jörg Hoffmann, Carla P. Gomes, Bart Selman
BCS
2008
13 years 8 months ago
Compiling C-like Languages to FPGA Hardware: Some Novel Approaches Targeting Data Memory Organisation
This paper describes our approaches to raise the level of abstraction at which hardware suitable for accelerating computationally-intensive applications can be specified. Field-Pr...
Qiang Liu, George A. Constantinides, Konstantinos ...
APLAS
2001
ACM
13 years 10 months ago
Verifying the CPS Transformation in Isabelle/HOL
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
Yasuhiko Minamide, Koji Okuma
CACM
2010
97views more  CACM 2010»
13 years 4 months ago
Certified software
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
Zhong Shao