A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / 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: Ranking Abstractions / 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: Mechanically proving termination using polynomial interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT Solving for Termination Analysis with Polynomial Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Termination of Integer Term Rewriting / 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: Proving Termination by Bounded Increase / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tyrolean termination tool: techniques and features / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing positiveness of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive functions of symbolic expressions and their computation by machine, Part I / 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: Computer Aided Verification / rank
 
Normal rank

Latest revision as of 19:52, 1 July 2024

scientific article; zbMATH DE number 5587945
Language Label Description Also known as
English
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
scientific article; zbMATH DE number 5587945

    Statements

    A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (English)
    0 references
    0 references
    0 references
    28 July 2009
    0 references
    0 references
    0 references

    Identifiers