default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTanja Schindler
Person information
- affiliation: University of Basel, Switzerland
- affiliation (former): University of Liège, Belgium
- affiliation (former): University of Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Elisabeth Henkel
, Jochen Hoenicke, Tanja Schindler:
Choose Your Colour: Tree Interpolation for Quantified Formulas in SMT. CADE 2023: 248-265- [c10]Matthias Heizmann, Max Barth, Daniel Dietsch, Leonard Fichtner, Jochen Hoenicke, Dominik Klumpp, Mehdi Naouar, Tanja Schindler, Frank Schüssele, Andreas Podelski:
Ultimate Automizer and the CommuHash Normal Form - (Competition Contribution). TACAS (2) 2023: 577-581 - [i3]Elisabeth Henkel, Jochen Hoenicke, Tanja Schindler:
Choose your Colour: Tree Interpolation for Quantified Formulas in SMT. CoRR abs/2305.11667 (2023) - 2022
- [b1]Tanja Schindler:
SMT solving, interpolation, and quantifiers. University of Freiburg, Freiburg im Breisgau, Germany, 2022 - [c9]Jochen Hoenicke, Tanja Schindler:
A Simple Proof Format for SMT. SMT 2022: 54-70 - [p1]Tanja Schindler:
SMT-Solving, Interpolation und Quantoren. Ausgezeichnete Informatikdissertationen 2022: 261-270 - [d1]Matthias Heizmann, Max Barth, Daniel Dietsch, Leonard Fichtner, Jochen Hoenicke, Dominik Klumpp, Mehdi Naouar, Tanja Schindler, Frank Schüssele, Andreas Podelski:
Ultimate Automizer (SV-COMP 2022 - Modified). Zenodo, 2022
- 2021
- [c8]Elisabeth Henkel, Jochen Hoenicke, Tanja Schindler:
Proof Tree Preserving Sequence Interpolation of Quantified Formulas in the Theory of Equality. SMT 2021: 3-16 - [c7]Jochen Hoenicke, Tanja Schindler:
Incremental Search for Conflict and Unit Instances of Quantified Formulas with E-Matching. VMCAI 2021: 534-555
2010 – 2019
- 2019
- [c6]Jochen Hoenicke, Tanja Schindler:
Solving and Interpolating Constant Arrays Based on Weak Equivalences. VMCAI 2019: 297-317 - [i2]Jochen Hoenicke, Tanja Schindler:
Interpolation and the Array Property Fragment. CoRR abs/1904.11381 (2019) - 2018
- [c5]Jochen Hoenicke, Tanja Schindler:
Efficient Interpolation for the Theory of Arrays. IJCAR 2018: 549-565 - [c4]Matthias Heizmann, Yu-Fang Chen, Daniel Dietsch, Marius Greitschus, Jochen Hoenicke, Yong Li, Alexander Nutz, Betim Musa, Christian Schilling, Tanja Schindler, Andreas Podelski:
Ultimate Automizer and the Search for Perfect Interpolants - (Competition Contribution). TACAS (2) 2018: 447-451 - [c3]Daniel Dietsch, Marius Greitschus, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski, Christian Schilling, Tanja Schindler:
Ultimate Taipan with Dynamic Block Encoding - (Competition Contribution). TACAS (2) 2018: 452-456 - [c2]Tanja Schindler, Dejan Jovanovic:
Selfless Interpolation for Infinite-State Model Checking. VMCAI 2018: 495-515 - [i1]Jochen Hoenicke, Tanja Schindler:
Efficient Interpolation for the Theory of Arrays. CoRR abs/1804.07173 (2018) - 2017
- [c1]Jochen Hoenicke, Tanja Schindler:
Efficient Interpolation for the Theory of Arrays. SMT 2017: 76-88
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-10-10 22:19 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:
