Proving the correctness of a code generator specification using term rewriting techniques
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
87 S.
- Sprache
-
Englisch
- Erschienen in
-
Bericht / Christian-Albrechts-Universität zu Kiel ; Nr. 8719
- Ereignis
-
Veröffentlichung
- (wo)
-
Kiel
- (wer)
-
Inst. für Informatik u. Prakt. Mathematik
- (wann)
-
1987
- Urheber
-
Buth, Karl-Heinz
Wenzel, Bettina
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:22 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
- Buth, Karl-Heinz
- Wenzel, Bettina
- Inst. für Informatik u. Prakt. Mathematik
Entstanden
- 1987
Ähnliche Objekte (12)
Models for software verification: Proving program correctness
Proving the Correctness of GNAT Light Runtime Library
The DP framework for proving termination of term rewriting
Proving the correctness of algebraic implementations by the ISAR system
Proving correctness of graph programs relative to recursively nested conditions
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Address spaces and virtual memory : specification, implementation, and correctness
Integration of rewriting, narrowing, compilation, and heuristics for equality reasoning in resolution-based theorem proving
Integration of Rewriting, Narrowing, Compilation, and Heuristics for Equality Reasoning in Resolution-Based Theorem Proving
A WAM extension for type constraint logic programming : specification and correctness proof
Models for software verification: Proving program correctness
Proving the Correctness of GNAT Light Runtime Library
The DP framework for proving termination of term rewriting
Proving the correctness of algebraic implementations by the ISAR system
Proving correctness of graph programs relative to recursively nested conditions
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Address spaces and virtual memory : specification, implementation, and correctness
Integration of rewriting, narrowing, compilation, and heuristics for equality reasoning in resolution-based theorem proving
Integration of Rewriting, Narrowing, Compilation, and Heuristics for Equality Reasoning in Resolution-Based Theorem Proving
A WAM extension for type constraint logic programming : specification and correctness proof
Models for software verification: Proving program correctness
Proving the Correctness of GNAT Light Runtime Library
The DP framework for proving termination of term rewriting
Proving the correctness of algebraic implementations by the ISAR system
Proving correctness of graph programs relative to recursively nested conditions
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Address spaces and virtual memory : specification, implementation, and correctness
Integration of rewriting, narrowing, compilation, and heuristics for equality reasoning in resolution-based theorem proving
Integration of Rewriting, Narrowing, Compilation, and Heuristics for Equality Reasoning in Resolution-Based Theorem Proving