Discovering non-terminating inputs for multi-path polynomial programs (Q2341594): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recent advances in program verification through computer algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / 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: Alternation for Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769578 / 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 linear programs with nonlinear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic decision procedure for termination of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TERMINATION ANALYSIS OF LINEAR LOOPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic termination analysis of solvable loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Conditional Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-linear loop invariant generation using Gröbner bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing polynomial program invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantifier-elimination based heuristic for automatically generating inductive assertions for programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all polynomial invariants in simple loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning Algebraically About P-Solvable Loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving non-termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-termination Checking 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: Finding positively invariant sets of a class of nonlinear loops via curve fitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for isolating the real solutions of semi-algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Membership in polynomial ideals over Q is exponential space complete / rank
 
Normal rank

Latest revision as of 00:54, 10 July 2024

scientific article
Language Label Description Also known as
English
Discovering non-terminating inputs for multi-path polynomial programs
scientific article

    Statements

    Discovering non-terminating inputs for multi-path polynomial programs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 April 2015
    0 references
    0 references
    polynomial ideals
    0 references
    polynomial programs
    0 references
    termination analysis
    0 references
    0 references
    0 references
    0 references