- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-2787
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
A calculus for modular loop acceleration and non-termination proofs ; volume:24 ; number:5 ; day:7 ; month:10 ; year:2022 ; pages:691-715 ; date:10.2022
International journal on software tools for technology transfer ; 24, Heft 5 (7.10.2022), 691-715, 10.2022
- Creator
-
Frohn, Florian
Fuhs, Carsten
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10009-022-00670-2
- URN
-
urn:nbn:de:101:1-2023012909085112055884
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:21 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
- SpringerLink (Online service)
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