1445 search results - page 217 / 289 » Uniformly Hard Languages |
POPL
2005
ACM
14 years 10 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
POPL
2003
ACM
14 years 10 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
ICFP
2007
ACM
14 years 10 months ago
2007
ACM
Bidirectional transformation is a pair of transformations: a view function and a backward transformation. A view function maps one data structure called source onto another called...
ICFP
2004
ACM
14 years 10 months ago
2004
ACM
Among slide-presentation systems, the dominant application offers lly no abstraction capability. Slideshow, an extension of PLT Scheme, represents our effort over the last several...
ICFP
2004
ACM
14 years 10 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...