- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
II, 211 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Zugl.: Aachen, Techn. Hochsch., Diss. 2007
- Erschienen in
-
Aachener Informatik-Berichte ; 2007,17
- Schlagwort
-
Termersetzungssystem
Terminierung
Automatisches Beweisverfahren
Terminierung ; Termersetzungssystem ; Verifikation
- URN
-
urn:nbn:de:hbz:82-opus-20666
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:20 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Thiemann, René
- RWTH Aachen
Entstanden
- 2007
Ähnliche Objekte (12)
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Proving and disproving termination in the dependency pair framework
Termination Proofs of Rewriting Systems
A Dependency Pair Framework for Relative Termination of Term Rewriting
Proving Termination of C Programs with Lists
On termination of single pushout graph rewriting
Proving termination of probabilistic recursive programs via SMT-solving
Termination proofs and derivation lengths in term rewriting systems
Termination of cycle rewriting by transformation and matrix interpretation
Proving termination of pointer programs on top of symbolic execution
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving the correctness of a code generator specification using term rewriting techniques
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Proving and disproving termination in the dependency pair framework
Termination Proofs of Rewriting Systems
A Dependency Pair Framework for Relative Termination of Term Rewriting
Proving Termination of C Programs with Lists
On termination of single pushout graph rewriting
Proving termination of probabilistic recursive programs via SMT-solving
Termination proofs and derivation lengths in term rewriting systems
Termination of cycle rewriting by transformation and matrix interpretation
Proving termination of pointer programs on top of symbolic execution
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving the correctness of a code generator specification using term rewriting techniques
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Proving and disproving termination in the dependency pair framework
Termination Proofs of Rewriting Systems
A Dependency Pair Framework for Relative Termination of Term Rewriting
Proving Termination of C Programs with Lists
On termination of single pushout graph rewriting
Proving termination of probabilistic recursive programs via SMT-solving
Termination proofs and derivation lengths in term rewriting systems
Termination of cycle rewriting by transformation and matrix interpretation
Proving termination of pointer programs on top of symbolic execution
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)