Closed-form upper bounds in static cost analysis (Q2429987): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost analysis of object-oriented bytecode programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated higher-order complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of Integer Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource bound certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating program analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static prediction of heap space usage for first-order functional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic program specialisation through partial deduction: Control issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial evaluation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sup-interpretations, a semantic method for static analysis of program resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Naïve Time Analysis and its Theory of Cost Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The concept of a supercompiler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanical program analysis / rank
 
Normal rank

Latest revision as of 23:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Closed-form upper bounds in static cost analysis
scientific article

    Statements

    Closed-form upper bounds in static cost analysis (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 April 2011
    0 references
    0 references
    cost analysis
    0 references
    closed-form upper bounds
    0 references
    resource analysis
    0 references
    automatic complexity analysis
    0 references
    static analysis
    0 references
    abstract interpretation
    0 references
    programming languages
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references