Sciweavers

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

73

Voted

ICTAC
2010
Springer

favoriteEmaildiscussreport

203views Applied Computing» more ICTAC 2010»

Invariants and Well-Foundedness in Program Algebra

14 years 6 months ago

Invariants and Well-Foundedness in Program Algebra

Download www.fmeurope.org

Ian J. Hayes

Real-time Traffic

Applied Computing | ICTAC 2010 |

claim paper

Related Content

» Generating Polynomial Invariants with DISCOVERER and QEPCAD

» Minimax rates for homology inference

» ABC Algebraic Bound Computation for Loops

» Automatic generation of polynomial loop

» Dynamic optimization for functional reactive programming using generalized algebraic data ...

» Automatic invariant generation for hybrid systems using ideal fixed points

» Concurrent Kleene Algebra

» Deciding Boolean Algebra with Presburger Arithmetic

» An Operational Domaintheoretic Treatment of Recursive Types

Post Info
More Details (n/a)

Added	04 Mar 2011
Updated	04 Mar 2011
Type	Journal
Year	2010
Where	ICTAC
Authors	Ian J. Hayes

Comments (0)