Links use authoritative DOI where available. Articles may also be available at the individual authors' personal Web-sites.
Conference articles use the form:
| Title. Authors. Conference:pages. |
Journal articles use the form:
| Title. Authors. Journal volume (number):pages. |
| 2008 |
|---|
| Protocol Inference Using Static Path Profiles. Ramanathan, M, Grama, A, Jagannathan, S. SAS:78-92. |
| A Uniform Transactional Execution Environment for Java. Ziarek, L, Welc, A, Adl-Tabatabai, A, Menon, V, Shpeisman, T, Jagannathan, S. ECOOP:129-154. |
| Quasi-static Scheduling for Safe Futures. Navabi, A, Zhang, X, Jagannathan, S. ACM PPoPP:23-32. |
| 2007 |
|---|
| Modular Checkpointing for Atomicity. Ziarek, L, Schatz, P, Jagannathan, S. Electronic Notes in Theoretical Computer Science 174(9):85-115. |
| Efficient distributed subtyping tests. Baehni S, Barreto J, Eugster P, Guerraoui R. DEBS:214-225. |
| A relational model of object collaborations and its use in reasoning about relationships. Balzer S, Gross TR, Eugster P. ECOOP:323-346. |
| User tasks and access control over web services. Thomas J, Paci F, Bertino E, Eugster P. ICWS:60-69. |
| Type-based publish/subscribe: Concepts and experiences. Eugster P. ACM TOPLAS 29 (1). |
| Enabling tracing of long-running multithreaded programs via dynamic execution reduction. Tallam S, Tian C, Gupta R, Zhang X. ISSTA:207-218. |
| Efficient online detection of dynamic control dependence. Xin B, Zhang X. ISSTA:185-195. |
| Towards locating execution omission errors. Zhang X, Tallam S, Gupta N, Gupta R. PLDI:415-424. |
| Randomized leader election. Ramanathan MK, Ferreira RA, Jagannathan S, Grama A, Szpankowski W. Distributed Computing 19 (5-6):402-418. |
| Randomized protocols for duplicate elimination in peer-to-peer storage systems. Ferreira RA, Ramanathan MK, Grama A, Jagannathan S. IEEE Transanctions on Parallel and Distributed Systems 18 (5):686-696. |
| Static specification inference using predicate mining. Ramanathan MK, Grama A, Jagannathan S. PLDI:123-134. |
| Path-sensitive inference of function precedence protocols. Ramanathan M.K, Grama A, Jagannathan S. ICSE:240-250. |
| Scoped types and aspects for real-time Java memory management. Andreae C, Coady Y, Gibbs C, Noble J, Vitek J, Zhao T. Real-Time Systems 37 (1):1-44. |
| Hierarchical real-time garbage collection. Pizlo F, Hosking AL, Vitek J. LCTES:123-133. |
| Reflexes: abstractions for highly responsive systems. Honig Spring J, Pizlo F, Guerraoui R, Vitek J. VEE:191-201. |
| An efficient and flexible toolkit for composing customized method dispatchers. Cunei A, Vitek J. Software - Practice and Experience. |
| Open nesting in software transactional memory. Ni Y, Menon V, Adl-Tabatabai A-R, Hosking AL, Hudson RL, Moss JEB, Saha B, Shpeisman T. PPoPP:68-78. |
| Accurate garbage collection in uncooperative environments with lazy pointer stacks. Baker J, Cunei A, Pizlo F, Vitek J. CC:64-79. |
| STMBench7: A benchmark for software transactional memory. Guerraoui R, Kapalka M, Vitek J. EuroSys:315-324. |
| 2006 |
| Stabilizers: A Modular Checkpointing Abstraction for Concurrent Functional Programs. Ziarek, L, Schatz, P, Jagannathan S. ICFP:136-147 |
| Sieve: A tool for automatically detecting variations across program versions. Ramanathan M.K, Grama A, Jagannathan S. ASE:241-252. |
| Trace-based memory aliasing across program versions. Ramanathan M.K, Jagannathan S, Grama A. FASE:381-395. |
| Nested transactional memory: Model and architecture sketches. Moss JEB, Hosking AL. Science of Computer Programming 63 (2):186-201. |
| The DaCapo benchmarks: Java benchmarking development and analysis. Blackburn S, Garner R, Hoffman C, Khan A, McKinley KS, Bentzur R, Diwan A, Feinberg D, Guyer S, Hosking AL, Jump M, Moss JEB, Stefanović D, VanDrunen T, von Dincklage D, Wiedermann B. OOPSLA:169-190. |
| Revocation techniques for Java concurrency. Welc A, Jagannathan S, Hosking AL. Concurrency and Computation – Practice and Experience 18 (2):1613-1656. |
| Transparently reconciling transactions with locking for Java synchronization. Welc A, Hosking AL, Jagannathan S. ECOOP:148-173. |
| Portable, mostly-concurrent, mostly-copying garbage collection for multi-processors. Hosking AL. ISMM:40–51. |
| Reducing generational copy reserve overhead with fallback compaction. McGachey P, Hosking AL. ISMM:17–28. |
| Concurrency abstractions for object-oriented programming languages using optimistic protocols. Welc A. PhD dissertation, Purdue University. |
| An improved generational copying garbage collector. McGachey P. Master's thesis, Purdue University. |
| 2005 |
| Safe futures for Java. Welc A, Jagannathan S, Hosking AL. OOPSLA:439–453. |
| A transactional object calculus. Jagannathan S, Vitek J, Welc A, Hosking A. Science of Computer Programming 57 (2):164–186. |
| Nested transactional memory: Model and preliminary architecture sketches. Moss JEB, Hosking AL. SCOOL. |
| 2004 |
| Anticipation-based partial redundancy elimination for static single assignment form. VanDrunen T, Hosking AL. Software – Practice and Experience 34 (15):1413–1439. |
| Software prefetching for mark-sweep garbage collection: Hardware analysis and software redesign. Cher C-Y, Hosking AL, Vijaykumar TN. ASPLOS:199–210. |
| Penumbra: Simplifying Eclipse. Mueller F, Hosking AL. Dr. Dobb’s Journal: Software Tools for the Professional Programmer 365:62–66. |
| Barriers: Friend or foe? Blackburn S, Hosking AL. ISMM:143–151. |
| Preemption-based avoidance of priority inversion for Java. Welc A, Hosking AL, Jagannathan S. ICPP:529–538. |
| Partial redundancy elimination for global value numbering. VanDrunen T. PhD dissertation, Purdue University. |
| Transactional monitors for concurrent objects. Welc A, Jagannathan S, Hosking AL. ECOOP:519–542. |
| Penumbra: Enhancing Eclipse for introductory programming. Mueller F. Master's thesis, Purdue University. |
| Value-based partial redundancy elimination. VanDrunen T, Hosking AL. CC:167–184. |
| A semantic framework for designer transactions. Vitek J, Jagannathan S, Welc A, Hosking AL. ESOP:249–263. |
| 2003 |
| Penumbra: An Eclipse plugin for introductory programming. Mueller F, Hosking AL. eTX 2003:65–68. |
| Lightweight confinement for Featherweight Java. Zhao T, Palsberg J, Vitek J. OOPSLA:135-148. |
| Corner cases in value-based partial redundancy elimination. VanDrunen T, Hosking AL. Computer Science Technical Report 03-032, Purdue University. |
| Idioms in OVM. Flack C, Hosking AL, Vitek J. Computer Science Technical Report 03-017, Purdue University. |
| 2002 |
| 2001 |
| On the usefulness of liveness for garbage collection and leak detection. Hirzel M, Diwan A, Hosking AL. ECOOP:181-206. |
| Partial redundancy elimination for access path expressions. Hosking AL, Nystrom N, Whitlock D, Cutts Q, Diwan A. Software – Practice and Experience 31 (6):577–600. |
| 2000 |
| A framework for persistence-enabled optimization of Java object stores. Whitlock D, Hosking AL. POS:4–18. |
| Persistence-enabled optimization of Java programs. Whitlock D. Master's thesis, Purdue University. |
| 1999 |
| Mostly-copying reachability-based orthogonal persistence. Hosking AL, Chen J. OOPSLA:383–398. |
| PM3: An orthogonally persistent systems programming language – Design, Implementation, Performance. Hosking AL, Chen J. VLDB:587–598. |
| 1998 |
| Swizzle barrier optimizations for orthogonal persistence in Java. Brahnmath K, Nystrom N, Hosking AL, Cutts Q. PJW:268–278. |
| Optimizing the read and write barriers for orthogonal persistence. Hosking AL, Nystrom N, Cutts Q, Brahnmath K. POS:149–159. |
| Reconciling buffer management with persistence optimizations. Cutts QI, Lennon S, Hosking AL. POS:51–63. |
| Bytecode Level Analysis and Optimization of Java Classes. Nystrom N. Master's thesis, Purdue University. |
| Optimizing Orthogonal Persistence for Java. Brahnmath K. Master's thesis, Purdue University. |
| 1997 |
| Reachability-based orthogonal persistence for C, C++ and other intransigents. Hosking AL, Novianto AP. OOPSLA Memory Management Workshop. |
| Analysing, profiling and optimising orthogonal persistence for Java. Cutts Q, Hosking AL. PJW:107–115. |
| 1996 |
| Approaches to adding persistence to Java. Moss JEB, Hosking AL. PJW:1–6. |
| Residency check elimination for object-oriented languages. Hosking AL. POS:174–183. |
| 1995 |
| Lightweight write detection and checkpointing for fine-grained persistence. Hosking AL, Moss JEB. Computer Science Technical Report 95-084, Purdue University. |
| Benchmarking persistent programming languages: quantifying the language/database interface. Hosking AL. OOPSLA Object Database Behavior, Benchmarks, and Performance Workshop. |
| Lightweight support for fine-grained persistence on stock hardware. Hosking AL. PhD dissertation. Computer Science Technical Report 95-02, University of Massachusetts at Amherst. |
| 1994 |
| Expressing object residency optimizations using pointer type annotations. Moss JEB, Hosking AL. POS:3–15. |
| 1993 |
| Protection traps and alternatives for memory management of an object-oriented language. Hosking AL, Moss JEB. SOSP:106–119. |
| Object fault handling for persistent programming languages: A performance evaluation. Hosking AL, Moss JEB. OOPSLA:288–303. |
| Remembered sets can also play cards. Hosking AL, Hudson RS. OOPSLA Memory Management Workshop. |
| Update logging for persistent programming languages: A comparative performance evaluation. Hosking AL, Brown E, Moss JEB. VLDB:429–440. |
| 1992 |
| A comparative performance evaluation of write barrier implementations. Hosking AL, Moss JEB, Stefanovic D. OOPSLA:92–109. |
| 1991 |
| Main memory management for persistence. Hosking AL. OOPSLA Memory Management Workshop. |
| Compiler support for persistent programming. Hosking AL, Moss JEB. Computer Science Technical Report 91-25, University of Massachusetts at Amherst. |
| 1990 |
| Towards compile-time optimisations for persistence. Hosking AL, Moss JEB. POS:17–27. |
| Design of an object faulting persistent Smalltalk. Hosking AL, Moss JEB, Bliss C. Computer Science Technical Report 90-45, University of Massachusetts at Amherst. |