Norbert Manthey

dblp:35/8612 · DBLP profile ↗
← Back
13ranked-venue papers
4as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 11 · 4 first-author · 1 since 2021Theory of computation · 10 · 4 first-author · 1 since 2021Software engineering, systems software and programming languages · 3Graphics, computer vision, multimedia, augmented reality and games · 1
YearPublicationVenuePosition
2021 The MergeSat Solver
Norbert Manthey
SAT1
2020 Towards Faster Reasoners by Using Transparent Huge Pages
Johannes Klaus Fichte, Norbert Manthey, Julian Stecklina, André Schidler
CP2
2020 Using model checking tools to triage the severity of security bugs in the Xen hypervisor
abstract
In practice, few security bugs found in source code are urgent, but quickly identifying which ones are is hard.We describe the application of bounded model checking to triaging reported issues quickly at the cloud service provider Amazon Web Services (AWS).We focus on the job of reactive security experts who need to determine the severity of bugs found in the Xen hypervisor.We show that, using our publicly available extensions to the model checker CBMC, a security expert can obtain traces to construct security tests and estimate the severity of the reported finding within 15 minutes.We believe that the changes made to the model checker, as well as the methodology for using tools in this scenario, will generalise to other organisations and environments.
Byron Cook, Björn Döbel, Daniel Kroening, Norbert Manthey, Martin Pohlack, Elizabeth Polgreen, Michael Tautschnig, Pawel Wieczorkiewicz
FMCAD4
2016 BEACON: An Efficient SAT-Based Tool for Debugging EL^+ Ontologies
M. Fareed Arif, Carlos Mencía, Alexey Ignatiev, Norbert Manthey, Rafael Peñaloza, João Marques-Silva 0001
SAT4
2016 SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
Norbert Manthey, Marius Lindauer
SAT1
2015 Recognition of Nested Gates in CNF Formulas
Ashlin Iser, Norbert Manthey, Carsten Sinz
SAT2
2015 Improved answer-set programming encodings for abstract argumentation
abstract
Abstract The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by the ASP-system clingo. Our new encodings are not only more succinct than previous versions, but also outperform them on standard benchmarks.
Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes P. Wallner, Stefan Woltran
Theory Pract. Log. Program.2
2014 Detecting Cardinality Constraints in CNF
Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey
SAT4
2013 Parallel MUS Extraction
Anton Belov, Norbert Manthey, João Marques-Silva 0001
SAT2
2013 Soundness of Inprocessing in Clause Sharing SAT Solvers
Norbert Manthey, Tobias Philipp, Christoph Wernhard
SAT1
2012 Solving Periodic Event Scheduling Problems with SAT
Peter Großmann, Steffen Hölldobler, Norbert Manthey, Karl Nachtigall, Jens Opitz, Peter Steinke
IEA/AIE3
2012 Designing Scalable Parallel SAT Solvers
Antti Eero Johannes Hyvärinen, Norbert Manthey
SAT2
2012 Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation)
Norbert Manthey
SAT1