default search action
Jan Midtgaard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c17]Árpád Perényi, Jan Midtgaard
:
Stack-Driven Program Generation of WebAssembly. APLAS 2020: 209-230
2010 – 2019
- 2018
- [c16]Jan Midtgaard
Developments in property-based testing (invited talk). PEPM 2018: 1 - [c15]Jan Midtgaard
Process-Local Static Analysis of Synchronous Processes. SAS 2018: 284-305 - 2017
- [j8]Jan Midtgaard
Effect-driven QuickChecking of compilers. Proc. ACM Program. Lang. 1(ICFP): 15:1-15:23 (2017) - [j7]Jan Midtgaard
QuickChecking static analysis properties. Softw. Test. Verification Reliab. 27(6) (2017) - [c14]Jan Midtgaard
QuickChecking Patricia Trees. TFP 2017: 59-78 - 2016
- [c13]Jan Midtgaard
Iterated process analysis over lattice-valued regular expressions. PPDP 2016: 132-145 - [c12]Jan Midtgaard
A Parametric Abstract Domain for Lattice-Valued Regular Expressions. SAS 2016: 338-360 - 2015
- [j6]Jan Midtgaard
Systematic derivation of correct variability-aware program analyses. Sci. Comput. Program. 105: 145-170 (2015) - [c11]Jan Midtgaard
QuickChecking Static Analysis Properties. ICST 2015: 1-10 - 2014
- [c10]Jan Midtgaard
Systematic derivation of static analyses for software product lines. MODULARITY 2014: 181-192 - 2013
- [c9]Ilya Sergey
Monadic abstract interpreters. PLDI 2013: 399-410 - [c8]Jan Midtgaard
Engineering definitional interpreters. PPDP 2013: 121-132 - 2012
- [j5]Jan Midtgaard
Control-flow analysis of functional programs. ACM Comput. Surv. 44(3): 10:1-10:33 (2012) - [j4]Jan Midtgaard
Control-flow analysis of function calls and returns by abstract interpretation. Inf. Comput. 211: 49-76 (2012) - [c7]Ilya Sergey
Calculating Graph Algorithms for Dominance and Shortest Path. MPC 2012: 132-156 - [c6]Jan Midtgaard
A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections. SAS 2012: 352-369 - [c5]Jan Midtgaard
Preface. NSAD@SAS 2012: 1 - [e1]Jan Midtgaard, Matthew Might:
Proceedings of the Fourth International Workshop on Numerical and Symbolic Abstract Domains, NSAD@SAS 2012, Deauville, France, September 10, 2012. Electronic Notes in Theoretical Computer Science 287, Elsevier 2012 [contents] - 2011
- [j3]Olivier Danvy
Abstracting abstract machines: technical perspective. Commun. ACM 54(9): 100 (2011) - [c4]Michael D. Adams, Andrew W. Keep, Jan Midtgaard
Flow-sensitive type recovery in linear-log time. OOPSLA 2011: 483-498
2000 – 2009
- 2009
- [c3]Jan Midtgaard
Control-flow analysis of function calls and returns by abstract interpretation. ICFP 2009: 287-298 - 2008
- [c2]Jan Midtgaard
A Calculational Approach to Control-Flow Analysis by Abstract Interpretation. SAS 2008: 347-362 - 2005
- [j2]Mads Sig Ager, Olivier Danvy
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. Theor. Comput. Sci. 342(1): 149-172 (2005) - 2004
- [j1]Mads Sig Ager, Olivier Danvy
A functional correspondence between call-by-need evaluators and lazy abstract machines. Inf. Process. Lett. 90(5): 223-232 (2004) - 2003
- [c1]Mads Sig Ager, Dariusz Biernacki
A functional correspondence between evaluators and abstract machines. PPDP 2003: 8-19
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-08-05 20:22 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: