default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfons Laarman
Person information
- affiliation: Leiden University, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c39]Jingyi Mei, Marcello M. Bonsangue, Alfons Laarman:
Simulating Quantum Circuits by Model Counting. CAV (3) 2024: 555-578- [c38]Steef Hegeman
, Daan Wöltgens, Anton Wijs, Alfons Laarman:
Compact Parallel Hash Tables on the GPU. Euro-Par (2) 2024: 226-241 - [c37]Arend-Jan Quist, Jingyi Mei, Tim Coopmans, Alfons Laarman:
Advancing Quantum Computing with Formal Methods. FM (2) 2024: 420-446 - [c36]Alejandro Villoria, Henning Basold, Alfons Laarman:
Enriching Diagrams with Algebraic Operations. FoSSaCS (1) 2024: 121-143 - [c35]Jingyi Mei, Jan Martens, Alfons Laarman:
Disentangling the Gap Between Quantum and #SAT. ICTAC 2024: 17-40 - [c34]Jingyi Mei, Tim Coopmans, Marcello M. Bonsangue, Alfons Laarman:
Equivalence Checking of Quantum Circuits by Model Counting. IJCAR (2) 2024: 401-421 - [c33]Dimitrios Thanos, Alejandro Villoria, Sebastiaan Brand, Arend-Jan Quist, Jingyi Mei, Tim Coopmans, Alfons Laarman:
Automated Reasoning in Quantum Circuit Compilation. SPIN 2024: 106-134 - [i14]Lieuwe Vinkhuijzen, Tim Coopmans, Alfons Laarman:
A Knowledge Compilation Map for Quantum Information. CoRR abs/2401.01322 (2024) - [i13]Arend-Jan Quist, Alfons Laarman:
Trade-offs between classical and quantum space using spooky pebbling. CoRR abs/2401.10579 (2024) - [i12]Jingyi Mei, Marcello M. Bonsangue, Alfons Laarman:
Simulating Quantum Circuits by Model Counting. CoRR abs/2403.07197 (2024) - [i11]Steef Hegeman, Daan Wöltgens, Anton Wijs, Alfons Laarman:
Compact Parallel Hash Tables on the GPU. CoRR abs/2406.09255 (2024) - 2023
- [j7]Mathys Rennela, Sebastiaan Brand, Alfons Laarman, Vedran Dunjko:
Hybrid divide-and-conquer approach for tree search algorithms. Quantum 7: 959 (2023) - [j6]Lieuwe Vinkhuijzen, Tim Coopmans, David Elkouss, Vedran Dunjko, Alfons Laarman:
LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States. Quantum 7: 1108 (2023) - [j5]Alfons Laarman, Ana Sokolova:
Introduction to the special issue for SPIN 2021. Int. J. Softw. Tools Technol. Transf. 25(1): 75-76 (2023) - [c32]Dimitrios Thanos, Tim Coopmans, Alfons Laarman:
Fast Equivalence Checking of Quantum Circuits of Clifford Gates. ATVA 2023: 199-216 - [c31]Sebastiaan Brand, Thomas Bäck, Alfons Laarman:
A Decision Diagram Operation for Reachability. FM 2023: 514-532 - [c30]Max Blankestijn, Alfons Laarman:
Incremental Property Directed Reachability. ICFEM 2023: 208-227 - [c29]Arend-Jan Quist, Alfons Laarman:
Optimizing Quantum Space Using Spooky Pebble Games. RC 2023: 134-149 - [c28]Sebastiaan Brand, Tim Coopmans, Alfons Laarman:
Quantum Graph-State Synthesis with SAT. POS@SAT 2023: 1-13 - [c27]Lieuwe Vinkhuijzen, Thomas Grurl, Stefan Hillmich, Sebastiaan Brand, Robert Wille, Alfons Laarman:
Efficient Implementation of LIMDDs for Quantum Circuit Simulation. SPIN 2023: 3-21 - [c26]Giso H. Dal, Alfons Laarman, Peter J. F. Lucas:
ParaGnosis: A Tool for Parallel Knowledge Compilation. SPIN 2023: 22-37 - [i10]Max Blankestijn, Alfons Laarman:
Incremental Property Directed Reachability. CoRR abs/2308.12162 (2023) - [i9]Sebastiaan Brand, Tim Coopmans, Alfons Laarman:
Quantum Graph-State Synthesis with SAT. CoRR abs/2309.03593 (2023) - [i8]Alejandro Villoria, Henning Basold, Alfons Laarman:
Enriching Diagrams with Algebraic Operations. CoRR abs/2310.11288 (2023) - 2022
- [c25]Lieuwe Vinkhuijzen, Alfons Laarman:
The Power of Disjoint Support Decompositions in Decision Diagrams. NFM 2022: 790-799 - [d1]Sebastiaan Brand, Thomas Bäck, Alfons Laarman:
FM 2023 Artefact for "A Decision Diagram Operation for Reachability". Zenodo, 2022
- [i7]Sebastiaan Brand, Thomas Bäck, Alfons Laarman:
A Decision Diagram Operation for Reachability. CoRR abs/2212.03684 (2022) - 2021
- [j4]Giso H. Dal, Alfons W. Laarman, Arjen Hommersom, Peter J. F. Lucas:
A compositional approach to probabilistic knowledge compilation. Int. J. Approx. Reason. 138: 38-66 (2021) - [e1]Alfons Laarman, Ana Sokolova:
Model Checking Software - 27th International Symposium, SPIN 2021, Virtual Event, July 12, 2021, Proceedings. Lecture Notes in Computer Science 12864, Springer 2021, ISBN 978-3-030-84628-2 [contents] - [i6]Lieuwe Vinkhuijzen, Tim Coopmans, David Elkouss, Vedran Dunjko, Alfons Laarman:
LIMDD A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States. CoRR abs/2108.00931 (2021) - 2020
- [c24]Lieuwe Vinkhuijzen, Alfons Laarman:
Symbolic Model Checking with Sentential Decision Diagrams. SETTA 2020: 124-142 - [i5]Mathys Rennela, Alfons Laarman, Vedran Dunjko:
Hybrid divide-and-conquer approach for tree search algorithms. CoRR abs/2007.07040 (2020)
2010 – 2019
- 2019
- [j3]Alfons Laarman:
Optimal compression of combinatorial state spaces. Innov. Syst. Softw. Eng. 15(3-4): 235-251 (2019) - [c23]Richard Huybers, Alfons Laarman:
A Parallel Relation-Based Algorithm for Symbolic Bisimulation Minimization. VMCAI 2019: 535-554 - 2018
- [c22]Alfons Laarman:
Optimal Storage of Combinatorial State Spaces. NFM 2018: 261-279 - [c21]Alfons Laarman:
Stubborn Transaction Reduction. NFM 2018: 280-298 - [c20]Giso H. Dal, Alfons W. Laarman, Peter J. F. Lucas:
Parallel Probabilistic Inference by Weighted Model Counting. PGM 2018: 97-108 - [p1]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 - [i4]Alfons Laarman:
Stubborn Transaction Reduction (with Proofs). CoRR abs/1802.02685 (2018) - 2017
- [c19]Henning Günther, Alfons Laarman, Ana Sokolova, Georg Weissenbacher:
Dynamic Reductions for Model Checking Concurrent Software. VMCAI 2017: 246-265 - 2016
- [j2]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) - [c18]Vincent Bloemen, Alfons Laarman, Jaco van de Pol:
Multi-core on-the-fly SCC decomposition. PPoPP 2016: 8:1-8:12 - [c17]Henning Günther, Alfons Laarman, Georg Weissenbacher:
Vienna Verification Tool: IC3 for Parallel Software - (Competition Contribution). TACAS 2016: 954-957 - [i3]Henning Günther, Alfons Laarman, Ana Sokolova, Georg Weissenbacher:
Dynamic Reductions for Model Checking Concurrent Software. CoRR abs/1611.09318 (2016) - 2015
- [c16]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 - 2014
- [b1]Alfons Laarman:
Scalable multi-core model checking. University of Twente, Enschede, Netherlands, 2014 - [c15]Alfons Laarman, Anton Wijs:
Partial-Order Reduction for Multi-core LTL Model Checking. Haifa Verification Conference 2014: 267-283 - 2013
- [c14]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 - [c13]Alfons Laarman, David Faragó:
Improved on-the-Fly Livelock Detection. NASA Formal Methods 2013: 32-47 - [c12]Alfons Laarman, Elwin Pater, Jaco van de Pol, Michael Weber:
Guard-Based Partial-Order Reduction. SPIN 2013: 227-245 - 2012
- [j1]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) - [c11]Sami Evangelista, Alfons Laarman, Laure Petrucci, Jaco van de Pol:
Improved Multi-Core Nested Depth-First Search. ATVA 2012: 269-283 - [c10]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 - [c9]Freark I. van der Berg, Alfons Laarman:
SpinS: Extending LTSmin with Promela through SpinJa. PASM/PDMC 2012: 95-105 - [c8]Tom van Dijk, Alfons Laarman, Jaco van de Pol:
Multi-Core BDD Operations for Symbolic Reachability. PASM/PDMC 2012: 127-143 - 2011
- [c7]Alfons Laarman, Rom Langerak, Jaco van de Pol, Michael Weber, Anton Wijs:
Multi-core Nested Depth-First Search. ATVA 2011: 321-335 - [c6]Steven van der Vegt, Alfons Laarman:
A Parallel Compact Hash Table. MEMICS 2011: 191-204 - [c5]Alfons Laarman, Jaco van de Pol, Michael Weber:
Multi-Core LTSmin: Marrying Modularity and Scalability. NASA Formal Methods 2011: 506-511 - [c4]Alfons Laarman, Jaco van de Pol, Michael Weber:
Parallel Recursive State Compression for Free. SPIN 2011: 38-56 - [c3]Alfons Laarman, Jaco van de Pol:
Variations on Multi-Core Nested Depth-First Search. PDMC 2011: 13-28 - [i2]Alfons Laarman, Jaco van de Pol, Michael Weber:
Parallel Recursive State Compression for Free. CoRR abs/1104.3119 (2011) - 2010
- [c2]Alfons Laarman, Jaco van de Pol, Michael Weber:
Boosting multi-core reachability performance with shared hash tables. FMCAD 2010: 247-255 - [i1]Alfons Laarman, Jaco van de Pol, Michael Weber:
Boosting Multi-Core Reachability Performance with Shared Hash Tables. CoRR abs/1004.2772 (2010)
2000 – 2009
- 2009
- [c1]Alfons Laarman, Ivan Kurtev:
Ontological Metamodeling with Explicit Instantiation. SLE 2009: 174-183
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-12-10 21: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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
