171 search results - page 23 / 35 » CoSP: a general framework for computational soundness proofs |
105
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...
TLCA
2007
Springer
15 years 5 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
105
click to vote
ISSAC
2004
Springer
15 years 5 months ago
2004
Springer
There exist sound literature and algorithms for computing Liouvillian solutions for the important problem of linear ODEs with rational coefficients. Taking as sample the 363 secon...
ACMACE
2006
ACM
15 years 5 months ago
2006
ACM
This paper focuses on the mapping strategies in the interface design for the Expression Synthesis Project (ESP). The goal of ESP is to use the metaphor of driving to allow non-exp...