ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS (Q4923290): Difference between revisions

@@ Property / cites work @@
+Abstract Interpretation Frameworks
@@ Property / cites work: Abstract Interpretation Frameworks / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of the Equivalence Problem for Simple Programs
+Normal rank
@@ Property / cites work @@
+Decidable problems for powerful programs
@@ Property / cites work: Decidable problems for powerful programs / rank @@
+Normal rank
@@ Property / cites work @@
+A flow calculus of             <i>mwp</i>             -bounds for complexity analysis
+Normal rank
@@ Property / cites work @@
+A characterization of time complexity by simple loop programs
+Normal rank
@@ Property / cites work @@
+On the computational complexity of imperative programming languages
+Normal rank
@@ Property / cites work @@
+Undecidable problems in unreliable computations.
@@ Property / cites work: Undecidable problems in unreliable computations. / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
+Normal rank
@@ Property / cites work @@
+The Equivalence Problem of Simple Programs
@@ Property / cites work: The Equivalence Problem of Simple Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Mechanical program analysis
@@ Property / cites work: Mechanical program analysis / rank @@
+Normal rank