SPEED: Symbolic Complexity Bound Analysis
Author:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 51-62
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- A combination framework for tracking partition sizesACM SIGPLAN Notices, 2009
- SPEEDACM SIGPLAN Notices, 2009
- Abstract Interpretation with Applications to Timing ValidationLecture Notes in Computer Science, 2008
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing AnalysisLecture Notes in Computer Science, 2008
- The worst-case execution-time problem—overview of methods and survey of toolsACM Transactions on Embedded Computing Systems, 2008
- User-Definable Resource Bounds Analysis for Logic Programs2006
- Termination proofs for systems codeACM SIGPLAN Notices, 2006
- Combining abstract interpretersACM SIGPLAN Notices, 2006
- ACE: an automatic complexity evaluatorACM Transactions on Programming Languages and Systems, 1988
- Mechanical program analysisCommunications of the ACM, 1975