Computer Aided Verification
From MaRDI portal
(Redirected from Publication:5312946)
Computer Aided Verification (scientific article; zbMATH DE number 2199330)
Computer Aided Verification (scientific article; zbMATH DE number 2199330)
Recommendations
Cited in
(53)- Program termination using Z-transform theory
- Convergence: integrating termination and abort-freedom
- On eventual non-negativity and positivity for the weighted sum of powers of matrices
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- Algebraic model checking for discrete linear dynamical systems
- Termination of polynomial loops
- A Perron-Frobenius theorem for deciding matrix growth
- Computing expected runtimes for constant probability programs
- Discovering non-terminating inputs for multi-path polynomial programs
- A second-order formulation of non-termination
- Witness to non-termination of linear programs
- A recursive decision method for termination of linear programs
- Cut elimination for GLS using the terminability of its regress process
- On the termination of integer loops
- Termination of single-path polynomial loop programs
- Recent advances in program verification through computer algebra
- scientific article; zbMATH DE number 5704141 (Why is no real title available?)
- All-Termination(T)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
- On invariant checking
- Proving termination of nonlinear command sequences
- Tight polynomial bounds for loop programs in polynomial space
- scientific article; zbMATH DE number 7559471 (Why is no real title available?)
- Termination of linear loops over the integers
- Complexity of Restricted Variants of Skolem and Related Problems
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
- On termination of integer linear loops
- Symbolic decision procedure for termination of linear programs
- Termination analysis of linear loop programs
- Termination of Integer Linear Programs
- Deciding conditional termination
- Termination of linear programs with nonlinear constraints
- Termination of linear loops under commutative updates
- What's decidable about discrete linear dynamical systems?
- Mortality and Edge-to-Edge Reachability are Decidable on Surfaces
- What else is undecidable about loops?
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
- Model checking linear dynamical systems under floating-point rounding
- Multiphase-linear ranking functions and their relation to recurrent sets
- On simulating Turing machines with matrix semigroups with integrality tests
- On robustness for the Skolem, positivity and ultimate positivity problems
- Positivity-hardness results on Markov decision processes
- The 2-dimensional constraint loop problem is decidable
- T-rex: termination of recursive functions using lexicographic linear combinations
- Robust positivity problems for linear recurrence sequences: the frontiers of decidability for explicitly given neighbourhoods
- Termination of triangular polynomial loops
- Polynomial loops: beyond termination
- Targeting completeness: automated complexity analysis of integer programs
- Deciding termination of simple randomized loops
- On piecewise affine reachability with Bellman operators
- On termination of polynomial programs with equality conditions
- Reflections on termination of linear loops
- Analyzing ultimate positivity for solvable systems
This page was built for publication: Computer Aided Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312946)
