108 search results - page 14 / 22 » User-Definable Resource Bounds Analysis for Logic Programs |
PLDI
2009
ACM
14 years 1 months ago
2009
ACM
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
PLDI
2009
ACM
14 years 7 months ago
2009
ACM
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
APLAS
2006
ACM
14 years 21 days ago
2006
ACM
This document contains the Isabelle/HOL sources underlying our paper A bytecode logic for JML and types [2], updated to Isabelle 2008. We present a program logic for a subset of s...
POPL
2011
ACM
12 years 9 months ago
2011
ACM
ensitivity has emerged as an excellent context abstraction for points-to analysis in object-oriented languages. Despite its practical success, however, object-sensitivity is poorl...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...