The following pages link to Computer Aided Verification (Q5312946):
Displayed 31 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
- On invariant checking (Q394493) (← links)
- Proving termination of nonlinear command sequences (Q470005) (← links)
- Symbolic decision procedure for termination of linear programs (Q539162) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- Reflections on termination of linear loops (Q832249) (← links)
- Analyzing ultimate positivity for solvable systems (Q897909) (← links)
- Convergence: integrating termination and abort-freedom (Q1647960) (← links)
- On eventual non-negativity and positivity for the weighted sum of powers of matrices (Q2104554) (← links)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops (Q2104561) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- A Perron-Frobenius theorem for deciding matrix growth (Q2239274) (← links)
- Computing expected runtimes for constant probability programs (Q2305420) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- A second-order formulation of non-termination (Q2353638) (← links)
- Witness to non-termination of linear programs (Q2357364) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- Termination of Single-Path Polynomial Loop Programs (Q3179389) (← links)
- All-Termination(T) (Q3617771) (← links)
- O-Minimal Invariants for Discrete-Time Dynamical Systems (Q5002799) (← links)
- (Q5028427) (← links)
- (Q5089280) (← links)
- (Q5092319) (← links)
- Complexity of Restricted Variants of Skolem and Related Problems (Q5111295) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- Termination of linear loops under commutative updates (Q6060374) (← links)
- What's decidable about discrete linear dynamical systems? (Q6113969) (← links)
- Mortality and Edge-to-Edge Reachability are Decidable on Surfaces (Q6120709) (← links)
- What else is undecidable about loops? (Q6174421) (← links)