Pages that link to "Item:Q5711515"
From MaRDI portal
The following pages link to Verification, Model Checking, and Abstract Interpretation (Q5711515):
Displaying 26 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
- Proving termination of nonlinear command sequences (Q470005) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Program termination using Z-transform theory (Q1106653) (← links)
- Self-correcting polynomial programs (Q1916988) (← links)
- Symbolic termination analysis of solvable loops (Q1930157) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- A second-order formulation of non-termination (Q2353638) (← links)
- Algorithms with polynomial interpretation termination proof (Q2740985) (← links)
- Algebraic Notions of Termination (Q3003302) (← links)
- An Iterative Method for Generating Loop Invariants (Q3004678) (← links)
- Termination of Single-Path Polynomial Loop Programs (Q3179389) (← links)
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis (Q3512505) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Automata-Based Termination Proofs (Q3637353) (← links)
- The Use of Termination Indicators in Computer Programming (Q3735059) (← links)
- (Q4738114) (← links)
- (Q5020657) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- Deciding Polynomial Termination Complexity for VASS Programs (Q6176114) (← links)
