By Topic

Using metrics for proof rules for recursively defined delay-insensitive specifications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mallon, W.C. ; Dept. of Comput. Sci., Groningen Univ., Netherlands ; Udding, J.T.

An advantage of algebraic specifications of delay insensitive asynchronous processes over most other formalisms is that it allows the recursive definition of processes, and correctness proofs of an implementation through fixpoint induction. On the other hand, proofs by fixpoint induction are intrinsically hard to design and read, which led us to use a much more palatable proof style, using so-called linear proofs and induction. Until now, the intuitive induction rule has never been formalized, and formalizing it, as we do in this paper shows that extreme care has to be taken to phrase the proof rule that is being used. Fortunately, the rules that we derive in this paper validate the proofs that used the intuitive notion, and its formulation is such that it can easily be included in theorem provers and other tools

Published in:

Advanced Research in Asynchronous Circuits and Systems, 1997. Proceedings., Third International Symposium on

Date of Conference:

7-10 Apr 1997