A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
This paper describes a uniform approach to the automation of verification tasks associated with while statements, representation functions for abstract data types, generic program units and abstract base classes. Program units are annotated with equations containing symbols defined by algebraic axioms. An operation's axioms are developed using strategies that guarantee crucial properties such as convergence and sufficient completeness. Sets of axioms are developed by stepwise extensions thatdoi:10.1109/32.277574 fatcat:qpth2drexbbwzhizdg6plpakdy