7139 search results - page 1112 / 1428 » Language Engineering in Practice |
294
click to vote
POPL
2008
ACM
16 years 7 months ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
319
click to vote
POPL
2004
ACM
16 years 7 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
302
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
This tutorial presents an overview of the data management issues faced by computer games today. While many games do not use databases directly, they still have to process large am...
191
Voted
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a parametric Hoare-like logic for computer-aided reasoning about typeable properties of functional programs. The logic is based on the concept of a specialised assertio...
181
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...