Ranking Functions for Linear-Constraint Loops (Q5501930): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q418007
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Amir M. Ben-Amram / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AProVE / rank
 
Normal rank
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: PPL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PolyLib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983764301 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1208.4041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed-form upper bounds in static 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: Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Tight Closure Algorithm for Integer Octagonal Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at the automatic synthesis of linear ranking functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity Constraints for Termination in the Integer Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear ranking problem for integer linear-constraint loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Termination of Integer Loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Gap-Order Constraint Abstractions of Counter Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2005 – Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of Integer Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Function Synthesis for Bit-Vector Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey vs. Lexicographic Termination Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient solutions to the affine scheduling problem. I: One- dimensional time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient solutions to the affine scheduling problem. II: Multidimensional time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation for Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Two-Dimensional Integer Hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Ranking for Linear Lasso Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Characterizations of Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loop Summarization and Termination Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-change principle for program termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic numeric abstractions for heap-manipulating programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence with affine level mappings is P-time decidable for CLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition Invariants and Transition Predicate Abstraction for Program Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LIBRARY FOR DOING POLYHEDRAL OPERATIONS / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:12, 10 July 2024

scientific article; zbMATH DE number 6472747
Language Label Description Also known as
English
Ranking Functions for Linear-Constraint Loops
scientific article; zbMATH DE number 6472747

    Statements

    Ranking Functions for Linear-Constraint Loops (English)
    0 references
    0 references
    0 references
    0 references
    14 August 2015
    0 references
    0 references
    ranking functions
    0 references
    linear constraints
    0 references
    termination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references