Florian Lonsing
Orcid: 0000000257157231Affiliations:
 Stanford University, USA (former)
 TU Wien, Vienna, Austria (former)
According to our database^{1},
Florian Lonsing
authored at least 44 papers
between 2008 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2023
Proceedings of the Formal Methods in ComputerAided Design, 2023
GQED: Generalized QED Presilicon Verification beyond NonInterfering Hardware Accelerators.
Proceedings of the 60th ACM/IEEE Design Automation Conference, 2023
2021
Proceedings of the Handbook of Satisfiability  Second Edition, 2021
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations.
Formal Methods Syst. Des., 2021
Effective PreSilicon Verification of Processor Cores by Breaking the Bounds of Symbolic Quick Error Detection.
CoRR, 2021
Scaling Up Hardware Accelerator Verification using AQED with Functional Decomposition.
Proceedings of the Formal Methods in Computer Aided Design, 2021
Proceedings of the Computer Aided Verification  33rd International Conference, 2021
2020
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020
Proceedings of the 57th ACM/IEEE Design Automation Conference, 2020
2019
QBFRelay, QRATPre+, and DepQBF: Incremental Preprocessing Meets SearchBased QBF Solving.
J. Satisf. Boolean Model. Comput., 2019
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2019, 2019
Unlocking the Power of Formal Hardware Verification with CoSA and Symbolic QED: Invited Paper.
Proceedings of the International Conference on ComputerAided Design, 2019
2018
Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018
Proceedings of the Principles and Practice of Constraint Programming, 2018
Proceedings of the Automated Reasoning  9th International Joint Conference, 2018
Proceedings of the Handbook of Parallel Constraint Reasoning., 2018
2017
Ann. Math. Artif. Intell., 2017
Proceedings of the Automated Deduction  CADE 26, 2017
2016
CoRR, 2016
Artif. Intell., 2016
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2016, 2016
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2016, 2016
2015
J. Artif. Intell. Res., 2015
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API.
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2015, 2015
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015
2014
J. Satisf. Boolean Model. Comput., 2014
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2014, 2014
Proceedings of the Mathematical Software  ICMS 2014, 2014
Proceedings of the Formal Methods in ComputerAided Design, 2014
Proceedings of the Principles and Practice of Constraint Programming, 2014
2013
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation.
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2013, 2013
LongDistance Resolution: Proof Generation and Strategy Extraction in SearchBased QBF Solving.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013
2012
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2012, 2012
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2012, 2012
Proceedings of the Third Workshop on Practical Aspects of Automated Reasoning, 2012
2011
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2011, 2011
Proceedings of the Automated Deduction  CADE23  23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011
2010
J. Satisf. Boolean Model. Comput., 2010
Proceedings of the Theory and Applications of Satisfiability Testing, 2010
Proceedings of the Theory and Applications of Satisfiability Testing, 2010
2009
Proceedings of the Theory and Applications of Satisfiability Testing, 2009
2008
Efficiently Representing Existential Dependency Sets for Expansionbased QBF Solvers.
Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2008
Proceedings of the Theory and Applications of Satisfiability Testing, 2008