Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

90

SEFM
2005
IEEE

106views Software Engineering» more SEFM 2005»

Customised Induction Rules for Proving Correctness of Imperative Programs

15 years 8 months ago

Customised Induction Rules for Proving Correctness of Imperative Programs

Download i12www.ira.uka.de

Ola Olsson, Angela Wallenburg

Real-time Traffic

SEFM 2005 | Software Engineering |

claim paper

Related Content

» Using a Software Testing Technique to Improve Theorem Proving

» A Case Study on Proving Transformations Correct DataParallel Conversion

» Constructing Induction Rules for Deductive Synthesis Proofs

» Deaccumulation techniques for improving provability

» Recursive proofs for inductive tree datastructures

» Embedding a logical theory of constructions in Agda

» Hoare Logic for Mutual Recursion and Local Variables

» Construction of a Semantic Model for a Typed Assembly Language

» Simultaneous Checking of Completeness and Ground Confluence

Post Info
More Details (n/a)

Added	25 Jun 2010
Updated	25 Jun 2010
Type	Conference
Year	2005
Where	SEFM
Authors	Ola Olsson, Angela Wallenburg

Comments (0)