default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Kupferschmid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c14]Matthias Sauer, Stefan Kupferschmid:
A Formal Approach to the Traveling Professor Problem. Aspekte der Technischen Informatik 2014: 81-88- 2013
- [b1]Stefan Kupferschmid:
Über Craigsche Interpolation und deren Anwendung in der formalen Modellprüfung. University of Freiburg, Der Andere Verlag 2013, ISBN 978-3-86247-411-0, pp. 1-247 - [c13]Karsten Scheibler, Stefan Kupferschmid, Bernd Becker:
Recent Improvements in the SMT Solver iSAT. MBMV 2013: 231-241 - 2012
- [c12]Matthias Sauer, Stefan Kupferschmid, Alexander Czutro, Ilia Polian, Sudhakar M. Reddy, Bernd Becker
:
Functional test of small-delay faults using SAT and Craig interpolation. ITC 2012: 1-8 - [c11]Matthias Sauer, Stefan Kupferschmid, Alejandro Czutro, Sudhakar M. Reddy, Bernd Becker:
Analysis of Reachable Sensitisable Paths in Sequential Circuits with SAT and Craig Interpolation. VLSI Design 2012: 382-387 - 2011
- [j1]Stefan Kupferschmid, Matthew Lewis, Tobias Schubert, Bernd Becker:
Incremental preprocessing methods for use in BMC. Formal Methods Syst. Des. 39(2): 185-204 (2011) - [c10]Ernst Althaus, Bernd Becker, Daniel Dumitriu, Stefan Kupferschmid:
Integration of an LP Solver into Interval Constraint Propagation. COCOA 2011: 343-356 - [c9]Stefan Kupferschmid, Bernd Becker, Tino Teige, Martin Fränzle:
Proof certificates and non-linear arithmetic constraints. DDECS 2011: 429-434 - [c8]Stefan Kupferschmid, Bernd Becker:
Craig Interpolation in the Presence of Non-linear Constraints. FORMATS 2011: 240-255 - [c7]Andreas Eggers, Evgeny Kruglov, Stefan Kupferschmid, Karsten Scheibler, Tino Teige, Christoph Weidenbach:
Superposition Modulo Non-linear Arithmetic. FroCoS 2011: 119-134 - [c6]Stefan Kupferschmid, Bernd Becker:
Craigsche Interpolation für Boolesche Kombinationen linearer und nichtlinearer Ungleichungen. MBMV 2011: 279-288 - 2010
- [c5]Christian Miller, Stefan Kupferschmid, Bernd Becker:
Exploiting Craig Interpolants in Bounded Model Checking for Incomplete Designs. MBMV 2010: 77-86 - [c4]Christian Miller, Stefan Kupferschmid, Matthew Lewis, Bernd Becker:
Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs. SAT 2010: 194-208
2000 – 2009
- 2009
- [c3]Stefan Kupferschmid, Tino Teige, Bernd Becker, Martin Fränzle:
Proofs of Unsatisfiability for mixed Boolean and Non-linear Arithmetic Constraint Formulae. MBMV 2009: 27-36 - [c2]Christoph Scholl, Stefan Disch, Florian Pigorsch, Stefan Kupferschmid:
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints. TACAS 2009: 383-397 - 2008
- [c1]Andreas Eggers, Natalia Kalinnik, Stefan Kupferschmid, Tino Teige:
Challenges in Constraint-Based Analysis of Hybrid Systems. CSCLP 2008: 51-65
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-04-25 05:36 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:
