Heuristics for Checking Liveness Properties with Partial Order Reductions

Authors

Alexandre Duret-Lutz, Fabrice Kordon, Denis Poitrenaud, Etienne Renault

Where

Proceedings of the 14th International Symposium on Automated Technology for Verification and Analysis (ATVA'16)

Type

inproceedings

Publisher

Springer

Projects

Spot

Date

2016-10-01

Abstract

Checking liveness properties with partial-order reductions requires a cycle proviso to ensure that an action cannot be postponed forever. The proviso forces each cycle to contain at least one fully expanded state. We present new heuristics to select which state to expand, hoping to reduce the size of the resulting graph. The choice of the state to expand is done when encountering a dangerous edge. Almost all existing provisos expand the source of this edge, while this paper also explores the expansion of the destination and the use of SCC-based information.

Bibtex (lrde.bib)

@InProceedings{	  duret.16.atva,
  author	= {Alexandre Duret-Lutz and Fabrice Kordon and Denis
		  Poitrenaud and Etienne Renault},
  title		= {Heuristics for Checking Liveness Properties with Partial
		  Order Reductions},
  booktitle	= {Proceedings of the 14th International Symposium on
		  Automated Technology for Verification and Analysis
		  (ATVA'16)},
  series	= {Lecture Notes in Computer Science},
  publisher	= {Springer},
  volume	= {????},
  pages		= {??--??},
  year		= {2016},
  month		= oct,
  abstract	= {Checking liveness properties with partial-order reductions
		  requires a cycle proviso to ensure that an action cannot be
		  postponed forever. The proviso forces each cycle to contain
		  at least one fully expanded state. We present new
		  heuristics to select which state to expand, hoping to
		  reduce the size of the resulting graph. The choice of the
		  state to expand is done when encountering a
		  \emph{dangerous} edge. Almost all existing provisos expand
		  the source of this edge, while this paper also explores the
		  expansion of the destination and the use of SCC-based
		  information.},
  note		= {To appear.}
}

@InProceedings{	  duret.16.atva2,
  author	= {Alexandre Duret-Lutz and Alexandre Lewkowicz and Amaury
		  Fauchille and Thibaud Michaud and Etienne Renault and
		  Laurent Xu},
  title		= {Spot 2.0 --- a framework for {LTL} and $\omega$-automata
		  manipulation},
  booktitle	= {Proceedings of the 14th International Symposium on
		  Automated Technology for Verification and Analysis
		  (ATVA'16)},
  series	= {Lecture Notes in Computer Science},
  publisher	= {Springer},
  volume	= {????},
  pages		= {??--??},
  year		= {2016},
  month		= oct,
  pdf		= {adl/duret.16.atva2.pdf},
  abstract	= {We present Spot 2.0, a C++ library with Python bindings
		  and an assortment of command-line tools designed to
		  manipulate LTL and $\omega$-automata in batch. New
		  automata-manipulation tools were introduced in Spot 2.0;
		  they support arbitrary acceptance conditions, as
		  expressible in the Hanoi Omega Automaton format. Besides
		  being useful to researchers who have automata to process,
		  its Python bindings can also be used in interactive
		  environments to teach $\omega$-automata and model checking.},
  note		= {To appear.}
}