518 search results - page 61 / 104 » Automating Proofs in Category Theory |
117
click to vote
PPDP
2005
Springer
15 years 5 months ago
2005
Springer
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
112
click to vote
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
SIGSOFT
2006
ACM
15 years 5 months ago
2006
ACM
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
106
click to vote
PEPM
2009
ACM
15 years 8 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
105
click to vote
PLDI
2003
ACM
15 years 5 months ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...