Q5114822 (Q5114822): Difference between revisions

@@ Property / cites work @@
+Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
+Normal rank
@@ Property / cites work @@
+Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
+Normal rank
@@ Property / cites work @@
+Ranking Functions for Linear-Constraint Loops
@@ Property / cites work: Ranking Functions for Linear-Constraint Loops / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS
+Normal rank
@@ Property / cites work @@
+An Improved Tight Closure Algorithm for Integer Octagonal Constraints
+Normal rank
@@ Property / cites work @@
+Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Factorization Forests
@@ Property / cites work: Factorization Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Size-Change Abstraction and Max-Plus Automata
@@ Property / cites work: Size-Change Abstraction and Max-Plus Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Static Complexity Analysis of Higher Order Programs
+Normal rank
@@ Property / cites work @@
+A flow calculus of             <i>mwp</i>             -bounds for complexity analysis
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for deciding the type of growth of products of integer matrices
+Normal rank
@@ Property / cites work @@
+A characterization of time complexity by simple loop programs
+Normal rank
@@ Property / cites work @@
+Numerical invariants via abstract machines
@@ Property / cites work: Numerical invariants via abstract machines / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of imperative programming languages
+Normal rank
@@ Property / cites work @@
+The size-change principle for program termination
@@ Property / cites work: The size-change principle for program termination / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidable problems in unreliable computations.
@@ Property / cites work: Undecidable problems in unreliable computations. / rank @@
+Normal rank
@@ Property / cites work @@
+Deductive verification in decidable fragments with Ivy
+Normal rank
@@ Property / cites work @@
+Computing polynomial program invariants
@@ Property / cites work: Computing polynomial program invariants / rank @@
+Normal rank
@@ Property / cites work @@
+Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
+Normal rank
@@ Property / cites work @@
+Verification, Model Checking, and Abstract Interpretation
+Normal rank
@@ Property / cites work @@
+Factorization forests of finite height
@@ Property / cites work: Factorization forests of finite height / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity and resource bound analysis of imperative programs using difference constraints
+Normal rank
@@ Property / cites work @@
+Mechanical program analysis
@@ Property / cites work: Mechanical program analysis / rank @@
+Normal rank