1979
DOI: 10.1007/3-540-09526-8_16
|View full text |Cite
|
Sign up to set email alerts
|

A theoretical study on the time analysis of programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
9
0

Year Published

1980
1980
2013
2013

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 1 publication
1
9
0
Order By: Relevance
“…While these upper bounds are tight for the class of programs as a whole, many programs of the class have a lower complexity, so we can try to analyze a given program more precisely. Works of this kind include [11,1,14,18,10]. With a single exception, these works proposed syntactic criteria, or analysis algorithms, that are sufficient for ensuring that the program lies in a desired class (say, polynomial-time programs), but are not both necessary and sufficient: thus, they do not address the decidability question (the exception is [14] which has a decidability result for a "core" language).…”
Section: Related Workmentioning
confidence: 99%
“…While these upper bounds are tight for the class of programs as a whole, many programs of the class have a lower complexity, so we can try to analyze a given program more precisely. Works of this kind include [11,1,14,18,10]. With a single exception, these works proposed syntactic criteria, or analysis algorithms, that are sufficient for ensuring that the program lies in a desired class (say, polynomial-time programs), but are not both necessary and sufficient: thus, they do not address the decidability question (the exception is [14] which has a decidability result for a "core" language).…”
Section: Related Workmentioning
confidence: 99%
“…The name "step-counting version" is taken from [Adachi, Kasai & Moriya 1979 [Wadler 1988] with reference to [Métayer 1988], a time-complexity. The name complexity function is in both references used for the time bound function composed with the size measure.…”
Section: Definitionsmentioning
confidence: 99%
“…The paper describes a performance compiler to analyse a simple procedureless imperative language and it also contains results on the analysis of FP programs. [Adachi, Kasai & Moriya 1979] develops an algorithm to construct time bound programs for a class of imperative programs called simple loop programs.…”
Section: Related Workmentioning
confidence: 99%
“…Also, Cousot and Cousot sketch an approach to performance analysis already in their seminal 1977 paper on abstract interpretation [10]. Since then, a good number of cost analysis frameworks for a wide variety of programming languages have been devised, including for functional [22,16,18,21,19,8], logic [13,17], and imperative [1,2] programming languages. An important observation of this paper is that the result of cost analysis in the different languages and programming paradigms can often be uniformly expressed as Cost Relation Systems (CRSs for short).…”
Section: Introductionmentioning
confidence: 99%