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.
CitationTools 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
Source21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, London, UK
VersionAM (Accepted Manuscript)
Published inTools and Algorithms for the Construction and Analysis of Systems Lecture Notes in Computer Science Volume 9035
NotesSee also Research Note RN/14/11 UCL Department of Computer Science.
EditorsBaier, C.;Tinelli , C.
Book seriesLecture Notes in Computer Science;9035
Temporal coverage: start date11/04/2015
Temporal coverage: end date18/04/2015