Computer Aided Verification
From MaRDI portal
Publication:5312946
DOI10.1007/B98490zbMATH Open1103.68037OpenAlexW4298302743MaRDI QIDQ5312946FDOQ5312946
Authors: Ashish Tiwari 
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98490
Recommendations
Cited In (45)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
- On invariant checking
- Title not available (Why is that?)
- All-Termination(T)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- On eventual non-negativity and positivity for the weighted sum of powers of matrices
- Reflections on termination of linear loops
- 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
- Algebraic model checking for discrete linear dynamical systems
- Termination of single-path polynomial loop programs
- Program termination using Z-transform theory
- Discovering non-terminating inputs for multi-path polynomial programs
- Title not available (Why is that?)
- Witness to non-termination of linear programs
- Cut elimination for GLS using the terminability of its regress process
- On termination of integer linear loops
- \(o\)-minimal invariants for linear loops
- A second-order formulation of non-termination
- A recursive decision method for termination of linear programs
- What else is undecidable about loops?
- On the termination of integer loops
- Convergence: integrating termination and abort-freedom
- Termination of polynomial loops
- Title not available (Why is that?)
- Proving termination of nonlinear command sequences
- Analyzing ultimate positivity for solvable systems
- A Perron-Frobenius theorem for deciding matrix growth
- Computing expected runtimes for constant probability programs
- Complexity of Restricted Variants of Skolem and Related Problems
- Recent advances in program verification through computer algebra
- Termination analysis of linear loop programs
- Symbolic decision procedure for termination of linear programs
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
- Termination of linear programs with nonlinear constraints
- Termination of Integer Linear Programs
- Deciding conditional termination
- Model checking linear dynamical systems under floating-point rounding
- What's decidable about discrete linear dynamical systems?
- Multiphase-linear ranking functions and their relation to recurrent sets
- Title not available (Why is that?)
- Mortality and Edge-to-Edge Reachability are Decidable on Surfaces
- Termination of linear loops under commutative updates
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
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)
