ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS
From MaRDI portal
Publication:4923290
DOI10.1142/S0129054112400588zbMath1266.68091MaRDI QIDQ4923290
Lars Kristiansen, Amir M. Ben-Amram
Publication date: 6 June 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Cites Work
- A characterization of time complexity by simple loop programs
- Undecidable problems in unreliable computations.
- On the computational complexity of imperative programming languages
- A flow calculus of mwp -bounds for complexity analysis
- Decidable problems for powerful programs
- The Complexity of the Equivalence Problem for Simple Programs
- Mechanical program analysis
- Abstract Interpretation Frameworks
- Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
- The Equivalence Problem of Simple Programs