Jaco van de Pol

Jaco van de Pol

Auto-generated profile, based on publicly available information

Jaco van de Pol

Aarhus University

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 August 2020
Verified
Book Chapter
Closed access
PDF file
HGHubert Garavel
Hubert Garavel
MBMaurice H. ter Beek
Maurice H. ter Beek
JPJaco van de Pol
Jaco van de Pol

1 January 2010
Verified
Book Chapter
Closed access
PDF file
SBStefan Blom
Stefan Blom
JPJaco van de Pol
Jaco van de Pol
MWMichael Weber
Michael Weber

19 October 2016 in International Journal on Software Tools for Technology Transfer
Verified
Journal Article
Open access
PDF file
TDTom Van Dijk
Tom Van Dijk
JPJaco van de Pol
Jaco van de Pol
Decision diagrams, such as binary decision diagrams, multi-terminal binary decision diagrams and multi-valued decision diagrams, play an important role in various fields. They are especially useful to represent the characteristic function of sets of states and transitions in symbolic model checking. Most implementations of decision diagrams do not parallelize the decision diagram operations. As performance gains in the current era now mostly come from parallel processing, an ongoing challenge is to develop datastructures and algorithms for modern multi-core architectures. The decision diagram package Sylvan provides a contribution by implementing parallelized decision diagram operations and thus allowing sequential algorithms that use decision diagrams to exploit the power of multi-core machines. This paper discusses the design and implementation of Sylvan, especially an improvement to the lock-free unique table that uses bit arrays, the concurrent operation cache and the implementation of parallel garbage collection. We extend Sylvan with multi-terminal binary decision diagrams for integers, real numbers and rational numbers. This extension also allows for custom MTBDD leaves and operations and we provide an example implementation of GMP rational numbers. Furthermore, we show how the provided framework can be integrated in existing tools to provide out-of-the-box parallel BDD algorithms, as well as support for the parallelization of higher-level algorithms. As a case study, we parallelize on-the-fly symbolic reachability in the model checking toolset LTSmin. We experimentally demonstrate that the parallelization of symbolic model checking for explicit-state modeling languages, as supported by LTSmin, scales well. We also show that improvements in the design of the unique table result in faster execution of on-the-fly symbolic reachability.

1 January 2012
Verified
Book Chapter
Closed access
PDF file
SESami Evangelista
Sami Evangelista
ALAlfons Laarman
Alfons Laarman
LPLaure Petrucci
Laure Petrucci
JPJaco van de Pol
Jaco van de Pol

1 February 2009 in Journal of Logic and Computation
Verified
Journal Article
Open access
PDF file
JBJiří Barnat
Jiří Barnat
JCJakub Chaloupka
Jakub Chaloupka
JPJaco Van De Pol
Jaco Van De Pol
We study existing parallel algorithms for the decomposition of a partitioned graph into its strongly connected components (SCCs). In particular, we identify several individual procedures that the algorithms are assembled from and show how to assemble a new and more efficient algorithm, called Recursive OBF (OBFR), to solve the decomposition problem. We also report on a thorough experimental study to evaluate the new algorithm. It shows that it is possible to perform SCC decomposition in parallel efficiently and that OBFR, if properly implemented, is the best choice in most cases.

1 January 2011 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
ALAlfons Laarman
Alfons Laarman
JPJaco van de Pol
Jaco van de Pol
MWMichael Weber
Michael Weber