A type-based complexity analysis of object oriented programs (Q1640983): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q129726623, #quickstatements; #temporary_batch_1726323884171
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: COSTA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Featherweight Java / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964137868 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1802.06653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Objects in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Lower Bounds for Maze Threadability on Restricted Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-Based Complexity Analysis for Fork Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolving Graph-Structures and Their Implicit Computational Complexity / 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: Resource control graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Type-Checking for Amortised Heap-Space 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: Static determination of quantitative resource usage for higher-order programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / 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: FM 2005: Formal Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure pointer programs with iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-Change Termination, Monotonicity Constraints and Ranking Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Termination of Integer Loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition predicate abstraction and fair termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPEED: Symbolic Complexity Bound Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPEED / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129726623 / rank
 
Normal rank

Latest revision as of 15:28, 14 September 2024

scientific article
Language Label Description Also known as
English
A type-based complexity analysis of object oriented programs
scientific article

    Statements

    A type-based complexity analysis of object oriented programs (English)
    0 references
    0 references
    0 references
    14 June 2018
    0 references
    object-oriented program
    0 references
    type system
    0 references
    complexity
    0 references
    polynomial time
    0 references

    Identifiers