Sciweavers

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

13

FM
2009
Springer

favoriteEmaildiscussreport

90views Formal Methods» more FM 2009»

Fair Model Checking with Process Counter Abstraction

14 years 1 months ago

Fair Model Checking with Process Counter Abstraction

Download www.comp.nus.edu.sg

Jun Sun 0001, Yang Liu 0003, Abhik Roychoudhury, S

Real-time Traffic

FM 2009 | Natural Language Processing |

claim paper

Related Content

» Model Checking FOR over OneCounter Processes and beyond

» On the Computational Complexity of Verifying OneCounter Processes

» Model Checking Freeze LTL over OneCounter Automata

» Boom Taking Boolean Program Model Checking One Step Further

» Programs with Lists Are Counter Automata

» Generating CounterExamples Through Randomized Guided Search

» PLTL Partitioned Model Checking for Reactive Systems under Fairness Assumptions

» Transition predicate abstraction and fair termination

» A Dash of Fairness for Compositional Reasoning

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	FM
Authors	Jun Sun 0001, Yang Liu 0003, Abhik Roychoudhury, Shanshan Liu, Jin Song Dong

Comments (0)