Travelled to:
1 × China
1 × Estonia
1 × Germany
1 × Portugal
1 × Russia
1 × Spain
2 × Denmark
2 × France
2 × Japan
7 × United Kingdom
Collaborated with:
S.Blom G.Kant J.R.Calame J.Hooman T.v.Dijk W.Kuijper H.Zantema ∅ H.Schwichtenberg J.Pang N.Ioustinova N.Sidorova A.Laarman M.Timmer M.Stoelinga M.Weber M.V.Espada E.D.d.Jong B.Lisser M.C.Olesen A.E.Dalsgaard K.G.Larsen A.Rennoch J.Meijer W.Fokkink J.F.Groote I.v.Langevelde S.Orzan M.T.Dashti A.Wijs
Talks about:
distribut (3) game (3) data (3) confluenc (2) strategi (2) abstract (2) system (2) symbol (2) specif (2) rewrit (2)
Person: Jaco van de Pol
DBLP: Pol:Jaco_van_de
Facilitated 1 volumes:
Contributed to:
Wrote 20 papers:
- TACAS-2015-DijkP #diagrams #manycore #named
- Sylvan: Multi-Core Decision Diagrams (TvD, JvdP), pp. 677–691.
- TACAS-2015-KantLMPBD #independence #model checking #named
- LTSmin: High-Performance Language-Independent Model Checking (GK, AL, JM, JvdP, SB, TvD), pp. 692–707.
- GRAPHITE-2014-KantP #game studies #generative
- Generating and Solving Symbolic Parity Games (GK, JvdP), pp. 2–14.
- CAV-2013-LaarmanODLP #abstraction #automaton #manycore #using
- Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction (AL, MCO, AED, KGL, JvdP), pp. 968–983.
- GRAPHITE-2012-KantP #equation #game studies #performance
- Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games (GK, JvdP), pp. 50–65.
- TACAS-2011-TimmerSP #confluence #probability #reduction
- Confluence Reduction for Probabilistic Systems (MT, MS, JvdP), pp. 311–325.
- CAV-2010-BlomPW #distributed #named #reachability
- LTSmin: Distributed and Symbolic Reachability (SB, JvdP, MW), pp. 354–359.
- TACAS-2009-KuijperP #game studies #safety
- Computing Weakest Strategies for Safety Games of Imperfect Information (WK, JvdP), pp. 92–106.
- TestCom-FATES-2008-CalameP #case study #html #modelling #testing
- Applying Model-Based Testing to HTML Rendering Engines — A Case Study (JRC, JvdP), pp. 250–265.
- IFM-2007-CalameIPS #debugging
- Bug Hunting with False Negatives (JRC, NI, JvdP, NS), pp. 98–117.
- TACAS-2007-BlomCLOPPDW #analysis #case study #distributed
- Distributed Analysis with µCRL: A Compendium of Case Studies (SB, JRC, BL, SO, JP, JvdP, MTD, AW), pp. 683–689.
- FATES-2005-BlomIPRS #testing
- Simulated Time for Testing Railway Interlockings with TTCN-3 (SB, NI, JvdP, AR, NS), pp. 1–15.
- RTA-2005-PolZ
- Generalized Innermost Rewriting (JvdP, HZ), pp. 2–16.
- SEFM-2004-PangPE #abstraction #parallel #process
- Abstraction of Parallel Uniform Processes with Data (JP, JvdP, MVE), pp. 14–23.
- CAV-2002-BlomP #confluence #proving #reduction
- State Space Reduction by Proving Confluence (SB, JvdP), pp. 596–609.
- RTA-2002-Pol #named
- JITty: A Rewriter with Strategy Annotations (JvdP), pp. 367–370.
- SAC-2002-HoomanP #architecture #distributed #replication #verification
- Formal verification of replication on a distributed data space architecture (JH, JvdP), pp. 351–358.
- CAV-2001-BlomFGLLP #algebra #named #specification #tool support
- µCRL: A Toolset for Analysing Algebraic Specifications (SB, WF, JFG, IvL, BL, JvdP), pp. 250–254.
- IFM-1999-PolHJ #behaviour #composition #specification
- Modular Formal Specification of Data and Behaviour (JvdP, JH, EDdJ), pp. 109–128.
- TLCA-1995-PolS #proving #strict #termination
- Strict Functionals for Termination Proofs (JvdP, HS), pp. 350–364.