Proving the correctness of a code generator specification using term rewriting techniques
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
87 S.
- Language
-
Englisch
- Bibliographic citation
-
Bericht / Christian-Albrechts-Universität zu Kiel ; Nr. 8719
- Event
-
Veröffentlichung
- (where)
-
Kiel
- (who)
-
Inst. für Informatik u. Prakt. Mathematik
- (when)
-
1987
- Creator
-
Buth, Karl-Heinz
Wenzel, Bettina
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:22 PM CEST
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
- Buth, Karl-Heinz
- Wenzel, Bettina
- Inst. für Informatik u. Prakt. Mathematik
Time of origin
- 1987
Other Objects (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