paper.pdf (434.1 kB)
Download file

Fairness for Infinite-State Systems

Download (434.1 kB)
conference contribution
posted on 08.04.2015, 09:51 by B. Cook, H. Khlaaf, Nir Piterman
In this paper we introduce the first known tool for symbolically proving fair-CTL properties of (infinite-state) integer programs. Our solution is based on a reduction to existing techniques for fairness- free CTL model checking via the use of infinite non-deterministic branching to symbolically partition fair from unfair executions. We show the viability of our approach in practice using examples drawn from device drivers and algorithms utilizing shared resources.

History

Citation

Tools and Algorithms for the Construction and Analysis of Systems Lecture Notes in Computer Science Volume 9035, 2015, pp 384-398

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Source

21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, London, UK

Version

AM (Accepted Manuscript)

Published in

Tools and Algorithms for the Construction and Analysis of Systems Lecture Notes in Computer Science Volume 9035

Publisher

Springer

issn

0302-9743

isbn

978-3-662-46680-3;978-3-662-46681-0

Copyright date

1007

Available date

18/04/2016

Publisher version

http://link.springer.com/chapter/10.1007/978-3-662-46681-0_30

Notes

See also Research Note RN/14/11 UCL Department of Computer Science.

Editors

Baier, C.;Tinelli , C.

Book series

Lecture Notes in Computer Science;9035

Temporal coverage: start date

11/04/2015

Temporal coverage: end date

18/04/2015

Language

en

Usage metrics

Categories

Keywords

Exports