Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 10.1007/978-3-031-10769-6_41
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2022
- Urheber
- DOI
-
10.18154/RWTH-2022-08509
- URN
-
urn:nbn:de:101:1-2022091001341184843257
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.0001, 04:37 MEZ
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
- 2022
Ähnliche Objekte (12)
Inferring Lower Bounds for Runtime Complexity
Simplified drift analysis for proving lower bounds in evolutionary computation
Proving Termination of C Programs with Lists
Proving the Correctness of GNAT Light Runtime Library
Proving termination of probabilistic recursive programs via SMT-solving
Proving and disproving termination in the dependency pair framework
The DP framework for proving termination of term rewriting
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving termination of pointer programs on top of symbolic execution
Runtime bounds prediction for the Kemeny problem
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Proving bounds for real linear programs in Isabelle, HOL : (extended abstract)
Inferring Lower Bounds for Runtime Complexity
Simplified drift analysis for proving lower bounds in evolutionary computation
Proving Termination of C Programs with Lists
Proving the Correctness of GNAT Light Runtime Library
Proving termination of probabilistic recursive programs via SMT-solving
Proving and disproving termination in the dependency pair framework
The DP framework for proving termination of term rewriting
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving termination of pointer programs on top of symbolic execution
Runtime bounds prediction for the Kemeny problem
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Proving bounds for real linear programs in Isabelle, HOL : (extended abstract)
Inferring Lower Bounds for Runtime Complexity
Simplified drift analysis for proving lower bounds in evolutionary computation
Proving Termination of C Programs with Lists
Proving the Correctness of GNAT Light Runtime Library
Proving termination of probabilistic recursive programs via SMT-solving
Proving and disproving termination in the dependency pair framework
The DP framework for proving termination of term rewriting
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Proving termination of pointer programs on top of symbolic execution
Runtime bounds prediction for the Kemeny problem
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs