default search action
Jaco van de Pol
Person information
- affiliation: Aarhus University, Department of Computer Science, Aarhus, Denmark
- affiliation: University of Twente, Enschede, Netherlands
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j40]Thomas Neele, Jaco van de Pol:
Operations on Fixpoint Equation Systems. Log. Methods Comput. Sci. 20(3) (2024) - [c138]Irfansha Shaik, Jaco van de Pol:
Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation. ECAI 2024: 4207-4215 - [c137]Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits. SAT 2024: 26:1-26:18 - [c136]Steffan Christ Sølvsten, Casper Moldrup Rysgaard, Jaco van de Pol:
Random Access on Narrow Decision Diagrams in External Memory. SPIN 2024: 137-145 - [c135]Anna Blume Jakobsen, Rasmus Skibdahl Melanchton Jørgensen, Jaco van de Pol, Andreas Pavlogiannis:
Fast Symbolic Computation of Bottom SCCs. TACAS (3) 2024: 110-128 - [c134]Mikael Bisgaard Dahlsen-Jensen, Baptiste Fievet, Laure Petrucci, Jaco van de Pol:
On-The-Fly Algorithm for Reachability in Parametric Timed Games. TACAS (3) 2024: 194-212 - [i23]Mikael Bisgaard Dahlsen-Jensen, Baptiste Fievet, Laure Petrucci, Jaco van de Pol:
On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version). CoRR abs/2401.11287 (2024) - [i22]Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits. CoRR abs/2403.11598 (2024) - [i21]Irfansha Shaik, Jaco van de Pol:
Optimal Layout-Aware CNOT Circuit Synthesis with Qubit Permutation. CoRR abs/2408.04349 (2024) - [i20]Steffan Christ Sølvsten, Jaco van de Pol:
Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper). CoRR abs/2408.14216 (2024) - 2023
- [j39]Magnus Madsen, Jaco van de Pol, Troels Henriksen:
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems. Proc. ACM Program. Lang. 7(OOPSLA2): 516-543 (2023) - [j38]Mario Gleirscher, Jaco van de Pol, Jim Woodcock:
A manifesto for applicable formal methods. Softw. Syst. Model. 22(6): 1737-1749 (2023) - [c133]Irfansha Shaik, Valentin Mayer-Eichberger, Jaco van de Pol, Abdallah Saffidine:
Implicit QBF Encodings for Positional Games. ACG 2023: 133-145 - [c132]Steffan Christ Sølvsten, Jaco van de Pol:
Predicting Memory Demands of BDD Operations Using Maximum Graph Cuts. ATVA 2023: 72-92 - [c131]Magnus Madsen, Jaco van de Pol:
Programming with Purity Reflection: Peaceful Coexistence of Effects, Laziness, and Parallelism. ECOOP 2023: 18:1-18:27 - [c130]Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Quantum Circuits as Classical Planning. ICCAD 2023: 1-9 - [c129]Steffan Christ Sølvsten, Jaco van de Pol:
Adiar 1.1 - Zero-Suppressed Decision Diagrams in External Memory. NFM 2023: 464-471 - [c128]Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol:
Validation of QBF Encodings with Winning Strategies. SAT 2023: 24:1-24:10 - [c127]Casper Abild Larsen, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol, Andreas Pavlogiannis:
A Truly Symbolic Linear-Time Algorithm for SCC Decomposition. TACAS (2) 2023: 353-371 - [d11]Mikael Bisgaard Dahlsen-Jensen, Jaco van de Pol, Laure Petrucci, Baptiste Fievet:
Artifact for "On-The-Fly Algorithm for Reachability in Parametric Timed Games". Zenodo, 2023 - [d10]Maximilian Heisinger, Irfansha Shaik, Martina Seidl, Jaco van de Pol:
Artifact for Paper Search-Space Pruning with Int-Splits for Faster QBF Solving. Zenodo, 2023 - [d9]Magnus Madsen, Jaco van de Pol, Troels Henriksen:
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems (artifact). Zenodo, 2023 - [d8]Magnus Madsen, Jaco van de Pol, Troels Henriksen:
Fast and Efficient Boolean Unification for Hindley-Milner-Style Type and Effect Systems (artifact). Zenodo, 2023 - [d7]Steffan Christ Sølvsten, Jaco van de Pol:
Adiar 1.1.0 : Experiment Data. Zenodo, 2023 - [d6]Steffan Christ Sølvsten, Jaco van de Pol:
Adiar 1.2.0 : Experiment Data. Zenodo, 2023 - [i19]Irfansha Shaik, Valentin Mayer-Eichberger, Jaco van de Pol, Abdallah Saffidine:
Implicit State and Goals in QBF Encodings for Positional Games (extended version). CoRR abs/2301.07345 (2023) - [i18]Irfansha Shaik, Jaco van de Pol:
Concise QBF Encodings for Games on a Grid (extended version). CoRR abs/2303.16949 (2023) - [i17]Thomas Neele, Jaco van de Pol:
Operations on Fixpoint Equation Systems. CoRR abs/2304.07162 (2023) - [i16]Maximilian Heisinger, Irfansha Shaik, Martina Seidl, Jaco van de Pol:
Search-Space Pruning with Int-Splits for Faster QBF Solving. CoRR abs/2304.08308 (2023) - [i15]Irfansha Shaik, Jaco van de Pol:
Optimal Layout Synthesis for Quantum Circuits as Classical Planning. CoRR abs/2304.12014 (2023) - [i14]Steffan Christ Sølvsten, Jaco van de Pol:
Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper). CoRR abs/2307.04488 (2023) - 2022
- [j37]Vincent Bloemen, Sebastiaan J. van Zelst, Wil M. P. van der Aalst, Boudewijn F. van Dongen, Jaco van de Pol:
Aligning observed and modelled behaviour by maximizing synchronous moves and using milestones. Inf. Syst. 103: 101456 (2022) - [j36]Simon Thrane Hansen, Casper Thule, Cláudio Gomes, Jaco van de Pol, Maurizio Palmieri, Emin Oguz Inci, Frederik Palludan Madsen, Jesus Alfonso, José Ángel Castellanos, José Manuel Rodriguez-Fortun:
Verification and synthesis of co-simulation algorithms subject to algebraic loops and adaptive steps. Int. J. Softw. Tools Technol. Transf. 24(6): 999-1024 (2022) - [c126]Irfansha Shaik, Jaco van de Pol:
Classical Planning as QBF without Grounding. ICAPS 2022: 329-337 - [c125]Étienne André, Dylan Marinho, Laure Petrucci, Jaco van de Pol:
Efficient Convex Zone Merging in Parametric Timed Automata. FORMATS 2022: 200-218 - [c124]Monika Seisenberger, Maurice H. ter Beek, Xiuyi Fan, Alessio Ferrari, Anne E. Haxthausen, Phillip James, Andrew Lawrence, Bas Luttik, Jaco van de Pol, Simon Wimmer:
Safe and Secure Future AI-Driven Railway Technologies: Challenges for Formal Methods in Railway. ISoLA (4) 2022: 246-268 - [c123]Jaco van de Pol:
Exploring a Parallel SCC Algorithm. ISoLA (1) 2022: 535-555 - [c122]Steffan Christ Sølvsten, Jaco van de Pol, Anna Blume Jakobsen, Mathias Weller Berg Thomasen:
Adiar Binary Decision Diagrams in External Memory. TACAS (2) 2022: 295-313 - [d5]Étienne André, Dylan Marinho, Laure Petrucci, Jaco van de Pol:
Data for paper "Efficient Convex Zone Merging in Parametric Timed Automata". Zenodo, 2022 - [d4]Irfansha Shaik, Jaco van de Pol:
Code, Benchmarks, Data from the ICAPS 2022 paper "Classical Planning as QBF without Grounding". Zenodo, 2022 - [i13]Étienne André, Dylan Marinho, Laure Petrucci, Jaco van de Pol:
Efficient Convex Zone Merging in Parametric Timed Automata. CoRR abs/2212.04802 (2022) - 2021
- [j35]Magnus Madsen, Jaco van de Pol:
Relational nullable types with Boolean unification. Proc. ACM Program. Lang. 5(OOPSLA): 1-28 (2021) - [c121]Simon Thrane Hansen, Cláudio Gomes, Peter Gorm Larsen, Jaco van de Pol:
Synthesizing Co-Simulation Algorithms with Step Negotiation and Algebraic Loop Handling. ANNSIM 2021: 1-12 - [c120]Simon Thrane Hansen, Cláudio Gomes, Maurizio Palmieri, Casper Thule, Jaco van de Pol, Jim Woodcock:
Verification of Co-simulation Algorithms Subject to Algebraic Loops and Adaptive Steps. FMICS 2021: 3-20 - [c119]Étienne André, Jaime Arias, Laure Petrucci, Jaco van de Pol:
Iterative Bounded Synthesis for Efficient Cycle Detection in Parametric Timed Automata. TACAS (1) 2021: 311-329 - [c118]Étienne André, Dylan Marinho, Jaco van de Pol:
A Benchmarks Library for Extended Parametric Timed Automata. TAP@STAF 2021: 39-50 - [e7]Mario Gleirscher, Jaco van de Pol, Jim Woodcock:
Proceedings First Workshop on Applicable Formal Methods, AppFM@FM 2021, virtual, 23rd November 2021. EPTCS 349, 2021 [contents] - [d3]Étienne André, Dylan Marinho, Jaco van de Pol:
The IMITATOR benchmarks library 2.0: A benchmarks library for extended parametric timed automata. Zenodo, 2021 - [d2]Steffan Christ Sølvsten, Jaco van de Pol:
Adiar 1.0.1 : TACAS 2022 Artifact. Zenodo, 2021 - [d1]Steffan Christ Sølvsten, Jaco van de Pol:
Adiar 1.0.1 : Experiment Data. Zenodo, 2021 - [i12]Steffan Christ Sølvsten, Jaco van de Pol, Anna Blume Jakobsen, Mathias Weller Berg Thomasen:
Efficient Binary Decision Diagram Manipulation in External Memory. CoRR abs/2104.12101 (2021) - [i11]Irfansha Shaik, Jaco van de Pol:
Classical Planning as QBF without Grounding (extended version). CoRR abs/2106.10138 (2021) - [i10]Étienne André, Dylan Marinho, Jaco van de Pol:
A Benchmarks Library for Extended Parametric Timed Automata. CoRR abs/2106.10232 (2021) - [i9]Mario Gleirscher, Jaco van de Pol, Jim Woodcock:
A Manifesto for Applicable Formal Methods. CoRR abs/2112.12758 (2021) - 2020
- [j34]Magnus Madsen, Jaco van de Pol:
Polymorphic types and effects with Boolean unification. Proc. ACM Program. Lang. 4(OOPSLA): 154:1-154:29 (2020) - [c117]Hubert Garavel, Maurice H. ter Beek, Jaco van de Pol:
The 2020 Expert Survey on Formal Methods. FMICS 2020: 3-69 - [c116]Simon Wimmer, Frédéric Herbreteau, Jaco van de Pol:
Certifying Emptiness of Timed Büchi Automata. FORMATS 2020: 58-75 - [c115]Wytse Oortwijn, Marieke Huisman, Sebastiaan J. C. Joosten, Jaco van de Pol:
Automated Verification of Parallel Nested DFS. TACAS (1) 2020: 247-265 - [c114]Jaco van de Pol, Laure Petrucci:
On Completeness of Liveness Synthesis for Parametric Timed Automata (Extended Abstract). WADT 2020: 3-10 - [i8]Simon Wimmer, Frédéric Herbreteau, Jaco van de Pol:
Certifying Emptiness of Timed Büchi Automata. CoRR abs/2007.04150 (2020)
2010 – 2019
- 2019
- [j33]Jeroen Meijer, Jaco van de Pol:
Sound black-box checking in the LearnLib. Innov. Syst. Softw. Eng. 15(3-4): 267-287 (2019) - [j32]Vincent Bloemen, Alexandre Duret-Lutz, Jaco van de Pol:
Model checking with generalized Rabin and Fin-less automata. Int. J. Softw. Tools Technol. Transf. 21(3): 307-324 (2019) - [c113]Jaco van de Pol:
Concurrent Algorithms and Data Structures for Model Checking (Invited Talk). CONCUR 2019: 4:1-4:1 - [c112]Freark I. van der Berg, Jaco van de Pol:
Concurrent Chaining Hash Maps for Software Model Checking. FMCAD 2019: 46-54 - [c111]Tom van Dijk, Jeroen Meijer, Jaco van de Pol:
Multi-core On-The-Fly Saturation. TACAS (2) 2019: 58-75 - [c110]Étienne André, Vincent Bloemen, Laure Petrucci, Jaco van de Pol:
Minimal-Time Synthesis for Parametric Timed Automata. TACAS (2) 2019: 211-228 - [p3]Fabrice Kordon, Michael Leuschel, Jaco van de Pol, Yann Thierry-Mieg:
Software Architecture of Modern Model Checkers. Computing and Software Science 2019: 393-419 - [i7]Étienne André, Vincent Bloemen, Laure Petrucci, Jaco van de Pol:
Minimal-Time Synthesis for Parametric Timed Automata. CoRR abs/1902.03013 (2019) - 2018
- [j31]Tom van Dijk, Jaco van de Pol:
Multi-core symbolic bisimulation minimisation. Int. J. Softw. Tools Technol. Transf. 20(2): 157-177 (2018) - [j30]Fabrice Kordon, Hubert Garavel, Lom-Messan Hillah, Emmanuel Paviot-Adet, Loïg Jezequel, Francis Hulin-Hubard, Elvio Gilberto Amparore, Marco Beccuti, Bernard Berthomieu, Hugues Evrard, Peter Gjøl Jensen, Didier Le Botlan, Torsten Liebke, Jeroen Meijer, Jirí Srba, Yann Thierry-Mieg, Jaco van de Pol, Karsten Wolf:
MCC'2017 - The Seventh Model Checking Contest. Trans. Petri Nets Other Model. Concurr. 13: 181-209 (2018) - [c109]Vincent Bloemen, Jaco van de Pol, Wil M. P. van der Aalst:
Symbolically Aligning Observed and Modelled Behaviour. ACSD 2018: 50-59 - [c108]Jaco van de Pol, Jeroen Meijer:
Synchronous or Alternating? - LTL Black-Box Checking of Mealy Machines by Combining the LearnLib and LTSmin. Models, Mindsets, Meta 2018: 417-430 - [c107]Vincent Bloemen, Sebastiaan J. van Zelst, Wil M. P. van der Aalst, Boudewijn F. van Dongen, Jaco van de Pol:
Maximizing Synchronization for Aligning Observed and Modelled Behaviour. BPM 2018: 233-249 - [c106]David Huistra, Jeroen Meijer, Jaco van de Pol:
Adaptive Learning for Learn-Based Regression Testing. FMICS 2018: 162-177 - [c105]Laure Petrucci, Jaco van de Pol:
Parameter Synthesis Algorithms for Parametric Interval Markov Chains. FORTE 2018: 121-140 - [c104]Hoang Gia Nguyen, Laure Petrucci, Jaco van de Pol:
Layered and Collecting NDFS with Subsumption for Parametric Timed Automata. ICECCS 2018: 1-9 - [c103]Jeroen Meijer, Jaco van de Pol:
Sound Black-Box Checking in the LearnLib. NFM 2018: 349-366 - [p2]Jiri Barnat, Vincent Bloemen, Alexandre Duret-Lutz, Alfons Laarman, Laure Petrucci, Jaco van de Pol, Etienne Renault:
Parallel Model Checking Algorithms for Linear-Time Temporal Logic. Handbook of Parallel Constraint Reasoning 2018: 457-507 - [p1]Tom van Dijk, Jaco van de Pol:
Multi-core Decision Diagrams. Handbook of Parallel Constraint Reasoning 2018: 509-545 - 2017
- [j29]Tom van Dijk, Jaco van de Pol:
Sylvan: multi-core framework for decision diagrams. Int. J. Softw. Tools Technol. Transf. 19(6): 675-696 (2017) - [c102]Bernhard Steffen, Marc Jasper, Jeroen Meijer, Jaco van de Pol:
Property-Preserving Generation of Tailored Benchmark Petri Nets. ACSD 2017: 1-8 - [c101]Rom Langerak, Jaco van de Pol, Janine N. Post, Stefano Schivo:
Improving the Timed Automata Approach to Biological Pathway Dynamics. Models, Algorithms, Logics and Tools 2017: 96-111 - [c100]Marc Jasper, Maximilian Fecke, Bernhard Steffen, Markus Schordan, Jeroen Meijer, Jaco van de Pol, Falk Howar, Stephen F. Siegel:
The RERS 2017 challenge and workshop (invited paper). SPIN 2017: 11-20 - [c99]Wytse Oortwijn, Tom van Dijk, Jaco van de Pol:
Distributed binary decision diagrams for symbolic reachability. SPIN 2017: 21-30 - [c98]Vincent Bloemen, Alexandre Duret-Lutz, Jaco van de Pol:
Explicit state model checking with generalized Büchi and Rabin automata. SPIN 2017: 50-59 - 2016
- [j28]Stefano Schivo, Jetse Scholma, Paul E. van der Vet, Marcel Karperien, Janine N. Post, Jaco van de Pol, Rom Langerak:
Modelling with ANIMO: between fuzzy logic and differential equations. BMC Syst. Biol. 10: 56 (2016) - [j27]Marieke Huisman, Jaco van de Pol:
Preface of Special issue on Automated Verification of Critical Systems (AVoCS'14). Sci. Comput. Program. 128: 1 (2016) - [j26]Alfons Laarman, Elwin Pater, Jaco van de Pol, Henri Hansen:
Guard-based partial-order reduction. Int. J. Softw. Tools Technol. Transf. 18(4): 427-448 (2016) - [j25]Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga:
Confluence reduction for Markov automata. Theor. Comput. Sci. 655: 193-219 (2016) - [c97]Waheed Ahmad, Marijn R. Jongerden, Mariëlle Stoelinga, Jaco van de Pol:
Model Checking and Evaluating QoS of Batteries in MPSoC Dataflow Applications via Hybrid Automata. ACSD 2016: 114-123 - [c96]Thomas Neele, Anton Wijs, Dragan Bosnacki, Jaco van de Pol:
Partial-Order Reduction for GPU Model Checking. ATVA 2016: 357-374 - [c95]Vincent Bloemen, Jaco van de Pol:
Multi-core SCC-Based LTL Model Checking. Haifa Verification Conference 2016: 18-33 - [c94]Jens Bendisposto, Philipp Körner, Michael Leuschel, Jeroen Meijer, Jaco van de Pol, Helen Treharne, Jorden Whitefield:
Symbolic Reachability Analysis of B Through ProB and LTSmin. IFM 2016: 275-291 - [c93]Waheed Ahmad, Jaco van de Pol:
Synthesizing Energy-Optimal Controllers for Multiprocessor Dataflow Applications with Uppaal Stratego. ISoLA (1) 2016: 94-113 - [c92]Marieke Huisman, Herbert Bos, Sjaak Brinkkemper, Arie van Deursen, Jan Friso Groote, Patricia Lago, Jaco van de Pol, Eelco Visser:
Software that Meets Its Intent. ISoLA (2) 2016: 609-625 - [c91]Maren Geske, Marc Jasper, Bernhard Steffen, Falk Howar, Markus Schordan, Jaco van de Pol:
RERS 2016: Parallel and Sequential Benchmarks with Focus on LTL Verification. ISoLA (2) 2016: 787-803 - [c90]Jeroen Meijer, Jaco van de Pol:
Bandwidth and Wavefront Reduction for Static Variable Ordering in Symbolic Reachability Analysis. NFM 2016: 255-271 - [c89]Vincent Bloemen, Alfons Laarman, Jaco van de Pol:
Multi-core on-the-fly SCC decomposition. PPoPP 2016: 8:1-8:12 - [c88]Tom van Dijk, Jaco van de Pol:
Multi-core Symbolic Bisimulation Minimisation. TACAS 2016: 332-348 - [i6]Jens Bendisposto, Philipp Koerner, Michael Leuschel, Jeroen Meijer, Jaco van de Pol, Helen Treharne, Jorden Whitefield:
Symbolic Reachability Analysis of B through ProB and LTSmin. CoRR abs/1603.04401 (2016) - 2015
- [c87]Waheed Ahmad, Philip K. F. Hölzenspies, Mariëlle Stoelinga, Jaco van de Pol:
Green Computing: Power Optimisation of VFI-Based Real-Time Multiprocessor Dataflow Applications. DSD 2015: 271-275 - [c86]Jaco C. van de Pol:
Automated Verification of Nested DFS. FMICS 2015: 181-197 - [c85]Wytse Oortwijn, Tom van Dijk, Jaco van de Pol:
A Distributed Hash Table for Shared Memory. PPAM (2) 2015: 15-24 - [c84]Tom van Dijk, Jaco van de Pol:
Sylvan: Multi-Core Decision Diagrams. TACAS 2015: 677-691 - [c83]Gijs Kant, Alfons Laarman, Jeroen Meijer, Jaco van de Pol, Stefan Blom, Tom van Dijk:
LTSmin: High-Performance Language-Independent Model Checking. TACAS 2015: 692-707 - [c82]Kaylash Chaudhary, Ansgar Fehnker, Jaco van de Pol, Mariëlle Stoelinga:
Modeling and Verification of the Bitcoin Protocol. MARS 2015: 46-60 - [i5]Jeroen Meijer, Jaco van de Pol:
Bandwidth and Wavefront Reduction for Static Variable Ordering in Symbolic Model Checking. CoRR abs/1511.08678 (2015) - 2014
- [j24]Marieke Huisman, Jaco van de Pol:
Preface. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 70 (2014) - [j23]Jaco van de Pol, Theo C. Ruys, Steven te Brinke:
Thoughtful brute-force attack of the RERS 2012 and 2013 Challenges. Int. J. Softw. Tools Technol. Transf. 16(5): 481-491 (2014) - [j22]Stefano Schivo, Jetse Scholma, Brend Wanders, Ricardo A. Urquidi Camacho, Paul E. van der Vet, Marcel Karperien, Rom Langerak, Jaco van de Pol, Janine N. Post:
Modeling Biological Pathway Dynamics With Timed Automata. IEEE J. Biomed. Health Informatics 18(3): 832-839 (2014) - [c81]Waheed Ahmad, Robert de Groote, Philip K. F. Hölzenspies, Mariëlle Stoelinga, Jaco van de Pol:
Resource-Constrained Optimal Scheduling of Synchronous Dataflow Graphs via Timed Automata. ACSD 2014: 72-81 - [c80]Tom van Dijk, Jaco C. van de Pol:
Lace: Non-blocking Split Deque for Work-Stealing. Euro-Par Workshops (2) 2014: 206-217 - [c79]Jeroen Meijer, Gijs Kant, Stefan Blom, Jaco van de Pol:
Read, Write and Copy Dependencies for Symbolic Model Checking. Haifa Verification Conference 2014: 204-219 - [c78]Gijs Kant, Jaco van de Pol:
Generating and Solving Symbolic Parity Games. GRAPHITE 2014: 2-14 - [c77]Stefano Schivo, Jetse Scholma, Marcel Karperien, Janine N. Post, Jaco van de Pol, Rom Langerak:
Setting Parameters for Biological Models With ANIMO. SynCoP 2014: 35-47 - 2013
- [c76]Alfons Laarman, Mads Chr. Olesen, Andreas Engelbredt Dalsgaard, Kim Guldstrand Larsen, Jaco van de Pol:
Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction. CAV 2013: 968-983 - [c75]Mark Timmer, Jaco van de Pol, Mariëlle Stoelinga:
Confluence Reduction for Markov Automata. FORMATS 2013: 243-257 - [c74]Alfons Laarman, Elwin Pater, Jaco van de Pol, Michael Weber:
Guard-Based Partial-Order Reduction. SPIN 2013: 227-245 - 2012
- [j21]Tom van Dijk, Alfons Laarman, Jaco van de Pol:
Multi-core and/or Symbolic Model Checking. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 53 (2012) - [j20]Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga, Mark Timmer:
A linear process-algebraic format with data for probabilistic automata. Theor. Comput. Sci. 413(1): 36-57 (2012) - [c73]Sami Evangelista, Alfons Laarman, Laure Petrucci, Jaco van de Pol:
Improved Multi-Core Nested Depth-First Search. ATVA 2012: 269-283 - [c72]Stefano Schivo, Jetse Scholma, Brend Wanders, Ricardo A. Urquidi Camacho, Paul E. van der Vet, Marcel Karperien, Rom Langerak, Jaco van de Pol, Janine N. Post:
Modelling biological pathway dynamics with Timed Automata. BIBE 2012: 447-453 - [c71]Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga:
Efficient Modelling and Generation of Markov Automata. CONCUR 2012: 364-379 - [c70]Andreas Engelbredt Dalsgaard, Alfons Laarman, Kim G. Larsen, Mads Chr. Olesen, Jaco van de Pol:
Multi-core Reachability for Timed Automata. FORMATS 2012: 91-106 - [c69]Gijs Kant, Jaco van de Pol:
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games. GRAPHITE 2012: 50-65 - [c68]Tom van Dijk, Alfons Laarman, Jaco van de Pol:
Multi-Core BDD Operations for Symbolic Reachability. PASM/PDMC 2012: 127-143 - 2011
- [j19]Jiri Barnat, Jakub Chaloupka, Jaco van de Pol:
Distributed Algorithms for SCC Decomposition. J. Log. Comput. 21(1): 23-44 (2011) - [j18]Stefan Blom, Bert Lisser, Jaco van de Pol, Michael Weber:
A Database Approach to Distributed State-Space Generation. J. Log. Comput. 21(1): 45-62 (2011) - [j17]Luca Aceto, Taolue Chen, Anna Ingólfsdóttir, Bas Luttik, Jaco van de Pol:
On the axiomatizability of priority II. Theor. Comput. Sci. 412(28): 3035-3044 (2011) - [j16]Jan A. Bergstra, Jaco van de Pol:
A calculus for four-valued sequential logic. Theor. Comput. Sci. 412(28): 3122-3128 (2011) - [c67]Alfons Laarman, Rom Langerak, Jaco van de Pol, Michael Weber, Anton Wijs:
Multi-core Nested Depth-First Search. ATVA 2011: 321-335 - [c66]Alfons Laarman, Jaco van de Pol, Michael Weber:
Multi-Core LTSmin: Marrying Modularity and Scalability. NASA Formal Methods 2011: 506-511 - [c65]Alfons Laarman, Jaco van de Pol, Michael Weber:
Parallel Recursive State Compression for Free. SPIN 2011: 38-56 - [c64]Mark Timmer, Mariëlle Stoelinga, Jaco van de Pol:
Confluence Reduction for Probabilistic Systems. TACAS 2011: 311-325 - [c63]Alfons Laarman, Jaco van de Pol:
Variations on Multi-Core Nested Depth-First Search. PDMC 2011: 13-28 - [i4]Alfons Laarman, Jaco van de Pol, Michael Weber:
Parallel Recursive State Compression for Free. CoRR abs/1104.3119 (2011) - 2010
- [j15]Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, Mohammad Reza Mousavi, Jaco van de Pol:
Towards model checking executable UML specifications in mCRL2. Innov. Syst. Softw. Eng. 6(1-2): 83-90 (2010) - [c62]Jiansheng Xing, Bart D. Theelen, Rom Langerak, Jaco van de Pol, Jan Tretmans, Jeroen Voeten:
From POOSL to UPPAAL: Transformation and Quantitative Analysis. ACSD 2010: 47-56 - [c61]Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga, Mark Timmer:
A Linear Process-Algebraic Format for Probabilistic Systems with Data. ACSD 2010: 213-222 - [c60]Stefan Blom, Jaco van de Pol, Michael Weber:
LTSmin: Distributed and Symbolic Reachability. CAV 2010: 354-359 - [c59]Alfons Laarman, Jaco van de Pol, Michael Weber:
Boosting multi-core reachability performance with shared hash tables. FMCAD 2010: 247-255 - [c58]Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, Mohammad Reza Mousavi, Jaco van de Pol, Osmar Marchi dos Santos:
Automated Verification of Executable UML Models. FMCO 2010: 225-250 - [c57]Jiansheng Xing, Bart D. Theelen, Rom Langerak, Jaco van de Pol, Jan Tretmans, Jeroen Voeten:
UPPAAL in Practice: Quantitative Verification of a RapidIO Network. ISoLA (2) 2010: 160-174 - [e6]Jaco van de Pol, Michael Weber:
Model Checking Software - 17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010. Proceedings. Lecture Notes in Computer Science 6349, Springer 2010, ISBN 978-3-642-16163-6 [contents] - [i3]Alfons Laarman, Jaco van de Pol, Michael Weber:
Boosting Multi-Core Reachability Performance with Shared Hash Tables. CoRR abs/1004.2772 (2010) - [i2]Mark Timmer, Mariëlle Stoelinga, Jaco van de Pol:
Confluence Reduction for Probabilistic Systems (extended version). CoRR abs/1011.2314 (2010)
2000 – 2009
- 2009
- [j14]Anton Wijs, Jaco van de Pol, Elena M. Bortnik:
Solving scheduling problems by untimed model checking. Int. J. Softw. Tools Technol. Transf. 11(5): 375-392 (2009) - [c56]Jaco van de Pol, Mark Timmer:
State Space Reduction of Linear Processes Using Control Flow Reconstruction. ATVA 2009: 54-68 - [c55]Wouter Kuijper, Jaco van de Pol:
Compositional Control Synthesis for Partially Observable Systems. CONCUR 2009: 431-447 - [c54]Wouter Kuijper, Jaco van de Pol:
Computing Weakest Strategies for Safety Games of Imperfect Information. TACAS 2009: 92-106 - [c53]Stefan Blom, Jaco van de Pol:
Distributed Branching Bisimulation Minimization by Inductive Signatures. PDMC 2009: 32-46 - [e5]Lubos Brim, Jaco van de Pol:
Proceedings 8th International Workshop on Parallel and Distributed Methods in verifiCation, PDMC 2009, Eindhoven, The Netherlands, 4th November 2009. EPTCS 14, 2009 [contents] - 2008
- [j13]Pepijn Crouzen, Jaco van de Pol, Arend Rensink:
Applying formal methods to gossiping networks with mCRL and groove. SIGMETRICS Perform. Evaluation Rev. 36(3): 7-16 (2008) - [j12]Stefan Blom, Thomas Deiß, Natalia Ioustinova, Ari Kontio, Jaco van de Pol, Axel Rennoch, Natalia Sidorova:
Simulated time for host-based testing with TTCN-3. Softw. Test. Verification Reliab. 18(1): 29-49 (2008) - [c52]Stefan Blom, Jaco van de Pol:
Symbolic Reachability for Process Algebras with Recursive Data Types. ICTAC 2008: 81-95 - [c51]Rena Bakhshi, Wan J. Fokkink, Jun Pang, Jaco van de Pol:
Leader Election in Anonymous Rings: Franklin Goes Probabilistic. IFIP TCS 2008: 57-72 - [c50]Jens R. Calamé, Jaco van de Pol:
Applying Model-Based Testing to HTML Rendering Engines - A Case Study. TestCom/FATES 2008: 250-265 - [c49]Taolue Chen, Jaco van de Pol, Yanjing Wang:
PDL over Accelerated Labeled Transition Systems. TASE 2008: 193-200 - [c48]Bahareh Badban, Wan J. Fokkink, Jaco van de Pol:
Mechanical Verification of a Two-Way Sliding Window Protocol. CPA 2008: 179-202 - [c47]Jaco van de Pol, Michael Weber:
A Multi-Core Solver for Parity Games. PDMC@ETAPS 2008: 19-34 - [c46]Stefan Blom, Boudewijn R. Haverkort, Matthias Kuntz, Jaco van de Pol:
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking. PDMC@ETAPS 2008: 35-50 - [i1]Jaco van de Pol:
A Typical Verification Challenge for the GRID. Distributed Verification and Grid Computing 2008 - 2007
- [j11]Miguel Valero Espada, Jaco van de Pol:
An abstract interpretation toolkit for µCRL. Formal Methods Syst. Des. 30(3): 249-273 (2007) - [j10]Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema:
Generalizing DPLL and satisfiability for equalities. Inf. Comput. 205(8): 1188-1211 (2007) - [c45]Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. C. Willemse:
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems. CONCUR 2007: 120-135 - [c44]Jens R. Calamé, Natalia Ioustinova, Jaco van de Pol, Natalia Sidorova:
Bug Hunting with False Negatives. IFM 2007: 98-117 - [c43]Stefan Blom, Jens R. Calamé, Bert Lisser, Simona Orzan, Jun Pang, Jaco van de Pol, Muhammad Torabi Dashti, Anton Wijs:
Distributed Analysis with mu CRL: A Compendium of Case Studies. TACAS 2007: 683-689 - [c42]Stefan Blom, Bert Lisser, Jaco van de Pol, Michael Weber:
A Database Approach to Distributed State Space Generation. PDMC@CAV 2007: 17-32 - [c41]Jiri Barnat, Jakub Chaloupka, Jaco van de Pol:
Improved Distributed Algorithms for SCC Decomposition. PDMC@CAV 2007: 63-77 - [e4]Lubos Brim, Boudewijn R. Haverkort, Martin Leucker, Jaco van de Pol:
Formal Methods: Applications and Technology, 11th International Workshop, FMICS 2006 and 5th International Workshop PDMC 2006, Bonn, Germany, August 26-27, and August 31, 2006, Revised Selected Papers. Lecture Notes in Computer Science 4346, Springer 2007, ISBN 978-3-540-70951-0 [contents] - [e3]Judi Romijn, Graeme Smith, Jaco van de Pol:
Proceedings of the Doctoral Symposium affiliated with the Fifth Integrated Formal Methods Conference, IFM Doctoral Symposium 2005, Eindhoven, The Netherlands, November 29, 2005. Electronic Notes in Theoretical Computer Science 191, Elsevier 2007 [contents] - 2006
- [j9]Wan J. Fokkink, Jun Pang, Jaco van de Pol:
Cones and foci: A mechanical framework for protocol verification. Formal Methods Syst. Des. 29(1): 1-31 (2006) - [j8]Simona Orzan, Jaco van de Pol:
Distribution of a Simple Shared Dataspace Architecture. Fundam. Informaticae 73(4): 535-559 (2006) - [c40]Miguel Valero Espada, Jaco van de Pol:
Accelerated Modal Abstractions of Labelled Transition Systems. AMAST 2006: 338-352 - [c39]Jens R. Calamé, Nicolae Goga, Natalia Ioustinova, Jaco van de Pol:
TTCN-3 Testing of Hoorn-Kersenboogerd Railway Interlocking. CCECE 2006: 620-623 - [c38]Stefan Blom, Thomas Deiß, Natalia Ioustinova, Ari Kontio, Jaco van de Pol, Axel Rennoch, Natalia Sidorova:
TTCN-3 for Distributed Testing Embedded Software. Ershov Memorial Conference 2006: 98-111 - [c37]Jens R. Calamé, Natalia Ioustinova, Jaco van de Pol:
Automatisierte Erzeugung von TTCN-3 Testfiällen aus UML-Modellen. GI Jahrestagung (2) 2006: 257-261 - [e2]Martin Leucker, Jaco van de Pol:
Proceedings of the 4th International Workshop on Parallel and Distributed Methods in Verification, PDMC@ICALP 2005, Lisbon, Portugal, July 10, 2005. Electronic Notes in Theoretical Computer Science 135(2), Elsevier 2006 [contents] - 2005
- [j7]Bahareh Badban, Jaco van de Pol:
Zero, successor and equality in BDDs. Ann. Pure Appl. Log. 133(1-3): 101-123 (2005) - [j6]Bahareh Badban, Wan J. Fokkink, Jan Friso Groote, Jun Pang, Jaco van de Pol:
Verification of a sliding window protocol in µCRL and PVS. Formal Aspects Comput. 17(3): 342-388 (2005) - [j5]Thomas Arts, Jaco van de Pol:
Introductory paper. Int. J. Softw. Tools Technol. Transf. 7(3): 195-196 (2005) - [j4]Jozef Hooman, Jaco van de Pol:
Semantic models of a timed distributed dataspace architecture. Theor. Comput. Sci. 331(2-3): 291-323 (2005) - [c36]Jens R. Calamé, Natalia Ioustinova, Jaco van de Pol, Natalia Sidorova:
Data Abstraction and Constraint Solving for Conformance Testing. APSEC 2005: 541-548 - [c35]Stefan Blom, Natalia Ioustinova, Jaco van de Pol, Axel Rennoch, Natalia Sidorova:
Simulated Time for Testing Railway Interlockings with TTCN-3. FATES 2005: 1-15 - [c34]Anton Wijs, Jaco van de Pol, Elena M. Bortnik:
Solving scheduling problems by untimed model checking: the clinical chemical analyser case study. FMICS 2005: 54-61 - [c33]Jaco van de Pol, Olga Tveretina:
A BDD-Representation for the Logic of Equality and Uninterpreted Functions. MFCS 2005: 769-780 - [c32]Jaco van de Pol, Hans Zantema:
Generalized Innermost Rewriting. RTA 2005: 2-16 - [c31]Martin Leucker, Jaco van de Pol:
Preface. PDMC@ICALP 2005: 1-2 - [c30]Judi Romijn, Graeme Smith, Jaco van de Pol:
Preface. IFM Doctoral Symposium 2005: 1-2 - [c29]Jens R. Calamé, Natalia Ioustinova, Jaco van de Pol:
Automatic Model-Based Generation of Parameterized Test Cases Using Data Abstraction. IFM Doctoral Symposium 2005: 25-48 - [e1]Judi Romijn, Graeme Smith, Jaco van de Pol:
Integrated Formal Methods, 5th International Conference, IFM 2005, Eindhoven, The Netherlands, November 29 - December 2, 2005, Proceedings. Lecture Notes in Computer Science 3771, Springer 2005, ISBN 3-540-30492-4 [contents] - 2004
- [j3]Jaco van de Pol:
Introductory paper. Int. J. Softw. Tools Technol. Transf. 5(2-3): 105-106 (2004) - [c28]Wan J. Fokkink, Jan Friso Groote, Jun Pang, Bahareh Badban, Jaco van de Pol:
Verifying a Sliding Window Protocol in µCRL. AMAST 2004: 148-163 - [c27]Jaco van de Pol, Miguel Valero Espada:
Modal Abstractions in µCRL. AMAST 2004: 409-425 - [c26]Jun Pang, Jaco van de Pol, Miguel Valero Espada:
Abstraction of Parallel Uniform Processes with Data. SEFM 2004: 14-23 - [c25]Simona Orzan, Jaco van de Pol, Miguel Valero Espada:
A State Space Distribution Policy Based on Abstract Interpretation. PDMC 2004: 35-45 - [c24]Jaco van de Pol, Miguel Valero Espada:
An Abstract Interpretation Toolkit for muCRL. FMICS 2004: 295-313 - 2003
- [c23]Jaco van de Pol, Miguel Valero Espada:
Verification of JavaSpacesTM Parallel Programs. ACSD 2003: 196-205 - [c22]Simona Orzan, Jaco van de Pol:
Verification of Distributed Dataspace Architectures. Ershov Memorial Conference 2003: 192-206 - [c21]Stefan Blom, Jan Friso Groote, Izak van Langevelde, Bert Lisser, Jaco van de Pol:
New developments around the mCRL tool set. FMICS 2003: 284-288 - 2002
- [c20]Stefan Blom, Jaco van de Pol:
State Space Reduction by Proving Confluence. CAV 2002: 596-609 - [c19]Wan J. Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein:
Refinement and Verification Applied to an In-Flight Data Acquisition Unit. CONCUR 2002: 1-23 - [c18]Jaco van de Pol, Miguel Valero Espada:
Formal Specification of JavaSpaces Architecture Using µCRL. COORDINATION 2002: 274-290 - [c17]Jozef Hooman, Jaco van de Pol:
Equivalent Semantic Models for a Distributed Dataspace Architecture. FMCO 2002: 182-201 - [c16]Jaco van de Pol:
JITty: A Rewriter with Strategy Annotations. RTA 2002: 367-370 - [c15]Jozef Hooman, Jaco van de Pol:
Formal verification of replication on a distributed data space architecture. SAC 2002: 351-358 - [c14]Simona Orzan, Jaco van de Pol:
Distribution of a Simple Shared Dataspace Architecture. FOCLASA 2002: 371-388 - 2001
- [j2]Hans Zantema, Jaco van de Pol:
A rewriting approach to binary decision diagrams. J. Log. Algebraic Methods Program. 49(1-2): 61-86 (2001) - [c13]Stefan Blom, Wan J. Fokkink, Jan Friso Groote, Izak van Langevelde, Bert Lisser, Jaco van de Pol:
µCRL: A Toolset for Analysing Algebraic Specifications. CAV 2001: 250-254 - [c12]Jaco van de Pol:
Just-in-time: On Strategy Annotations. WRS 2001: 41-63 - 2000
- [c11]Edwin D. de Jong, Jaco van de Pol, Jozef Hooman:
Refinement in Requirements Specification and Analysis: A Case Study. ECBS 2000: 290-298 - [c10]Jan Friso Groote, Jaco van de Pol:
Equational Binary Decision Diagrams. LPAR 2000: 161-178 - [c9]Jan Friso Groote, Jaco van de Pol:
State Space Reduction Using Partial tau-Confluence. MFCS 2000: 383-393 - [c8]Jaco van de Pol, Hans Zantema:
Binary Decision Diagrams by Shard Rewriting. MFCS 2000: 609-618
1990 – 1999
- 1999
- [c7]Jaco van de Pol, Jozef Hooman, Edwin D. de Jong:
Modular Formal Specification of Data and Behaviour. IFM 1999: 109-128 - 1998
- [j1]Jaco van de Pol:
Operational Semantics of Rewriting with Priorities. Theor. Comput. Sci. 200(1-2): 289-312 (1998) - [c6]Jan Friso Groote, François Monin, Jaco van de Pol:
Checking Verifications of Protocols and Distributed Systems by Computer. CONCUR 1998: 629-655 - 1997
- [c5]Wan J. Fokkink, Jaco van de Pol:
Simulation as a Correct Transformation of Rewrite Systems. MFCS 1997: 249-258 - 1996
- [c4]Jan Friso Groote, Jaco van de Pol:
A Bounded Retransmission Protocol for Large Data Packets. AMAST 1996: 536-550 - 1995
- [c3]Jaco van de Pol:
Two Different Strong Normalization Proofs? HOA 1995: 201-220 - [c2]Jaco van de Pol, Helmut Schwichtenberg:
Strict Functionals for Termination Proofs. TLCA 1995: 350-364 - 1993
- [c1]Jaco van de Pol:
Termination Proofs for Higher-order Rewrite Systems. HOA 1993: 305-325
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint