Proving termination of nonlinear command sequences
type: Item
instance of: scholarly article
title: Proving termination of nonlinear command sequences
zbMATH Open document ID: 1298.68164
author: Domagoj Babić
author: Byron Cook
author: Alan J. Hu
author: Zvonimir Rakamarić
published in: Formal Aspects of Computing
publication date: 2014-11-11T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N30
zbMATH DE Number: 6368385
zbMATH Keywords: program termination
zbMATH Keywords: nonlinear assignments
zbMATH Keywords: divergence testing
zbMATH Keywords: well-foundedness provers
describes a project that uses: Maple
describes a project that uses: AProVE
describes a project that uses: CiME
MaRDI profile type: Publication
full work available at URL: s00165-012-0252-5
OpenAlex ID: W1997553387
cites work: Programs with Lists Are Counter Automata
cites work: Variance analyses from invariance analyses
cites work: Verification, Model Checking, and Abstract Interpretation
cites work: Automata, Languages and Programming
cites work: CONCUR 2005 – Concurrency Theory
cites work: Factoring polynomials with rational coefficients
cites work: An axiomatic basis for computer programming
cites work: Static Analysis
cites work: Q4804915
cites work: A semantic basis for the termination analysis of logic programs
cites work: Q4421936
cites work: Q5584402
cites work: The size-change principle for program termination
cites work: Arithmetic Strengthening for Shape Analysis
cites work: Computer Aided Verification
DOI: 10.1007/S00165-012-0252-5
description: scientific article; zbMATH DE number 6368385