50 search results - page 2 / 10 » Automatic Accurate Time-Bound Analysis for High-Level Langua... |
FPCA
1989
13 years 9 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
LCTRTS
2001
Springer
13 years 9 months ago
2001
Springer
ICLP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
SIGOPS
2010
12 years 12 months ago
2010
We introduce SelfTalk, a novel declarative language that allows users to query and understand the status of a large scale system. SelfTalk is sufficiently expressive to encode an ...
DRR
2010
13 years 7 months ago
2010
In this paper we present an OCR validation module, implemented for the System for Preservation of Electronic Resources (SPER) developed at the U.S. National Library of Medicine.1 ...