default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Herbstritt
Person information
- affiliation: Albert Ludwigs University of Freiburg, IT Services, Germany
- affiliation (former): Albert Ludwigs University of Freiburg, Centre for Security and Society, Germany
- affiliation (former): Schloss Dagstuhl - Leibniz Center for Informatics, Wadern, Germany
- affiliation (former, PhD 2008): Albert Ludwigs University of Freiburg, Institute of Computer Science, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2010 – 2019
- 2016
[i2]Marc Herbstritt, Wolfgang Thomas:
LIPIcs - an Open-Access Series for International Conference Proceedings. ERCIM News(107) (2016)- 2014
- [c24]Marc Herbstritt, Rolf Drechsler:
Der h2-lndex: Zur vermessenen Vermessung der wissenschaftlichen Welt. Aspekte der Technischen Informatik 2014: 35-50 - 2012
- [i1]Kurt Mehlhorn, Moshe Y. Vardi, Marc Herbstritt
:
Publication Culture in Computing Research (Dagstuhl Perspectives Workshop 12452). Dagstuhl Reports 2(11): 20-44 (2012)
2000 – 2009
- 2009
- [b2]Marc Herbstritt:
Satisfiability and Verification - From Core Algorithms to Novel Application Domains. Südwestdeutscher Verlag für Hochschulschriften 2009, ISBN 978-3-8381-0102-6, pp. I-X, 1-220 - [j1]Eckard Böde, Marc Herbstritt, Holger Hermanns, Sven Johr, Thomas Peikenkamp, Reza Pulungan, Jan-Hendrik Rakow, Ralf Wimmer, Bernd Becker:
Compositional Dependability Evaluation for STATEMATE. IEEE Trans. Software Eng. 35(2): 274-292 (2009) - 2008
- [b1]Marc Herbstritt:
SAT-based verification: from core algorithms to novel application domains. University of Freiburg, 2008 - [c23]Ralf Wimmer, Alexander Kortus, Marc Herbstritt, Bernd Becker:
Probabilistic Model Checking and Reliability of Results. DDECS 2008: 207-212 - [c22]Bernd Becker, Marc Herbstritt, Natalia Kalinnik, Matthew Lewis, Juri Lichtner, Tobias Nopper, Ralf Wimmer:
Propositional approximations for bounded model checking of partial circuit designs. ICCD 2008: 52-59 - [c21]Ralf Wimmer, Alexander Kortus, Marc Herbstritt, Bernd Becker:
The Demand for Reliability in Probabilistic Verification. MBMV 2008: 99-108 - 2007
- [c20]Marc Herbstritt, Bernd Becker, Erika Ábrahám, Christian Herde:
On Variable Selection in SAT-LP-based Bounded Model Checking of Linear Hybrid Automata. DDECS 2007: 391-396 - [c19]Marc Herbstritt, Bernd Becker:
On Combining 01X-Logic and QBF. EUROCAST 2007: 531-538 - [c18]Ralf Wimmer, Marc Herbstritt, Bernd Becker:
Optimization techniques for BDD-based bisimulation computation. ACM Great Lakes Symposium on VLSI 2007: 405-410 - [c17]Ralf Wimmer, Marc Herbstritt, Bernd Becker:
Forwarding, Splitting, and Block Ordering to Optimize BDD-based Bisimulation Computation. MBMV 2007: 203-212 - [c16]Marc Herbstritt, Vanessa Struve, Bernd Becker:
Application of Lifting in Partial Design Analysis. MTV 2007: 33-38 - 2006
- [c15]Ralf Wimmer, Marc Herbstritt, Holger Hermanns, Kelley Strampp, Bernd Becker:
Sigref- A Symbolic Bisimulation Tool Box. ATVA 2006: 477-492 - [c14]Ralf Wimmer, Marc Herbstritt, Bernd Becker:
Minimization of Large State Spaces using Symbolic Branching Bisimulation. DDECS 2006: 9-14 - [c13]Erika Ábrahám, Marc Herbstritt, Bernd Becker, Martin Steffen:
Memory-aware Bounded Model Checking for Linear Hybrid Systems. MBMV 2006: 153-162 - [c12]Marc Herbstritt, Bernd Becker, Christoph Scholl:
Advanced SAT-Techniques for Bounded Model Checking of Blackbox Designs. MTV 2006: 37-44 - [c11]Eckard Böde, Marc Herbstritt, Holger Hermanns, Sven Johr, Thomas Peikenkamp, Reza Pulungan, Ralf Wimmer, Bernd Becker:
Compositional Performability Evaluation for STATEMATE. QEST 2006: 167-178 - [c10]Erika Ábrahám, Marc Herbstritt, Bernd Becker, Martin Steffen:
Bounded Model Checking with Parametric Data Structures. BMC@FLoC 2006: 3-16 - 2005
- [c9]Marc Herbstritt, Bernd Becker:
On SAT-based Bounded Invariant Checking of Blackbox Designs. MTV 2005: 23-28 - 2004
- [c8]Bernd Becker, Markus Behle, Friedrich Eisenbrand, Martin Fränzle, Marc Herbstritt, Christian Herde, Jörg Hoffmann, Daniel Kröning, Bernhard Nebel, Ilia Polian, Ralf Wimmer:
Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems. MBMV 2004: 65-75 - [c7]Marc Herbstritt, Thomas Kmieciak, Bernd Becker:
On the Impact of Structural Circuit Partitioning on SAT-Based Combinational Circuit Verification. MTV 2004: 50-55 - 2003
- [c6]Marc Herbstritt, Bernd Becker:
Conflict-based Selection of Branching Rules in SAT-Algorithms. MBMV 2003: 189-198 - [c5]Marc Herbstritt, Bernd Becker:
Conflict-Based Selection of Branching Rules. SAT 2003: 441-451 - 2001
- [c4]Christoph Scholl, Marc Herbstritt, Bernd Becker:
Exploiting don't cares to minimize *BMDs. ISCAS (5) 2001: 191-194 - [c3]Christoph Scholl, Marc Herbstritt, Bernd Becker:
Don't Care Minimization of BMDs: Complexity and Algorithms. MBMV (1) 2001: 45-57
1990 – 1999
- 1999
- [c2]Rolf Drechsler, Marc Herbstritt, Bernd Becker:
Grouping heuristics for word-level decision diagrams. ISCAS (1) 1999: 411-414 - [c1]Rolf Drechsler, Marc Herbstritt, Bernd Becker:
Grouping Heuristics for Word-Level Decision Diagrams. MBMV 1999: 41-50
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 2025-05-14 22:06 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
