| Publication | Date of Publication | Type |
|---|
A polymorphic modal type system for Lisp-like multi-staged languages
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2017-08-21 | Paper |
Automatically inferring loop invariants via algorithmic learning
Mathematical Structures in Computer Science | 2016-07-27 | Paper |
Static analysis of multi-staged programs via unstaging translation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
Predicate generation for learning-based quantifier-free loop invariant inference
Logical Methods in Computer Science | 2012-10-22 | Paper |
GMeta: a generic formal metatheory framework for first-order representations
Programming Languages and Systems | 2012-06-22 | Paper |
Sound non-statistical clustering of static analysis alarms
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
Access analysis-based tight localization of abstract memories
Lecture Notes in Computer Science | 2011-02-15 | Paper |
LR error repair using the A* algorithm
Acta Informatica | 2010-05-07 | Paper |
An empirical study on classification methods for alarms from a bug-finding static C analyzer
Information Processing Letters | 2010-01-29 | Paper |
Deriving invariants by algorithmic learning, decision procedures, and predicate abstraction
Lecture Notes in Computer Science | 2010-01-14 | Paper |
Automatic construction of Hoare proofs from abstract interpretation results.
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Type and Effect System for Multi-staged Exceptions
Programming Languages and Systems | 2008-05-06 | Paper |
EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version
Journal of Functional Programming | 2007-03-08 | Paper |
Static extensivity analysis for \(\lambda\)-definable functions over lattices
New Generation Computing | 2006-06-12 | Paper |
Static insertion of safe and effective memory reuse commands into ML-like programs
Science of Computer Programming | 2005-10-10 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Proofs of a set of hybrid let-polymorphic type inference algorithms
New Generation Computing | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2090846 (Why is no real title available?) | 2004-08-13 | Paper |
| scientific article; zbMATH DE number 2086512 (Why is no real title available?) | 2004-08-11 | Paper |
A cost-effective estimation of uncaught exceptions in Standard ML programs
Theoretical Computer Science | 2002-07-15 | Paper |
A proof method for the correctness of modularized 0CFA
Information Processing Letters | 2002-07-14 | Paper |
| scientific article; zbMATH DE number 1692891 (Why is no real title available?) | 2002-01-21 | Paper |
An abstract interpretation for estimating uncaught exceptions in Standard ML programs
Science of Computer Programming | 2000-01-04 | Paper |
