Sciweavers

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

24

AMAST
2004
Springer

favoriteEmaildiscussreport

85views Software Engineering» more AMAST 2004»

Model-Checking Systems with Unbounded Variables without Abstraction

14 years 4 months ago

Model-Checking Systems with Unbounded Variables without Abstraction

Download users-tima.imag.fr

Magali Contensin, Laurence Pierre

Real-time Traffic

AMAST 2004 | Software Engineering |

claim paper

Related Content

» Approximate Model Checking of PCTL Involving Unbounded Path Properties

» An Automatic RealTime Analysis of the Time to Reach Consensus

» On Model Checking DataIndependent Systems with Arrays with WholeArray Operations

» Boom Taking Boolean Program Model Checking One Step Further

» Model Checking of Linearizability of Concurrent List Implementations

» Model checking transactional memories

» WordLevel Sequential Memory Abstraction for Model Checking

» Global ModelChecking of InfiniteState Systems

» Applications of Craig Interpolants in Model Checking

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	AMAST
Authors	Magali Contensin, Laurence Pierre

Comments (0)