The following pages link to (Q2769578):
Displayed 14 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Termination of floating-point computations (Q850498) (← links)
- The octagon abstract domain (Q853733) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Ranking function synthesis for bit-vector relations (Q2248069) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Automata-Based Termination Proofs (Q3637353) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)