- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
III, 143 S.
- Language
-
Deutsch
- Notes
-
Zugl.: Karlsruhe, Univ., Habil.-Schr., 1990
- Bibliographic citation
-
Interner Bericht / Universität Karlsruhe (TH) ; 88,17
- Event
-
Veröffentlichung
- (where)
-
Karlsruhe
- (who)
-
Univ., Fak. für Informatik
- (when)
-
1988
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:22 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Walther, Christoph
- Univ., Fak. für Informatik
Time of origin
- 1988
Other Objects (12)
Termination proofs for logic programs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination Proofs of Rewriting Systems
Automating recursive definitions and termination proofs in higher-order logic
A Region Graph Based Approach to Termination Proofs
A region graph based approach to termination proofs
Termination proofs and derivation lengths in term rewriting systems
Automated methods for formal proofs in simple arithmetics and algebra
A calculus for modular loop acceleration and non-termination proofs
A calculus for modular loop acceleration and non-termination proofs
Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification
Termination proofs for logic programs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination Proofs of Rewriting Systems
Automating recursive definitions and termination proofs in higher-order logic
A Region Graph Based Approach to Termination Proofs
A region graph based approach to termination proofs
Termination proofs and derivation lengths in term rewriting systems
Automated methods for formal proofs in simple arithmetics and algebra
A calculus for modular loop acceleration and non-termination proofs
A calculus for modular loop acceleration and non-termination proofs
Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification
Termination proofs for logic programs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination Proofs of Rewriting Systems
Automating recursive definitions and termination proofs in higher-order logic
A Region Graph Based Approach to Termination Proofs
A region graph based approach to termination proofs
Termination proofs and derivation lengths in term rewriting systems
Automated methods for formal proofs in simple arithmetics and algebra
A calculus for modular loop acceleration and non-termination proofs
A calculus for modular loop acceleration and non-termination proofs