Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Lukas Bulwahn
@article{DBLP:journals/afp/KappelmannBW21, author = {Kevin Kappelmann and Lukas Bulwahn and Sebastian Willenbrink}, title = {SpecCheck - Specification-Based Testing for Isabelle/ML}, journal = {Arch. Formal Proofs}, volume = {2021}, year = {2021}, url = {https://www.isa-afp.org/entries/SpecCheck.html}, timestamp = {Fri, 16 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/KappelmannBW21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ccsw-ws/RamsauerBLM20, author = {Ralf Ramsauer and Lukas Bulwahn and Daniel Lohmann and Wolfgang Mauerer}, editor = {Yinqian Zhang and Radu Sion}, title = {The Sound of Silence: Mining Security Vulnerabilities from Secret Integration Channels in Open-Source Projects}, booktitle = {CCSW'20, Proceedings of the 2020 {ACM} {SIGSAC} Conference on Cloud Computing Security Workshop, Virtual Event, USA, November 9, 2020}, pages = {147--157}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3411495.3421360}, doi = {10.1145/3411495.3421360}, timestamp = {Thu, 12 Oct 2023 12:32:08 +0200}, biburl = {https://dblp.org/rec/conf/ccsw-ws/RamsauerBLM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2009-01694, author = {Ralf Ramsauer and Lukas Bulwahn and Daniel Lohmann and Wolfgang Mauerer}, title = {The Sound of Silence: Mining Security Vulnerabilities from Secret Integration Channels in Open-Source Projects}, journal = {CoRR}, volume = {abs/2009.01694}, year = {2020}, url = {https://arxiv.org/abs/2009.01694}, eprinttype = {arXiv}, eprint = {2009.01694}, timestamp = {Wed, 16 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2009-01694.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn17, author = {Lukas Bulwahn}, title = {Stewart's Theorem and Apollonius' Theorem}, journal = {Arch. Formal Proofs}, volume = {2017}, year = {2017}, url = {https://www.isa-afp.org/entries/Stewart\_Apollonius.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn17a, author = {Lukas Bulwahn}, title = {The Falling Factorial of a Sum}, journal = {Arch. Formal Proofs}, volume = {2017}, year = {2017}, url = {https://www.isa-afp.org/entries/Falling\_Factorial\_Sum.html}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn17a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/BulwahnE17, author = {Lukas Bulwahn and Manuel Eberl}, title = {Bernoulli Numbers}, journal = {Arch. Formal Proofs}, volume = {2017}, year = {2017}, url = {https://www.isa-afp.org/entries/Bernoulli.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/BulwahnE17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:journals/corr/abs-1709-02126, editor = {Lukas Bulwahn and Maryam Kamali and Sven Linker}, title = {Proceedings First Workshop on Formal Verification of Autonomous Vehicles, FVAV@iFM 2017, Turin, Italy, 19th September 2017}, series = {{EPTCS}}, volume = {257}, year = {2017}, url = {http://arxiv.org/abs/1709.02126}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1709-02126.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn16, author = {Lukas Bulwahn}, title = {Cardinality of Number Partitions}, journal = {Arch. Formal Proofs}, volume = {2016}, year = {2016}, url = {https://www.isa-afp.org/entries/Card\_Number\_Partitions.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn16a, author = {Lukas Bulwahn}, title = {Spivey's Generalized Recurrence for Bell Numbers}, journal = {Arch. Formal Proofs}, volume = {2016}, year = {2016}, url = {https://www.isa-afp.org/entries/Bell\_Numbers\_Spivey.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn16b, author = {Lukas Bulwahn}, title = {Cardinality of Equivalence Relations}, journal = {Arch. Formal Proofs}, volume = {2016}, year = {2016}, url = {https://www.isa-afp.org/entries/Card\_Equiv\_Relations.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn16b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn16c, author = {Lukas Bulwahn}, title = {Cardinality of Multisets}, journal = {Arch. Formal Proofs}, volume = {2016}, year = {2016}, url = {https://www.isa-afp.org/entries/Card\_Multisets.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn16c.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn16d, author = {Lukas Bulwahn}, title = {Ptolemy's Theorem}, journal = {Arch. Formal Proofs}, volume = {2016}, year = {2016}, url = {https://www.isa-afp.org/entries/Ptolemys\_Theorem.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn16d.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn16e, author = {Lukas Bulwahn}, title = {Intersecting Chords Theorem}, journal = {Arch. Formal Proofs}, volume = {2016}, year = {2016}, url = {https://www.isa-afp.org/entries/Chord\_Segments.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn16e.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn16f, author = {Lukas Bulwahn}, title = {The Twelvefold Way}, journal = {Arch. Formal Proofs}, volume = {2016}, year = {2016}, url = {https://www.isa-afp.org/entries/Twelvefold\_Way.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn16f.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn15, author = {Lukas Bulwahn}, title = {Derangements Formula}, journal = {Arch. Formal Proofs}, volume = {2015}, year = {2015}, url = {https://www.isa-afp.org/entries/Derangements.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn15a, author = {Lukas Bulwahn}, title = {Euler's Partition Theorem}, journal = {Arch. Formal Proofs}, volume = {2015}, year = {2015}, url = {https://www.isa-afp.org/entries/Euler\_Partition.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/afp/Bulwahn15b, author = {Lukas Bulwahn}, title = {Cardinality of Set Partitions}, journal = {Arch. Formal Proofs}, volume = {2015}, year = {2015}, url = {https://www.isa-afp.org/entries/Card\_Partitions.shtml}, timestamp = {Mon, 25 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/afp/Bulwahn15b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/safecomp/TrindadeBA14, author = {Raphael Fonte Boa Trindade and Lukas Bulwahn and Christoph Ainhauser}, editor = {Andrea Bondavalli and Felicita Di Giandomenico}, title = {Automatically Generated Safety Mechanisms from Semi-Formal Software Safety Requirements}, booktitle = {Computer Safety, Reliability, and Security - 33rd International Conference, {SAFECOMP} 2014, Florence, Italy, September 10-12, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8666}, pages = {278--293}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-10506-2\_19}, doi = {10.1007/978-3-319-10506-2\_19}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/safecomp/TrindadeBA14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/dnb/Bulwahn12, author = {Lukas Bulwahn}, title = {Counterexample generation for higher-order logic using functional and logic programming}, school = {Technical University Munich}, year = {2012}, url = {https://nbn-resolving.org/urn:nbn:de:bvb:91-diss-20130326-1115870-0-3}, urn = {urn:nbn:de:bvb:91-diss-20130326-1115870-0-3}, timestamp = {Sat, 17 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/dnb/Bulwahn12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpp/Bulwahn12, author = {Lukas Bulwahn}, editor = {Chris Hawblitzel and Dale Miller}, title = {The New Quickcheck for Isabelle - Random, Exhaustive and Symbolic Testing under One Roof}, booktitle = {Certified Programs and Proofs - Second International Conference, {CPP} 2012, Kyoto, Japan, December 13-15, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7679}, pages = {92--108}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35308-6\_10}, doi = {10.1007/978-3-642-35308-6\_10}, timestamp = {Wed, 07 Dec 2022 23:14:04 +0100}, biburl = {https://dblp.org/rec/conf/cpp/Bulwahn12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lpar/Bulwahn12, author = {Lukas Bulwahn}, editor = {Nikolaj S. Bj{\o}rner and Andrei Voronkov}, title = {Smart Testing of Functional Programs in Isabelle}, booktitle = {Logic for Programming, Artificial Intelligence, and Reasoning - 18th International Conference, LPAR-18, M{\'{e}}rida, Venezuela, March 11-15, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7180}, pages = {153--167}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-28717-6\_14}, doi = {10.1007/978-3-642-28717-6\_14}, timestamp = {Thu, 14 Apr 2022 20:26:15 +0200}, biburl = {https://dblp.org/rec/conf/lpar/Bulwahn12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/frocos/BlanchetteBN11, author = {Jasmin Christian Blanchette and Lukas Bulwahn and Tobias Nipkow}, editor = {Cesare Tinelli and Viorica Sofronie{-}Stokkermans}, title = {Automatic Proof and Disproof in Isabelle/HOL}, booktitle = {Frontiers of Combining Systems, 8th International Symposium, FroCoS 2011, Saarbr{\"{u}}cken, Germany, October 5-7, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6989}, pages = {12--27}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-24364-6\_2}, doi = {10.1007/978-3-642-24364-6\_2}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/frocos/BlanchetteBN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iclp/Bulwahn11, author = {Lukas Bulwahn}, editor = {John P. Gallagher and Michael Gelfond}, title = {Smart test data generators via logic programming}, booktitle = {Technical Communications of the 27th International Conference on Logic Programming, {ICLP} 2011, July 6-10, 2011, Lexington, Kentucky, {USA}}, series = {LIPIcs}, volume = {11}, pages = {139--150}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2011}, url = {https://doi.org/10.4230/LIPIcs.ICLP.2011.139}, doi = {10.4230/LIPICS.ICLP.2011.139}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/iclp/Bulwahn11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/itp/LochbihlerB11, author = {Andreas Lochbihler and Lukas Bulwahn}, editor = {Marko C. J. D. van Eekelen and Herman Geuvers and Julien Schmaltz and Freek Wiedijk}, title = {Animating the Formalised Semantics of a Java-Like Language}, booktitle = {Interactive Theorem Proving - Second International Conference, {ITP} 2011, Berg en Dal, The Netherlands, August 22-25, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6898}, pages = {216--232}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22863-6\_17}, doi = {10.1007/978-3-642-22863-6\_17}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/itp/LochbihlerB11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/Bulwahn10, author = {Lukas Bulwahn}, editor = {Kai Bollue and Dominique G{\"{u}}ckel and Ulrich Loup and Jacob Sp{\"{o}}nemann and Melanie Winkler}, title = {Counterexample Generation for Higher-order Logic Using Logic Programming}, booktitle = {Proceedings of the Joint Workshop of the German Research Training Groups in Computer Science, Algorithmic synthesis of reactive and discrete-continuous systems, AlgoSyn 2010, May 31 - June 2, 2010}, pages = {146}, publisher = {Verlagshaus Mainz, Aachen, Germany}, year = {2010}, timestamp = {Tue, 03 Mar 2020 17:20:41 +0100}, biburl = {https://dblp.org/rec/conf/dagstuhl/Bulwahn10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tphol/BerghoferBH09, author = {Stefan Berghofer and Lukas Bulwahn and Florian Haftmann}, editor = {Stefan Berghofer and Tobias Nipkow and Christian Urban and Makarius Wenzel}, title = {Turning Inductive into Equational Specifications}, booktitle = {Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, August 17-20, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5674}, pages = {131--146}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03359-9\_11}, doi = {10.1007/978-3-642-03359-9\_11}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/tphol/BerghoferBH09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tphol/BulwahnKHEM08, author = {Lukas Bulwahn and Alexander Krauss and Florian Haftmann and Levent Erk{\"{o}}k and John Matthews}, editor = {Otmane A{\"{\i}}t Mohamed and C{\'{e}}sar A. Mu{\~{n}}oz and Sofi{\`{e}}ne Tahar}, title = {Imperative Functional Programming with Isabelle/HOL}, booktitle = {Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5170}, pages = {134--149}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-71067-7\_14}, doi = {10.1007/978-3-540-71067-7\_14}, timestamp = {Mon, 26 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/tphol/BulwahnKHEM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tphol/BulwahnKN07, author = {Lukas Bulwahn and Alexander Krauss and Tobias Nipkow}, editor = {Klaus Schneider and Jens Brandt}, title = {Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL}, booktitle = {Theorem Proving in Higher Order Logics, 20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4732}, pages = {38--53}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74591-4\_5}, doi = {10.1007/978-3-540-74591-4\_5}, timestamp = {Mon, 26 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/tphol/BulwahnKN07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.