Computer Aided Verification
From MaRDI portal
Publication:5312946
DOI10.1007/b98490zbMath1103.68037OpenAlexW4298302743MaRDI QIDQ5312946
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
Related Items
On the Termination of Integer Loops, Reflections on termination of linear loops, Termination of Single-Path Polynomial Loop Programs, Convergence: integrating termination and abort-freedom, Recent advances in program verification through computer algebra, Termination of linear programs with nonlinear constraints, Generating exact nonlinear ranking functions by symbolic-numeric hybrid method, On invariant checking, 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, Analyzing ultimate positivity for solvable systems, What else is undecidable about loops?, Unnamed Item, Proving termination of nonlinear command sequences, Termination of polynomial loops, A Perron-Frobenius theorem for deciding matrix growth, Symbolic decision procedure for termination of linear programs, A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs, Unnamed Item, Unnamed Item, All-Termination(T), Computing expected runtimes for constant probability programs, Complexity of Restricted Variants of Skolem and Related Problems, O-Minimal Invariants for Discrete-Time Dynamical Systems, Discovering non-terminating inputs for multi-path polynomial programs, 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, A second-order formulation of non-termination, Witness to non-termination of linear programs
