Computer Aided Verification

DOI10.1007/B98490MaRDI QIDQ5312946zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Termination of Integer Linear Programs
• Termination of linear programs with nonlinear constraints
• Termination analysis of linear loop programs
• A recursive decision method for termination of linear programs
• Witness to non-termination of linear programs

Cited in

(44)

• Termination of single-path polynomial loop programs
• scientific article; zbMATH DE number 7471667 (Why is no real title available?)
• A second-order formulation of non-termination
• On termination of integer linear loops
• On the termination of integer loops
• Proving termination of nonlinear command sequences
• All-Termination(T)
• Model checking linear dynamical systems under floating-point rounding
• Deciding conditional termination
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
• Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
• On invariant checking
• Witness to non-termination of linear programs
• Reflections on termination of linear loops
• scientific article; zbMATH DE number 5704141 (Why is no real title available?)
• Termination analysis of linear loop programs
• Cut elimination for GLS using the terminability of its regress process
• Termination of linear programs with nonlinear constraints
• Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
• What's decidable about discrete linear dynamical systems?
• A recursive decision method for termination of linear programs
• scientific article; zbMATH DE number 7559471 (Why is no real title available?)
• Complexity of Restricted Variants of Skolem and Related Problems
• Computing expected runtimes for constant probability programs
• Recent advances in program verification through computer algebra
• What else is undecidable about loops?
• Termination of linear loops under commutative updates
• Algebraic model checking for discrete linear dynamical systems
• Termination of polynomial loops
• Analyzing ultimate positivity for solvable systems
• 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
• Convergence: integrating termination and abort-freedom
• Termination of Integer Linear Programs
• Discovering non-terminating inputs for multi-path polynomial programs
• scientific article; zbMATH DE number 7561611 (Why is no real title available?)
• Program termination using Z-transform theory
• 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
• Positivity-hardness results on Markov decision processes
• Symbolic decision procedure for termination of linear programs
• Mortality and Edge-to-Edge Reachability are Decidable on Surfaces
• A Perron-Frobenius theorem for deciding matrix growth

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)