Sciweavers

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

10

FM
1999
Springer

favoriteEmaildiscussreport

88views Formal Methods» more FM 1999»

Refinement Semantics and Loop Rules

13 years 9 months ago

Refinement Semantics and Loop Rules

Download www.cs.toronto.edu

Refinement semantics is an alternative to least fixpoint semantics that is more useful for programming. From it we derive a variety of rules for w h i l e-loops, for-loops, and loops with intermediate and deep exits. We illustrate the use of these rules with examples. © Springer-Verlag 1999. to appear in LNCS for FM'99

Eric C. R. Hehner, Andrew M. Gravell

Real-time Traffic

Deep Exits | Fixpoint Semantics | FM 1999 | Formal Methods | Refinement Semantics |

claim paper

Related Content

» Adjusted Verification Rules for Loops Are More Complete and Give Better Diagnostics for Le...

» Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs

» Towards Instant Automatic Model Refinement Based on OCL

» OntologyBased Policy Refinement Using SWRL Rules for Management Information Definitions in...

» RuleBased Modelling Symmetries Refinements

» Patterns and Rules for Behavioural Subtyping

» Object Flow Definition for Refined Activity Diagrams

» Knowledge Refinement Using Fuzzy Compositional Neural Networks

» Specification and Refinement of Finite Dataflow Networks a Relational Approach

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	FM
Authors	Eric C. R. Hehner, Andrew M. Gravell

Comments (0)