3179 search results - page 568 / 636 » Applications of PCF Theory |
POPL
2008
ACM
14 years 9 months ago
2008
ACM
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
POPL
2006
ACM
14 years 9 months ago
2006
ACM
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
POPL
2005
ACM
14 years 9 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
2001
ACM
14 years 9 months ago
2001
ACM
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...