Ontological Metamodeling with Explicit Instantiation. - Alfons Laarman; Ivan Kurtev (SLE, 2009)

Boosting multi-core reachability performance with shared hash tables. - Alfons Laarman; Jaco van de Pol; Michael Weber 002 (FMCAD, 2010)

Multi-core Nested Depth-First Search. - Alfons Laarman; Rom Langerak; Jaco van de Pol; Michael Weber 002; Anton Wijs (ATVA, 2011)

A Parallel Compact Hash Table. - Steven van der Vegt; Alfons Laarman (MEMICS, 2011)

Multi-Core LTSmin: Marrying Modularity and Scalability. - Alfons Laarman; Jaco van de Pol; Michael Weber 002 (NASA Formal Methods, 2011)

Parallel Recursive State Compression for Free. - Alfons Laarman; Jaco van de Pol; Michael Weber 002 (SPIN, 2011)

Variations on Multi-Core Nested Depth-First Search - Alfons Laarman; Jaco van de Pol (PDMC, 2011)

Improved Multi-Core Nested Depth-First Search. - Sami Evangelista; Alfons Laarman; Laure Petrucci; Jaco van de Pol (ATVA, 2012)

Multi-core Reachability for Timed Automata. - Andreas Engelbredt Dalsgaard; Alfons Laarman; Kim G. Larsen; Mads Chr. Olesen; Jaco van de Pol (FORMATS, 2012)

Multi-core and/or Symbolic Model Checking. - Tom van Dijk; Alfons Laarman; Jaco van de Pol (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2012)

SpinS: Extending LTSmin with Promela through SpinJa. - Freark I. van der Berg; Alfons Laarman (PASM/PDMC, 2012)

Multi-Core BDD Operations for Symbolic Reachability. - Tom van Dijk; Alfons Laarman; Jaco van de Pol (PASM/PDMC, 2012)

Multi-core Emptiness Checking of Timed Büchi Automata Using Inclusion Abstraction. - Alfons Laarman; Mads Chr. Olesen; Andreas Engelbredt Dalsgaard; Kim Guldstrand Larsen; Jaco van de Pol (CAV, 2013)

Improved on-the-Fly Livelock Detection. - Alfons Laarman; David Faragó (NASA Formal Methods, 2013)

Guard-Based Partial-Order Reduction. - Alfons Laarman; Elwin Pater; Jaco van de Pol; Michael Weber 002 (SPIN, 2013)

Partial-Order Reduction for Multi-core LTL Model Checking. - Alfons Laarman; Anton Wijs (Haifa Verification Conference, 2014)

Scalable multi-core model checking. - Alfons Laarman (2014)

LTSmin: High-Performance Language-Independent Model Checking. - Gijs Kant; Alfons Laarman; Jeroen Meijer; Jaco van de Pol; Stefan Blom; Tom van Dijk (TACAS, 2015)

Multi-core on-the-fly SCC decomposition. - Vincent Bloemen; Alfons Laarman; Jaco van de Pol (PPoPP, 2016)

Vienna Verification Tool: IC3 for Parallel Software - (Competition Contribution). - Henning Günther; Alfons Laarman; Georg Weissenbacher (TACAS, 2016)

Guard-based partial-order reduction. - Alfons Laarman; Elwin Pater; Jaco van de Pol; Henri Hansen (Int. J. Softw. Tools Technol. Transf., 2016)

Dynamic Reductions for Model Checking Concurrent Software. - Henning Günther; Alfons Laarman; Ana Sokolova; Georg Weissenbacher (VMCAI, 2017)

Parallel Model Checking Algorithms for Linear-Time Temporal Logic. - Jiri Barnat; Vincent Bloemen; Alexandre Duret-Lutz; Alfons Laarman; Laure Petrucci; Jaco van de Pol; Etienne Renault (Handbook of Parallel Constraint Reasoning, 2018)

Optimal Storage of Combinatorial State Spaces. - Alfons Laarman (NFM, 2018)

Stubborn Transaction Reduction. - Alfons Laarman (NFM, 2018)

Parallel Probabilistic Inference by Weighted Model Counting. - Giso H. Dal; Alfons W. Laarman; Peter J. F. Lucas (PGM, 2018)

Stubborn Transaction Reduction (with Proofs). - Alfons Laarman (CoRR, 2018)

A Parallel Relation-Based Algorithm for Symbolic Bisimulation Minimization. - Richard Huybers; Alfons Laarman (VMCAI, 2019)

Optimal compression of combinatorial state spaces. - Alfons Laarman (Innov. Syst. Softw. Eng., 2019)

Symbolic Model Checking with Sentential Decision Diagrams. - Lieuwe Vinkhuijzen; Alfons Laarman (SETTA, 2020)

Hybrid divide-and-conquer approach for tree search algorithms. - Mathys Rennela; Alfons Laarman; Vedran Dunjko (CoRR, 2020)

A compositional approach to probabilistic knowledge compilation. - Giso H. Dal; Alfons W. Laarman; Arjen Hommersom; Peter J. F. Lucas (Int. J. Approx. Reason., 2021)

The Power of Disjoint Support Decompositions in Decision Diagrams. - Lieuwe Vinkhuijzen; Alfons Laarman (NFM, 2022)

FM 2023 Artefact for "A Decision Diagram Operation for Reachability". - Sebastiaan Brand; Thomas Bäck; Alfons Laarman (Zenodo, 2022)

Fast Equivalence Checking of Quantum Circuits of Clifford Gates. - Dimitrios Thanos; Tim Coopmans; Alfons Laarman (ATVA, 2023)

A Decision Diagram Operation for Reachability. - Sebastiaan Brand; Thomas Bäck; Alfons Laarman (FM, 2023)

Incremental Property Directed Reachability. - Max Blankestijn; Alfons Laarman (ICFEM, 2023)

Optimizing Quantum Space Using Spooky Pebble Games. - Arend-Jan Quist; Alfons Laarman (RC, 2023)

Quantum Graph-State Synthesis with SAT. - Sebastiaan Brand; Tim Coopmans; Alfons Laarman (POS@SAT, 2023)

ParaGnosis: A Tool for Parallel Knowledge Compilation. - Giso H. Dal; Alfons Laarman; Peter J. F. Lucas (SPIN, 2023)

Efficient Implementation of LIMDDs for Quantum Circuit Simulation. - Lieuwe Vinkhuijzen; Thomas Grurl; Stefan Hillmich; Sebastiaan Brand; Robert Wille; Alfons Laarman (SPIN, 2023)

Introduction to the special issue for SPIN 2021. - Alfons Laarman; Ana Sokolova (Int. J. Softw. Tools Technol. Transf., 2023)

Hybrid divide-and-conquer approach for tree search algorithms. - Mathys Rennela; Sebastiaan Brand; Alfons Laarman; Vedran Dunjko (Quantum, 2023)

LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States. - Lieuwe Vinkhuijzen; Tim Coopmans; David Elkouss; Vedran Dunjko; Alfons Laarman (Quantum, 2023)

Simulating Quantum Circuits by Model Counting. - Jingyi Mei; Marcello M. Bonsangue; Alfons Laarman (CAV (3), 2024)

Compact Parallel Hash Tables on the GPU. - Steef Hegeman; Daan Wöltgens; Anton Wijs; Alfons Laarman (Euro-Par (2), 2024)

Advancing Quantum Computing with Formal Methods. - Arend-Jan Quist; Jingyi Mei; Tim Coopmans; Alfons Laarman (FM (2), 2024)

Enriching Diagrams with Algebraic Operations. - Alejandro Villoria; Henning Basold; Alfons Laarman (FoSSaCS (1), 2024)

Disentangling the Gap Between Quantum and #SAT. - Jingyi Mei; Jan Martens 001; Alfons Laarman (ICTAC, 2024)

Equivalence Checking of Quantum Circuits by Model Counting. - Jingyi Mei; Tim Coopmans; Marcello M. Bonsangue; Alfons Laarman (IJCAR (2), 2024)

Optimizing Causal Interventions in Hybrid Bayesian Networks - A Discretization, Knowledge Compilation, and Heuristic Optimization Approach. - Maarten C. Vonk; Diederick Vermetten; Jacob de Nobel; Sebastiaan Brand; Ninoslav Malekovic; Thomas Bäck; Alfons Laarman; Anna V. Kononova (IPMU (1), 2024)

Balancing Computational Cost and Accuracy in Inference of Continuous Bayesian Networks. - Maarten C. Vonk; Sebastiaan Brand; Ninoslav Malekovic; Thomas Bäck; Alfons Laarman; Anna V. Kononova (PGM, 2024)

Automated Reasoning in Quantum Circuit Compilation. - Dimitrios Thanos; Alejandro Villoria; Sebastiaan Brand; Arend-Jan Quist; Jingyi Mei; Tim Coopmans; Alfons Laarman (SPIN, 2024)

A Knowledge Compilation Map for Quantum Information. - Lieuwe Vinkhuijzen; Tim Coopmans; Alfons Laarman (CoRR, 2024)

Trade-offs between classical and quantum space using spooky pebbling. - Arend-Jan Quist; Alfons Laarman (CoRR, 2024)

Reducing Quantum Circuit Synthesis to #SAT. - Dekel Zak; Jingyi Mei; Jean-Marie Lagniez; Alfons Laarman (CP, 2025)

Numerical Errors in Quantitative System Analysis With Decision Diagrams. - Sebastiaan Brand; Arend-Jan Quist; Richard M. K. van Dijk; Alfons Laarman (QEST+FORMATS, 2025)

Parallel Equivalence Checking of Stabilizer Quantum Circuits on GPUs. - Muhammad Osama 003; Dimitrios Thanos; Alfons Laarman (TACAS (3), 2025)

Uniformity within Parameterized Circuit Classes. - Steef Hegeman; Jan Martens 001; Alfons Laarman (CoRR, 2025)