Automata-Based Termination Proofs (Q3637353)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Automata-Based Termination Proofs	scientific article

Statements

scholarly article

0 references

Automata-Based Termination Proofs (English)

0 references

0 references

Adam Rogalewicz

0 references

Implementation and Application of Automata

0 references

publication date

9 July 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-02979-0_20

0 references

Variance analyses from invariance analyses

0 references

Programs with Lists Are Counter Automata

0 references

0 references

Abstract Regular Tree Model Checking of Complex Dynamic Data Structures

0 references

Flat Parametric Counter Automata

0 references

Verification, Model Checking, and Abstract Interpretation

0 references

0 references

Static Analysis

0 references

0 references

Automatic Termination Proofs for Programs with Shape-Shifting Heaps

0 references

0 references

Proving Termination of Tree Manipulating Programs

0 references

Verifying properties of well-founded linked lists

0 references

Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm

0 references

Transition Invariants and Transition Predicate Abstraction for Program Termination

0 references

The Büchi Complementation Saga

0 references

The size-change principle for program termination

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-02979-0_20

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3637353

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3637353&oldid=35117357"