default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Keil 0002
Person information
- affiliation: University of Freiburg, Institute for Computer Science
Other persons with the same name
- Matthias Keil 0001 — Fraunhofer Institute for Computer Graphics Research (IGD), Darmstadt, Germany
- Matthias Keil 0003 — Sächsisches Staatsinstitut für Bildung und Schulentwicklung, Comenius-Institut, Radebeul, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j2]Matthias Keil
, Peter Thiemann:
TreatJS: Higher-Order Contracts for JavaScript (Artifact). Dagstuhl Artifacts Ser. 1(1): 01:1-01:2 (2015)- [j1]Matthias Keil, Sankha Narayan Guria, Andreas Schlegel, Manuel Geffken, Peter Thiemann:
Transparent Object Proxies for JavaScript (Artifact). Dagstuhl Artifacts Ser. 1(1): 02:1-02:2 (2015)
Conference and Workshop Papers
- 2016
- [c7]Matthias Keil, Sankha Narayan Guria, Andreas Schlegel, Manuel Geffken, Peter Thiemann:
Transparent object proxies for javascript. Software Engineering 2016: 23-24 - 2015
- [c6]Matthias Keil, Peter Thiemann:
TreatJS: Higher-Order Contracts for JavaScripts. ECOOP 2015: 28-51 - [c5]Matthias Keil, Sankha Narayan Guria, Andreas Schlegel, Manuel Geffken, Peter Thiemann:
Transparent Object Proxies in JavaScript. ECOOP 2015: 149-173 - [c4]Matthias Keil, Peter Thiemann:
Blame assignment for higher-order contracts with intersection and union. ICFP 2015: 375-386 - 2014
- [c3]Matthias Keil, Peter Thiemann:
Symbolic Solving of Extended Regular Expression Inequalities. FSTTCS 2014: 175-186 - 2013
- [c2]Matthias Keil, Peter Thiemann:
Efficient dynamic access analysis using JavaScript proxies. DLS 2013: 49-60 - [c1]Matthias Keil, Peter Thiemann:
Type-based dependency analysis for javascript. PLAS 2013: 47-58
Informal and Other Publications
- 2017
- [i8]Matthias Keil, Peter Thiemann:
Static Contract Simplification. CoRR abs/1703.10331 (2017) - 2016
- [i7]Matthias Keil, Peter Thiemann:
Transaction-based Sandboxing for JavaScript. CoRR abs/1612.00669 (2016) - 2015
- [i6]Matthias Keil, Sankha Narayan Guria, Andreas Schlegel, Manuel Geffken, Peter Thiemann:
Transparent Object Proxies for JavaScript. CoRR abs/1504.08100 (2015) - [i5]Matthias Keil, Peter Thiemann:
TreatJS: Higher-Order Contracts for JavaScript. CoRR abs/1504.08110 (2015) - 2014
- [i4]Matthias Keil, Peter Thiemann:
Symbolic Solving of Extended Regular Expression Inequalities. CoRR abs/1410.3227 (2014) - 2013
- [i3]Matthias Keil, Peter Thiemann:
Type-based Dependency Analysis for JavaScript. CoRR abs/1305.6721 (2013) - [i2]Matthias Keil, Peter Thiemann:
Efficient Dynamic Access Analysis Using JavaScript Proxies. CoRR abs/1312.3184 (2013) - [i1]Matthias Keil, Peter Thiemann:
On the Proxy Identity Crisis. CoRR abs/1312.5429 (2013)
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-11 18:21 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:
