Pages that link to "Item:Q5410712"
From MaRDI portal
The following pages link to An Abstract Domain to Infer Ordinal-Valued Ranking Functions (Q5410712):
Displayed 9 items.
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Inference of ranking functions for proving temporal properties by abstract interpretation (Q681349) (← links)
- Constraint-based relational verification (Q832229) (← links)
- Reflections on termination of linear loops (Q832249) (← links)
- Decision tree learning in CEGIS-based termination analysis (Q832251) (← links)
- A decision tree lifted domain for analyzing program families with numerical features (Q2044175) (← links)
- Temporal prophecy for proving temporal properties of infinite-state systems (Q2058382) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting (Q5039530) (← links)