Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jaco van de Pol
2010 – today
- 2013
[j34]Tom van Dijk, Alfons Laarman, Jaco van de Pol: Multi-Core BDD Operations for Symbolic Reachability. Electr. Notes Theor. Comput. Sci. 296: 127-143 (2013)
[c62]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
[c61]Mark Timmer, Jaco van de Pol, Mariëlle Stoelinga: Confluence Reduction for Markov Automata. FORMATS 2013: 243-257
[c60]Alfons Laarman, Elwin Pater, Jaco van de Pol, Michael Weber: Guard-Based Partial-Order Reduction. SPIN 2013: 227-245- 2012
[j33]Tom van Dijk, Alfons Laarman, Jaco van de Pol: Multi-core and/or Symbolic Model Checking. ECEASST 53 (2012)
[j32]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)
[c59]Sami Evangelista, Alfons Laarman, Laure Petrucci, Jaco van de Pol: Improved Multi-Core Nested Depth-First Search. ATVA 2012: 269-283
[c58]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
[c57]Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol, Mariëlle Stoelinga: Efficient Modelling and Generation of Markov Automata. CONCUR 2012: 364-379
[c56]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
[c55]Gijs Kant, Jaco van de Pol: Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games. GRAPHITE 2012: 50-65- 2011
[j31]Jiri Barnat, Jakub Chaloupka, Jaco van de Pol: Distributed Algorithms for SCC Decomposition. J. Log. Comput. 21(1): 23-44 (2011)
[j30]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)
[j29]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)
[j28]Jan A. Bergstra, Jaco van de Pol: A calculus for four-valued sequential logic. Theor. Comput. Sci. 412(28): 3122-3128 (2011)
[c54]Alfons Laarman, Rom Langerak, Jaco van de Pol, Michael Weber, Anton Wijs: Multi-core Nested Depth-First Search. ATVA 2011: 321-335
[c53]Alfons Laarman, Jaco van de Pol, Michael Weber: Multi-Core LTSmin: Marrying Modularity and Scalability. NASA Formal Methods 2011: 506-511
[c52]Alfons Laarman, Jaco van de Pol, Michael Weber: Parallel Recursive State Compression for Free. SPIN 2011: 38-56
[c51]Mark Timmer, Mariëlle Stoelinga, Jaco van de Pol: Confluence Reduction for Probabilistic Systems. TACAS 2011: 311-325
[c50]Alfons Laarman, Jaco van de Pol: Variations on Multi-Core Nested Depth-First Search. PDMC 2011: 13-28
[i3]Alfons Laarman, Jaco van de Pol, Michael Weber: Parallel Recursive State Compression for Free. CoRR abs/1104.3119 (2011)- 2010
[j27]Helle Hvid Hansen, Jeroen Ketema, Bas Luttik, Mohammad Reza Mousavi, Jaco van de Pol: Towards model checking executable UML specifications in mCRL2. ISSE 6(1-2): 83-90 (2010)
[c49]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
[c48]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
[c47]Stefan Blom, Jaco van de Pol, Michael Weber: LTSmin: Distributed and Symbolic Reachability. CAV 2010: 354-359
[c46]Alfons Laarman, Jaco van de Pol, Michael Weber: Boosting multi-core reachability performance with shared hash tables. FMCAD 2010: 247-255
[c45]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
[c44]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
[e4]Jaco van de Pol, Michael Weber (Eds.): 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
[i2]Alfons Laarman, Jaco van de Pol, Michael Weber: Boosting Multi-Core Reachability Performance with Shared Hash Tables. CoRR abs/1004.2772 (2010)
[i1]Mark Timmer, Mariëlle Stoelinga, Jaco van de Pol: Confluence Reduction for Probabilistic Systems (extended version). CoRR abs/1011.2314 (2010)
2000 – 2009
- 2009
[j26]Anton Wijs, Jaco van de Pol, Elena M. Bortnik: Solving scheduling problems by untimed model checking. STTT 11(5): 375-392 (2009)
[c43]Jaco van de Pol, Mark Timmer: State Space Reduction of Linear Processes Using Control Flow Reconstruction. ATVA 2009: 54-68
[c42]Wouter Kuijper, Jaco van de Pol: Compositional Control Synthesis for Partially Observable Systems. CONCUR 2009: 431-447
[c41]Wouter Kuijper, Jaco van de Pol: Computing Weakest Strategies for Safety Games of Imperfect Information. TACAS 2009: 92-106
[c40]Stefan Blom, Jaco van de Pol: Distributed Branching Bisimulation Minimization by Inductive Signatures. PDMC 2009: 32-46
[e3]Lubos Brim, Jaco van de Pol (Eds.): Proceedings 8th International Workshop on Parallel and Distributed Methods in verifiCation. EPTCS 14, 2009- 2008
[j25]Stefan Blom, Bert Lisser, Jaco van de Pol, Michael Weber: A Database Approach to Distributed State Space Generation. Electr. Notes Theor. Comput. Sci. 198(1): 17-32 (2008)
[j24]Jiri Barnat, Jakub Chaloupka, Jaco van de Pol: Improved Distributed Algorithms for SCC Decomposition. Electr. Notes Theor. Comput. Sci. 198(1): 63-77 (2008)
[j23]Jaco van de Pol, Michael Weber: A Multi-Core Solver for Parity Games. Electr. Notes Theor. Comput. Sci. 220(2): 19-34 (2008)
[j22]Stefan Blom, Boudewijn R. Haverkort, Matthias Kuntz, Jaco van de Pol: Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking. Electr. Notes Theor. Comput. Sci. 220(2): 35-50 (2008)
[j21]Pepijn Crouzen, Jaco van de Pol, Arend Rensink: Applying formal methods to gossiping networks with mCRL and groove. SIGMETRICS Performance Evaluation Review 36(3): 7-16 (2008)
[j20]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., Verif. Reliab. 18(1): 29-49 (2008)
[c39]Stefan Blom, Jaco van de Pol: Symbolic Reachability for Process Algebras with Recursive Data Types. ICTAC 2008: 81-95
[c38]Rena Bakhshi, Wan Fokkink, Jun Pang, Jaco van de Pol: Leader Election in Anonymous Rings: Franklin Goes Probabilistic. IFIP TCS 2008: 57-72
[c37]Jens R. Calame, Jaco van de Pol: Applying Model-Based Testing to HTML Rendering Engines - A Case Study. TestCom/FATES 2008: 250-265
[c36]Taolue Chen, Jaco van de Pol, Yanjing Wang: PDL over Accelerated Labeled Transition Systems. TASE 2008: 193-200
[c35]Bahareh Badban, Wan Fokkink, Jaco van de Pol: Mechanical Verification of a Two-Way Sliding Window Protocol. CPA 2008: 179-202- 2007
[j19]Judi Romijn, Graeme Smith, Jaco van de Pol: Preface. Electr. Notes Theor. Comput. Sci. 191: 1-2 (2007)
[j18]Jens R. Calame, Natalia Ioustinova, Jaco van de Pol: Automatic Model-Based Generation of Parameterized Test Cases Using Data Abstraction. Electr. Notes Theor. Comput. Sci. 191: 25-48 (2007)
[j17]Miguel Valero Espada, Jaco van de Pol: An abstract interpretation toolkit for µCRL. Formal Methods in System Design 30(3): 249-273 (2007)
[j16]Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema: Generalizing DPLL and satisfiability for equalities. Inf. Comput. 205(8): 1188-1211 (2007)
[c34]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
[c33]Jens R. Calame, Natalia Ioustinova, Jaco van de Pol, Natalia Sidorova: Bug Hunting with False Negatives. IFM 2007: 98-117
[c32]Stefan Blom, Jens R. Calame, 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
[e2]Lubos Brim, Boudewijn R. Haverkort, Martin Leucker, Jaco van de Pol (Eds.): 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- 2006
[j15]
[j14]Wan Fokkink, Jun Pang, Jaco van de Pol: Cones and foci: A mechanical framework for protocol verification. Formal Methods in System Design 29(1): 1-31 (2006)
[j13]Simona Orzan, Jaco van de Pol: Distribution of a Simple Shared Dataspace Architecture. Fundam. Inform. 73(4): 535-559 (2006)
[c31]Miguel Valero Espada, Jaco van de Pol: Accelerated Modal Abstractions of Labelled Transition Systems. AMAST 2006: 338-352
[c30]Jens R. Calame, Nicolae Goga, Natalia Ioustinova, Jaco van de Pol: TTCN-3 Testing of Hoorn-Kersenboogerd Railway Interlocking. CCECE 2006: 620-623
[c29]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
[c28]Jens R. Calame, Natalia Ioustinova, Jaco van de Pol: Automatisierte Erzeugung von TTCN-3 Testfiällen aus UML-Modellen. GI Jahrestagung (2) 2006: 257-261- 2005
[j12]Bahareh Badban, Jaco van de Pol: Zero, successor and equality in BDDs. Ann. Pure Appl. Logic 133(1-3): 101-123 (2005)
[j11]Simona Orzan, Jaco van de Pol, Miguel Valero Espada: A State Space Distribution Policy Based on Abstract Interpretation. Electr. Notes Theor. Comput. Sci. 128(3): 35-45 (2005)
[j10]Jaco van de Pol, Miguel Valero Espada: An Abstract Interpretation Toolkit for muCRL. Electr. Notes Theor. Comput. Sci. 133: 295-313 (2005)
[j9]Bahareh Badban, Wan Fokkink, Jan Friso Groote, Jun Pang, Jaco van de Pol: Verification of a sliding window protocol in µCRL and PVS. Formal Asp. Comput. 17(3): 342-388 (2005)
[j8]
[j7]Jozef Hooman, Jaco van de Pol: Semantic models of a timed distributed dataspace architecture. Theor. Comput. Sci. 331(2-3): 291-323 (2005)
[c27]Jens R. Calame, Natalia Ioustinova, Jaco van de Pol, Natalia Sidorova: Data Abstraction and Constraint Solving for Conformance Testing. APSEC 2005: 541-548
[c26]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
[c25]Jaco van de Pol, Olga Tveretina: A BDD-Representation for the Logic of Equality and Uninterpreted Functions. MFCS 2005: 769-780
[c24]
[e1]Judi Romijn, Graeme Smith, Jaco van de Pol (Eds.): 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- 2004
[j6]
[c23]Wan Fokkink, Jan Friso Groote, Jun Pang, Bahareh Badban, Jaco van de Pol: Verifying a Sliding Window Protocol in µCRL. AMAST 2004: 148-163
[c22]
[c21]Jun Pang, Jaco van de Pol, Miguel Valero Espada: Abstraction of Parallel Uniform Processes with Data. SEFM 2004: 14-23- 2003
[j5]Simona Orzan, Jaco van de Pol: Distribution of a Simple Shared Dataspace Architecture. Electr. Notes Theor. Comput. Sci. 68(3): 371-388 (2003)
[j4]Stefan Blom, Jan Friso Groote, Izak van Langevelde, Bert Lisser, Jaco van de Pol: New developments around the mCRL tool set. Electr. Notes Theor. Comput. Sci. 80: 284-288 (2003)
[c20]Jaco van de Pol, Miguel Valero Espada: Verification of JavaSpacesTM Parallel Programs. ACSD 2003: 196-205
[c19]Simona Orzan, Jaco van de Pol: Verification of Distributed Dataspace Architectures. Ershov Memorial Conference 2003: 192-206- 2002
[c18]
[c17]Wan 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
[c16]Jaco van de Pol, Miguel Valero Espada: Formal Specification of JavaSpaces Architecture Using µCRL. COORDINATION 2002: 274-290
[c15]Jozef Hooman, Jaco van de Pol: Equivalent Semantic Models for a Distributed Dataspace Architecture. FMCO 2002: 182-201
[c14]
[c13]Jozef Hooman, Jaco van de Pol: Formal verification of replication on a distributed data space architecture. SAC 2002: 351-358- 2001
[j3]Hans Zantema, Jaco van de Pol: A rewriting approach to binary decision diagrams. J. Log. Algebr. Program. 49(1-2): 61-86 (2001)
[j2]Jaco van de Pol: Just-in-time: On Strategy Annotations. Electr. Notes Theor. Comput. Sci. 57: 41-63 (2001)
[c12]Stefan Blom, Wan Fokkink, Jan Friso Groote, Izak van Langevelde, Bert Lisser, Jaco van de Pol: µCRL: A Toolset for Analysing Algebraic Specifications. CAV 2001: 250-254- 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]
[c9]Jan Friso Groote, Jaco van de Pol: State Space Reduction Using Partial tau-Confluence. MFCS 2000: 383-393
[c8]
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 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]
[c2]Jaco van de Pol, Helmut Schwichtenberg: Strict Functionals for Termination Proofs. TLCA 1995: 350-364- 1993
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:05 CEST by the dblp team



