| 2008 |
| 28 | EE | Marius Nita,
Dan Grossman:
Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts.
CC 2008: 85-99 |
| 27 | EE | Laura Effinger-Dean,
Matthew Kehrt,
Dan Grossman:
Transactional events for ML.
ICFP 2008: 103-114 |
| 26 | EE | Marius Nita,
Dan Grossman,
Craig Chambers:
A theory of platform-dependent low-level software.
POPL 2008: 209-220 |
| 25 | EE | Katherine F. Moore,
Dan Grossman:
High-level small-step operational semantics for transactions.
POPL 2008: 51-62 |
| 2007 |
| 24 | | Manuvir Das,
Dan Grossman:
Proceedings of the 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE'07, San Diego, California, USA, June 13-14, 2007
ACM 2007 |
| 23 | EE | Miryung Kim,
David Notkin,
Dan Grossman:
Automatic Inference of Structural Changes for Matching across Program Versions.
ICSE 2007: 333-343 |
| 22 | EE | Dan Grossman:
The transactional memory / garbage collection analogy.
OOPSLA 2007: 695-706 |
| 21 | EE | Benjamin S. Lerner,
Matthew Flower,
Dan Grossman,
Craig Chambers:
Searching for type-error messages.
PLDI 2007: 425-434 |
| 20 | EE | Tatiana Shpeisman,
Vijay Menon,
Ali-Reza Adl-Tabatabai,
Steven Balensiefer,
Dan Grossman,
Richard L. Hudson,
Katherine F. Moore,
Bratin Saha:
Enforcing isolation and ordering in STM.
PLDI 2007: 78-88 |
| 2006 |
| 19 | EE | Benjamin S. Lerner,
Dan Grossman,
Craig Chambers:
Seminal: searching for ML type-error messages.
ML 2006: 63-73 |
| 18 | EE | Dan Grossman,
Jeremy Manson,
William Pugh:
What do high-level memory models mean for transactions?
Memory System Performance and Correctness 2006: 62-69 |
| 17 | EE | Benjamin Hindman,
Dan Grossman:
Atomicity via source-to-source translation.
Memory System Performance and Correctness 2006: 82-91 |
| 16 | EE | Dan Grossman:
Quantified types in an imperative language.
ACM Trans. Program. Lang. Syst. 28(3): 429-475 (2006) |
| 15 | EE | Nikhil Swamy,
Michael W. Hicks,
Greg Morrisett,
Dan Grossman,
Trevor Jim:
Safe manual memory management in Cyclone.
Sci. Comput. Program. 62(2): 122-144 (2006) |
| 2005 |
| 14 | EE | Michael F. Ringenburg,
Dan Grossman:
Preventing format-string attacks via automatic and efficient dynamic checking.
ACM Conference on Computer and Communications Security 2005: 354-363 |
| 13 | EE | Michael F. Ringenburg,
Dan Grossman:
AtomCaml: first-class atomicity via rollback.
ICFP 2005: 92-104 |
| 12 | EE | Michael F. Ringenburg,
Dan Grossman:
Types for describing coordinated data structures.
TLDI 2005: 25-36 |
| 2004 |
| 11 | EE | Michael W. Hicks,
J. Gregory Morrisett,
Dan Grossman,
Trevor Jim:
Experience with safe manual memory-management in cyclone.
ISMM 2004: 73-84 |
| 2003 |
| 10 | EE | Dan Grossman:
Type-safe multithreading in cyclone.
TLDI 2003: 13-25 |
| 9 | EE | Dan Grossman:
Type-safe multithreading in cyclone.
TLDI 2003: 13-25 |
| 8 | EE | Frederick Smith,
Dan Grossman,
J. Gregory Morrisett,
Luke Hornof,
Trevor Jim:
Compiling for template-based run-time code generation.
J. Funct. Program. 13(3): 677-708 (2003) |
| 2002 |
| 7 | EE | Dan Grossman:
Existential Types for Imperative Languages.
ESOP 2002: 21-35 |
| 6 | EE | Dan Grossman,
J. Gregory Morrisett,
Trevor Jim,
Michael W. Hicks,
Yanling Wang,
James Cheney:
Region-Based Memory Management in Cyclone.
PLDI 2002: 282-293 |
| 5 | EE | Trevor Jim,
J. Gregory Morrisett,
Dan Grossman,
Michael W. Hicks,
James Cheney,
Yanling Wang:
Cyclone: A Safe Dialect of C.
USENIX Annual Technical Conference, General Track 2002: 275-288 |
| 2000 |
| 4 | EE | Dan Grossman,
J. Gregory Morrisett:
Scalable Certification for Typed Assembly Language.
Types in Compilation 2000: 117-146 |
| 3 | EE | Dan Grossman,
J. Gregory Morrisett,
Steve Zdancewic:
Syntactic type abstraction.
ACM Trans. Program. Lang. Syst. 22(6): 1037-1080 (2000) |
| 1999 |
| 2 | EE | Steve Zdancewic,
Dan Grossman,
J. Gregory Morrisett:
Principals in Programming Languages: A Syntactic Proof Technique.
ICFP 1999: 197-207 |
| 1 | EE | Michael W. Godfrey,
Dan Grossman:
JDuck: building a software engineering tool in Java as a CS2 project.
SIGCSE 1999: 48-52 |