Encoding induction in correctness proofs of program transformations as a termination problem
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: 12th International Workshop on Termination (WST 2012) : WST 2012, February 19–23, 2012, Obergurgl, Austria / edited by Georg Moser Termination (WST 2012) ; Innsbruck : University of Innsbruck, Institute of Computer Science, 2012, S. 74-78
- Event
-
Veröffentlichung
- (where)
-
Frankfurt am Main
- (who)
-
Universitätsbibliothek Johann Christian Senckenberg
- (when)
-
2012
- Creator
-
Rau, Conrad
Sabel, David
Schmidt-Schauß, Manfred
- URN
-
urn:nbn:de:hebis:30:3-269979
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:54 PM CET
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
- Rau, Conrad
- Sabel, David
- Schmidt-Schauß, Manfred
- Universitätsbibliothek Johann Christian Senckenberg
Time of origin
- 2012
Other Objects (12)
Automated termination proofs
Generic induction proofs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination proofs for logic programs
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
Contributions to mechanical proofs of correctness for compiler front ends
Automating recursive definitions and termination proofs in higher-order logic
A calculus for modular loop acceleration and non-termination proofs
Automated termination proofs
Generic induction proofs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination proofs for logic programs
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
Contributions to mechanical proofs of correctness for compiler front ends
Automating recursive definitions and termination proofs in higher-order logic
A calculus for modular loop acceleration and non-termination proofs
Automated termination proofs
Generic induction proofs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination proofs for logic programs
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
Contributions to mechanical proofs of correctness for compiler front ends
Automating recursive definitions and termination proofs in higher-order logic