The following pages link to (Q2769578):
Displaying 20 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)
- Synthesizing ranking functions for loop programs via SVM (Q2084940) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- PPLite: zero-overhead encoding of NNC polyhedra (Q2216124) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Ranking function synthesis for bit-vector relations (Q2248069) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- Witness to non-termination of linear programs (Q2357364) (← links)
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods (Q2418665) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Termination of Single-Path Polynomial Loop Programs (Q3179389) (← links)
- (Q5092319) (← links)
