Sciweavers

491 search results - page 78 / 99
» An Interpolating Theorem Prover
Sort
View
POPL
2006
ACM
14 years 9 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
CADE
2006
Springer
14 years 9 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi
CC
2010
Springer
117views System Software» more  CC 2010»
14 years 3 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...
TPHOL
2009
IEEE
14 years 3 months ago
Formal Analysis of Optical Waveguides in HOL
Optical systems are becoming increasingly important as they tend to resolve many bottlenecks in the present age communications and electronics. Some common examples include their u...
Osman Hasan, Sanaz Khan Afshar, Sofiène Tah...
TPHOL
2009
IEEE
14 years 3 months ago
Psi-calculi in Isabelle
Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, givi...
Jesper Bengtson, Joachim Parrow