default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Lonsing
Person information
- affiliation (former): Stanford University, USA
- affiliation (former): TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c34]Saranyu Chattopadhyay
, Keerthikumara Devarajegowda, Bihan Zhao, Florian Lonsing, Brandon A. D'Agostino, Ioanna Vavelidou, Vijay Deep Bhatt, Sebastian Prebeck, Wolfgang Ecker, Caroline Trippel, Clark W. Barrett, Subhasish Mitra:
G-QED: Generalized QED Pre-silicon Verification beyond Non-Interfering Hardware Accelerators. DAC 2023: 1-6- [c33]Haoze Wu, Christopher Hahn, Florian Lonsing, Makai Mann, Raghuram Ramanujan, Clark W. Barrett:
Lightweight Online Learning for Sets of Related Problems in Automated Reasoning. FMCAD 2023: 1-11 - [i18]Haoze Wu, Christopher Hahn, Florian Lonsing, Makai Mann, Raghuram Ramanujan, Clark W. Barrett:
Lightweight Online Learning for Sets of Related Problems in Automated Reasoning. CoRR abs/2305.11087 (2023) - 2021
- [j7]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. Formal Methods Syst. Des. 57(2): 157-177 (2021) - [c32]Makai Mann, Ahmed Irfan, Florian Lonsing, Yahan Yang, Hongce Zhang, Kristopher Brown, Aarti Gupta, Clark W. Barrett:
Pono: A Flexible and Extensible SMT-Based Model Checker. CAV (2) 2021: 461-474 - [c31]Saranyu Chattopadhyay, Florian Lonsing, Luca Piccolboni, Deepraj Soni, Peng Wei, Xiaofan Zhang, Yuan Zhou, Luca P. Carloni, Deming Chen, Jason Cong, Ramesh Karri, Zhiru Zhang, Caroline Trippel, Clark W. Barrett, Subhasish Mitra:
Scaling Up Hardware Accelerator Verification using A-QED with Functional Decomposition. FMCAD 2021: 42-52 - [p2]Olaf Beyersdorff, Mikolás Janota, Florian Lonsing, Martina Seidl:
Quantified Boolean Formulas. Handbook of Satisfiability 2021: 1177-1221 - [i17]Karthik Ganesan, Florian Lonsing, Srinivasa Shashank Nuthakki, Eshan Singh, Mohammad Rahmani Fadiheh, Wolfgang Kunz, Dominik Stoffel, Clark W. Barrett, Subhasish Mitra:
Effective Pre-Silicon Verification of Processor Cores by Breaking the Bounds of Symbolic Quick Error Detection. CoRR abs/2106.10392 (2021) - [i16]Saranyu Chattopadhyay, Florian Lonsing, Luca Piccolboni, Deepraj Soni, Peng Wei, Xiaofan Zhang, Yuan Zhou, Luca P. Carloni, Deming Chen, Jason Cong, Ramesh Karri, Zhiru Zhang, Caroline Trippel, Clark W. Barrett, Subhasish Mitra:
Scaling Up Hardware Accelerator Verification using A-QED with Functional Decomposition. CoRR abs/2108.06081 (2021) - 2020
- [c30]Eshan Singh, Florian Lonsing, Saranyu Chattopadhyay, Maxwell Strange, Peng Wei, Xiaofan Zhang, Yuan Zhou, Deming Chen, Jason Cong, Priyanka Raina, Zhiru Zhang, Clark W. Barrett, Subhasish Mitra:
A-QED Verification of Hardware Accelerators. DAC 2020: 1-6 - [c29]Florian Lonsing, Subhasish Mitra, Clark W. Barrett:
A Theoretical Framework for Symbolic Quick Error Detection. FMCAD 2020: 1-10 - [i15]Florian Lonsing, Subhasish Mitra, Clark W. Barrett:
A Theoretical Framework for Symbolic Quick Error Detection. CoRR abs/2006.05449 (2020)
2010 – 2019
- 2019
- [j6]Florian Lonsing:
QBFRelay, QRATPre+, and DepQBF: Incremental Preprocessing Meets Search-Based QBF Solving. J. Satisf. Boolean Model. Comput. 11(1): 211-220 (2019) - [c28]Florian Lonsing, Karthik Ganesan, Makai Mann, Srinivasa Shashank Nuthakki, Eshan Singh, Mario Srouji, Yahan Yang, Subhasish Mitra, Clark W. Barrett:
Unlocking the Power of Formal Hardware Verification with CoSA and Symbolic QED: Invited Paper. ICCAD 2019: 1-8 - [c27]Florian Lonsing, Uwe Egly:
QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties. SAT 2019: 203-210 - [i14]Florian Lonsing, Uwe Egly:
QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties. CoRR abs/1904.12927 (2019) - 2018
- [c26]Florian Lonsing, Uwe Egly:
QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property. IJCAR 2018: 161-177 - [c25]Florian Lonsing, Uwe Egly:
Evaluating QBF Solvers: Quantifier Alternations Matter. CP 2018: 276-294 - [c24]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Expansion-Based QBF Solving Without Recursion. FMCAD 2018: 1-10 - [p1]Florian Lonsing, Martina Seidl:
Parallel Solving of Quantified Boolean Formulas. Handbook of Parallel Constraint Reasoning 2018: 101-139 - [i13]Florian Lonsing, Uwe Egly:
QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property. CoRR abs/1804.02908 (2018) - [i12]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Expansion-Based QBF Solving Without Recursion. CoRR abs/1807.08964 (2018) - 2017
- [j5]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant planning as a case study of incremental QBF solving. Ann. Math. Artif. Intell. 80(1): 21-45 (2017) - [c23]Florian Lonsing, Uwe Egly:
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL. CADE 2017: 371-384 - [i11]Florian Lonsing, Uwe Egly:
Evaluating QBF Solvers: Quantifier Alternations Matter. CoRR abs/1701.06612 (2017) - [i10]Florian Lonsing, Uwe Egly:
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL. CoRR abs/1702.08256 (2017) - 2016
- [j4]Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBF Gallery: Behind the scenes. Artif. Intell. 237: 92-114 (2016) - [c22]Florian Lonsing, Uwe Egly, Martina Seidl:
Q-Resolution with Generalized Axioms. SAT 2016: 435-452 - [c21]Tomás Balyo, Florian Lonsing:
HordeQBF: A Modular and Massively Parallel QBF Solver. SAT 2016: 531-538 - [e1]Florian Lonsing, Martina Seidl:
Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), Bordeaux, France, July 4, 2016. CEUR Workshop Proceedings 1719, CEUR-WS.org 2016 [contents] - [i9]Tomás Balyo, Florian Lonsing:
HordeQBF: A Modular and Massively Parallel QBF Solver. CoRR abs/1604.03793 (2016) - [i8]Florian Lonsing, Uwe Egly, Martina Seidl:
Q-Resolution with Generalized Axioms. CoRR abs/1604.05994 (2016) - [i7]Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing, Martina Seidl:
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications. CoRR abs/1604.06204 (2016) - 2015
- [j3]Marijn Heule, Matti Järvisalo, Florian Lonsing, Martina Seidl, Armin Biere:
Clause Elimination for SAT and QSAT. J. Artif. Intell. Res. 53: 127-168 (2015) - [c20]Uwe Egly, Florian Lonsing, Johannes Oetsch:
Automated Benchmarking of Incremental SAT and QBF Solvers. LPAR 2015: 178-186 - [c19]Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl:
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. LPAR 2015: 418-433 - [c18]Florian Lonsing, Uwe Egly:
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API. SAT 2015: 191-198 - [i6]Florian Lonsing, Uwe Egly:
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API. CoRR abs/1502.02484 (2015) - [i5]Uwe Egly, Florian Lonsing, Johannes Oetsch:
Automated Benchmarking of Incremental SAT and QBF Solvers. CoRR abs/1506.08563 (2015) - [i4]Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBF Gallery: Behind the Scenes. CoRR abs/1508.01045 (2015) - 2014
- [j2]Mikolas Janota, Charles Jordan, Will Klieber, Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games. J. Satisf. Boolean Model. Comput. 9(1): 187-206 (2014) - [c17]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant Planning as a Case Study of Incremental QBF Solving. AISC 2014: 120-131 - [c16]Florian Lonsing, Uwe Egly:
Incremental QBF Solving. CP 2014: 514-530 - [c15]Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing:
SAT-based methods for circuit synthesis. FMCAD 2014: 31-34 - [c14]Florian Lonsing, Uwe Egly:
Incremental QBF Solving by DepQBF. ICMS 2014: 307-314 - [c13]Charles Jordan, Lukasz Kaiser, Florian Lonsing, Martina Seidl:
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing. SAT 2014: 430-437 - [i3]Florian Lonsing, Uwe Egly:
Incremental QBF Solving. CoRR abs/1402.2410 (2014) - [i2]Uwe Egly, Martin Kronegger, Florian Lonsing, Andreas Pfandler:
Conformant Planning as a Case Study of Incremental QBF Solving. CoRR abs/1405.7253 (2014) - [i1]Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing:
SAT-Based Methods for Circuit Synthesis. CoRR abs/1408.2333 (2014) - 2013
- [c12]Uwe Egly, Florian Lonsing, Magdalena Widl:
Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving. LPAR 2013: 291-308 - [c11]Florian Lonsing, Uwe Egly, Allen Van Gelder:
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. SAT 2013: 100-115 - 2012
- [c10]Martina Seidl, Florian Lonsing, Armin Biere:
qbf2epr: A Tool for Generating EPR Formulas from QBF. PAAR@IJCAR 2012: 139-148 - [c9]Allen Van Gelder, Samuel B. Wood, Florian Lonsing:
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas. SAT 2012: 86-99 - [c8]Aina Niemetz, Mathias Preiner, Florian Lonsing, Martina Seidl, Armin Biere:
Resolution-Based Certificate Extraction for QBF - (Tool Presentation). SAT 2012: 430-435 - 2011
- [c7]Armin Biere, Florian Lonsing, Martina Seidl:
Blocked Clause Elimination for QBF. CADE 2011: 101-115 - [c6]Florian Lonsing, Armin Biere:
Failed Literal Detection for QBF. SAT 2011: 259-272 - 2010
- [j1]Florian Lonsing, Armin Biere:
DepQBF: A Dependency-Aware QBF Solver. J. Satisf. Boolean Model. Comput. 7(2-3): 71-76 (2010) - [c5]Robert Brummayer, Florian Lonsing, Armin Biere:
Automated Testing and Debugging of SAT and QBF Solvers. SAT 2010: 44-57 - [c4]Florian Lonsing, Armin Biere:
Integrating Dependency Schemes in Search-Based QBF Solvers. SAT 2010: 158-171
2000 – 2009
- 2009
- [c3]Florian Lonsing, Armin Biere:
A Compact Representation for Syntactic Dependencies in QBFs. SAT 2009: 398-411 - 2008
- [c2]Florian Lonsing, Armin Biere:
Nenofex: Expanding NNF for QBF Solving. SAT 2008: 196-210 - [c1]Florian Lonsing, Armin Biere:
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers. MEMICS 2008: 83-95
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-05-08 21:45 CEST 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:
