Date: 2004-11-10 11:53:13Software engineering Formal methods Theoretical computer science Automated theorem proving Computing Loop invariant Mathematical proof Rippling Extended static checking Recurrence relation Automated reasoning Invariant | | Automation for Exception Freedom Proofs Bill J. Ellis and Andrew Ireland School of Mathematical & Computer Sciences Heriot-Watt University Edinburgh, Scotland, UK Add to Reading ListSource URL: www.macs.hw.ac.ukDownload Document from Source Website File Size: 71,90 KBShare Document on Facebook
|