Closed-Form Upper Bounds in Static Cost Analysis
Top Cited Papers
- 30 April 2010
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 46 (2) , 161-203
Abstract
No abstract availableKeywords
This publication has 47 references indexed in Scilit:
- The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systemsScience of Computer Programming, 2008
- Size-change termination with difference constraintsACM Transactions on Programming Languages and Systems, 2008
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)Science of Computer Programming, 2005
- Automated higher-order complexity analysisTheoretical Computer Science, 2004
- A framework for the integration of partial evaluation and abstract interpretation of logic programsACM Transactions on Programming Languages and Systems, 2004
- Logic program specialisation through partial deduction: Control issuesTheory and Practice of Logic Programming, 2002
- Constraint logic programming: a surveyThe Journal of Logic Programming, 1994
- Cost analysis of logic programsACM Transactions on Programming Languages and Systems, 1993
- ACE: an automatic complexity evaluatorACM Transactions on Programming Languages and Systems, 1988
- Automating program analysisJournal of the ACM, 1988