default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTino Teige
- > Home > Persons > Tino Teige
Publications
- 2017
[c18]Felix Neubauer, Karsten Scheibler, Bernd Becker, Ahmed Mahdi, Martin Fränzle, Tino Teige, Tom Bienmüller, Detlef Fehrer:
Accurate Dead Code Detection in Embedded C Code by Arithmetic Constraint Solving. MBMV 2017: 53-54- 2016
- [c17]Karsten Scheibler, Felix Neubauer, Ahmed Mahdi, Martin Fränzle, Tino Teige, Tom Bienmüller, Detlef Fehrer, Bernd Becker
:
Accurate ICP-based floating-point reasoning. FMCAD 2016: 177-184 - [c14]Felix Neubauer, Karsten Scheibler, Bernd Becker, Ahmed Mahdi, Martin Fränzle, Tino Teige, Tom Bienmüller, Detlef Fehrer:
Accurate Dead Code Detection in Embedded C Code by Arithmetic Constraint Solving. SC²@SYNASC 2016: 32-38 - 2012
- [j3]Tino Teige, Martin Fränzle:
Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems with Applications to Probabilistic State Reachability and Region Stability. Log. Methods Comput. Sci. 8(2) (2012) - 2011
- [c12]Stefan Kupferschmid, Bernd Becker, Tino Teige, Martin Fränzle:
Proof certificates and non-linear arithmetic constraints. DDECS 2011: 429-434 - [c10]Tino Teige, Martin Fränzle:
Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems. TACAS 2011: 158-172 - 2010
- [j2]Martin Fränzle, Tino Teige, Andreas Eggers:
Engineering constraint solvers for automatic analysis of probabilistic hybrid automata. J. Log. Algebraic Methods Program. 79(7): 436-466 (2010) - [c9]Martin Fränzle, Tino Teige, Andreas Eggers:
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT. IFM 2010: 168-182 - [c8]Tino Teige, Martin Fränzle:
Resolution for Stochastic Boolean Satisfiability. LPAR (Yogyakarta) 2010: 625-639 - 2009
- [c7]Tino Teige, Martin Fränzle:
Constraint-Based Analysis of Probabilistic Hybrid Systems. ADHS 2009: 162-167 - [c6]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 - 2008
- [c5]Tino Teige, Martin Fränzle:
Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic. CPAIOR 2008: 248-262 - [c3]Martin Fränzle, Holger Hermanns, Tino Teige:
Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems. HSCC 2008: 172-186 - [c2]Christian Herde, Andreas Eggers, Martin Fränzle, Tino Teige:
Analysis of Hybrid Systems Using HySAT. ICONS 2008: 196-201 - 2007
- [j1]Martin Fränzle, Christian Herde, Tino Teige, Stefan Ratschan, Tobias Schubert:
Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure. J. Satisf. Boolean Model. Comput. 1(3-4): 209-236 (2007) - 2006
- [c1]Bahareh Badban, Martin Fränzle, Jan Peleska, Tino Teige:
Test automation for hybrid systems. SOQUA 2006: 14-21
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-24 22:57 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:
