Jan Midtgaard

Orcid: 0000-0002-6506-5468

According to our database1, Jan Midtgaard authored at least 23 papers between 2003 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Stack-Driven Program Generation of WebAssembly.
Proceedings of the Programming Languages and Systems - 18th Asian Symposium, 2020

2018
Process-Local Static Analysis of Synchronous Processes.
Proceedings of the Static Analysis - 25th International Symposium, 2018

Developments in property-based testing (invited talk).
Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2018

2017
QuickChecking static analysis properties.
Softw. Test. Verification Reliab., 2017

Effect-driven QuickChecking of compilers.
Proc. ACM Program. Lang., 2017

QuickChecking Patricia Trees.
Proceedings of the Trends in Functional Programming - 18th International Symposium, 2017

2016
A Parametric Abstract Domain for Lattice-Valued Regular Expressions.
Proceedings of the Static Analysis - 23rd International Symposium, 2016

Iterated process analysis over lattice-valued regular expressions.
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

2015
Systematic derivation of correct variability-aware program analyses.
Sci. Comput. Program., 2015

2014
Systematic derivation of static analyses for software product lines.
Proceedings of the 13th International Conference on Modularity, 2014

2013
Engineering definitional interpreters.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Monadic abstract interpreters.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

2012
Control-flow analysis of function calls and returns by abstract interpretation.
Inf. Comput., 2012

Preface.
Proceedings of the Fourth International Workshop on Numerical and Symbolic Abstract Domains, 2012

Control-flow analysis of functional programs.
ACM Comput. Surv., 2012

A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections.
Proceedings of the Static Analysis - 19th International Symposium, 2012

Calculating Graph Algorithms for Dominance and Shortest Path.
Proceedings of the Mathematics of Program Construction - 11th International Conference, 2012

2011
Abstracting abstract machines: technical perspective.
Commun. ACM, 2011

Flow-sensitive type recovery in linear-log time.
Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2011

2008
A Calculational Approach to Control-Flow Analysis by Abstract Interpretation.
Proceedings of the Static Analysis, 15th International Symposium, 2008

2005
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects.
Theor. Comput. Sci., 2005

2004
A functional correspondence between call-by-need evaluators and lazy abstract machines.
Inf. Process. Lett., 2004

2003
A functional correspondence between evaluators and abstract machines.
Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003


  Loading...