- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1433-2787
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Urheber
-
Frohn, Florian
Fuhs, Carsten
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10009-022-00670-2
- URN
-
urn:nbn:de:101:1-2023012909085112055884
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:21 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.
Beteiligte
- Frohn, Florian
- Fuhs, Carsten
- SpringerLink (Online service)
Ähnliche Objekte (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