- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 10.1007/978-3-031-63498-7_21
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2024
- Urheber
- DOI
-
10.18154/RWTH-2024-08715
- URN
-
urn:nbn:de:101:1-2409220136273.092987744701
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:36 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
- Giesl, Jürgen
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2024
Ähnliche Objekte (12)
Mechanized verification of imperative and functional programs
Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen
Term rewriting and applications : 16th international conference ; proceedings
Automated reasoning : 5th international joint conference ; proceedings
Proving Termination of C Programs with Lists
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
Termination of Triangular Integer Loops is Decidable
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs
Development of a library to analyze Python code used in ACE editor
Mechanized verification of imperative and functional programs
Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen
Term rewriting and applications : 16th international conference ; proceedings
Automated reasoning : 5th international joint conference ; proceedings
Proving Termination of C Programs with Lists
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
Termination of Triangular Integer Loops is Decidable
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs
Development of a library to analyze Python code used in ACE editor
Mechanized verification of imperative and functional programs
Automatisierung von Terminierungsbeweisen für rekursiv definierte Algorithmen
Term rewriting and applications : 16th international conference ; proceedings
Automated reasoning : 5th international joint conference ; proceedings
Proving Termination of C Programs with Lists
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
Termination of Triangular Integer Loops is Decidable
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
Towards complete methods for automatic complexity and termination analysis of (probabilistic) programs