| A benchmark for C program verification. | 0 | 0.34 | 2019 |
| Designing a rubric for feedback on code quality in programming courses. | 4 | 0.51 | 2016 |
| Formalizing Bialgebraic Semantics in PVS 6.0 | 0 | 0.34 | 2015 |
| Derivation and inference of higher-order strictness types | 0 | 0.34 | 2015 |
| Tweetnacl: A Crypto Library In 100 Tweets | 11 | 0.58 | 2014 |
| Towards an empirically validated model for assessment of code quality | 7 | 0.72 | 2014 |
| Using Model-Checking to Reveal a Vulnerability of Tamper-Evident Pairing. | 0 | 0.34 | 2013 |
| Modular Bialgebraic Semantics And Algebraic Laws | 1 | 0.36 | 2013 |
| Verifying Functional Formalizations - A Type-Theoretical Case Study in PVS. | 0 | 0.34 | 2013 |
| GSOS Formalized in Coq | 1 | 0.36 | 2013 |
| Generating verifiable java code from verified PVS specifications | 5 | 0.54 | 2012 |
| A proof framework for concurrent programs | 0 | 0.34 | 2012 |
| Higher-Order Strictness Typing. | 1 | 0.36 | 2012 |
| Formal Component-Based Semantics | 1 | 0.36 | 2011 |
| Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem proving | 2 | 0.40 | 2011 |
| A formal verification study on the Rotterdam storm surge barrier | 0 | 0.34 | 2010 |
| Efficient and Type-Safe Generic Data Storage | 1 | 0.42 | 2009 |
| LaQuSo: Using Formal Methods for Analysis of Safety-Cr | 0 | 0.34 | 2008 |
| Code-carrying theories | 8 | 0.61 | 2008 |
| Reentrant Readers-Writers: A Case Study Combining Model Checking with Theorem Proving | 3 | 0.41 | 2008 |
| AHA: Amortized Heap Space Usage Analysis. | 7 | 0.54 | 2007 |
| Machine checked formal proof of a scheduling protocol for smartcard personalization | 3 | 0.66 | 2007 |
| Adaptive functional programming | 23 | 1.78 | 2006 |
| Improved fusion for optimizing generics | 8 | 0.55 | 2005 |
| There and back again: arrows for invertible programming | 16 | 0.84 | 2005 |
| Optimizing Generic Functions | 15 | 0.79 | 2004 |
| Fusion in Practice | 8 | 0.58 | 2002 |
| Graph Rewriting Semantics for Functional Programming Languages | 4 | 0.39 | 1996 |
| Uniqueness typing for functional languages with graph rewriting semantics | 56 | 3.04 | 1996 |
| A Derivation System for Uniqueness Typing | 1 | 0.36 | 1995 |
| Uniqueness typing in natural deduction style | 0 | 0.34 | 1995 |
| Uniqueness Type Inference | 15 | 0.92 | 1995 |
| Guaranteeing Safe Destructive Updates Through a Type System with Uniqueness Information for Graphs | 17 | 1.60 | 1993 |
| Conventional and Uniqueness Typing in Graph Rewrite Systems | 51 | 5.43 | 1993 |
| Partially Strict Non-Recursive Data Types | 4 | 0.54 | 1993 |
| Extending Graph Rewriting with Copying | 5 | 0.55 | 1993 |
| Generating efficient code for lazy functional languages | 21 | 2.63 | 1991 |
