Samuel Boutin. Using reAEection to build eOEcient and certied decision procedures. In Theoretical Aspects of Computer Science, number 1281 in Lecture Notes in Computer Science. Springer-Verlag, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....experiment, the presence of a decision procedure for ring equalities has been instrumental, although it has also been quite annoying that this decision procedure was not complete, at least for the version we used. This decision procedure is the Ring tactic, a tactic based on a reAEective approach [4]. The problem of numeric computation also deserves some thoughts. We have performed our proofs with an iaxiomatizedj set of numbers for the coordinates. The axioms we have taken were carefully chosen to make them accurate as a representation of computer numbers used in exact computation. These ....

Samuel Boutin. Using reAEection to build eOEcient and certied decision procedures. In Theoretical Aspects of Computer Science, number 1281 in Lecture Notes in Computer Science. Springer-Verlag, 1997.

....to open terms, in order to be able to prove not only bisimilarity results, but also general bisimilarity laws. To this aim, relevant works include [Ren97] and [Sim85] Finally, the proofs of this paper could be mechanised reusing the work of [Hir97] which could allow one, using reAEection [Bou97], to extract a certied bisimilarity checker. It seems sensible to think, however, that some more work has to be done in order to make these proofs tractable for the purpose of a theorem prover formalisation. Acknowledgements Many thanks go to Michele Boreale for constant help during this study, ....

S. Boutin. Using reAEection to build eOEcient and certied decision procedures. In Martin Abadi and Takahashi Ito, editors, TACS'97, volume 1281. LNCS, Springer-Verlag, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC