53390 search results - page 289 / 10678 » Computer Systems Analysis |
165
click to vote
TAPSOFT
1995
Springer
15 years 10 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
195
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Once a new genome is sequenced, one of the important questions is to determine the presence and absence of biological pathways. Analysis of biological pathways in a ge...
164
click to vote
IV
2009
IEEE
16 years 1 months ago
2009
IEEE
A lexical network is a very useful resource for natural language processing systems. However, building high quality lexical networks is a complex task. “Jeux de mots” is a web...
169
click to vote
APLAS
2010
ACM
15 years 6 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
203
click to vote
ENTCS
2006
15 years 6 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...