Contribution to Goodenough's and Gerhart's theory of software testing and verification: Relation between strong compiler test and compiler implementation verification

H Langmaack - Foundations of Computer Science: Potential—Theory …, 2006 - Springer
In view of JB Goodenough's and SL Gerhart's theory compiler πtS shows up to be a very well
selected test datum to do translator implementation verification for πT supported by testing. A …

[PDF][PDF] Proving Preservation of Partial Correctness with ACL2: A Mechanical Compiler Source Level Correctness Proof

W Goerigk - Proc. of the ACL2'2000 Workshop, Austin, Texas, USA, 2000 - cs.utexas.edu
§ Background, Three Steps to Correct Realistic Compilation § Source Level Verification is
not Sufficient § Correct Implementation, Preservation of Partial Correctness § Source and …

A single complete refinement rule for Z

J Derrick - Journal of Logic and Computation, 2000 - ieeexplore.ieee.org
Data refinements is a well established technique for transforming specifications of abstract
data types into ones which are closer to an eventual implementation. The conditions under …

The asynchronous stack revisited: Rounds set the twilight reeling

R Walter - Foundations of Computer Science: Potential—Theory …, 2006 - Springer
Protocols return often to a particular state—no matter what happens. We call such a state a
ground state. Each action which occurs in the ground state starts a so called round. A round …

Specifying component and context specification using Promotion

J Derrick, E Boiten - IFM'99: Proceedings of the 1st International …, 1999 - Springer
In this paper we discuss how the specification of components may be separated from the
description of the context in which they are used. There are a number of ways in which this …

[ЦИТИРОВАНИЕ][C] INSTITUT FUR INFORMATIK UND PRAKTISCHE MATHEMATIK

C Petersohn - 1997