- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: 10.1007/s10009-022-00670-2
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2022
- Creator
-
Frohn, Florian
Fuhs, Carsten
- DOI
-
10.18154/RWTH-2022-09952
- URN
-
urn:nbn:de:101:1-2022111900395208520649
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:28 AM 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.
Associated
- Frohn, Florian
- Fuhs, Carsten
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2022
Other Objects (12)
A calculus for modular loop acceleration and non-termination proofs
Automated termination proofs
Termination proofs for logic programs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination Proofs of Rewriting Systems
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
Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification
Automating recursive definitions and termination proofs in higher-order logic
Termination proofs for a lazy functional language by abstract reduction : (draft)
A calculus for modular loop acceleration and non-termination proofs
Automated termination proofs
Termination proofs for logic programs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination Proofs of Rewriting Systems
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
Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification
Automating recursive definitions and termination proofs in higher-order logic
Termination proofs for a lazy functional language by abstract reduction : (draft)
A calculus for modular loop acceleration and non-termination proofs
Automated termination proofs
Termination proofs for logic programs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination Proofs of Rewriting Systems
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
Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification
Automating recursive definitions and termination proofs in higher-order logic