- AspectJ for Multilevel Security Roshan Ramachandran
- JPure: A Modular Purity System for Java David J. Pearce
- Formalisation and Implementation of an Algorithm for Bytecode Verification of @NonNull Types
- Patterns for ADT Optimisation David J. Pearce and James Noble
- Java Bytecode Verification for @NonNull Types Chris Male, David J. Pearce, Alex Potanin and Constantine Dymnikov
- University of London Imperial College of Science, Technology and Medicine
- Understanding the Impact of Collection Contracts on Stephen Nelson, David J. Pearce, and James Noble
- Patterns of Aspect-Oriented Design James Noble1,2
- Online algorithms for maintaining the topological order of a directed acyclic graph
- Patterns of AspectOriented Design James Noble 1,2 , Arno Schmidmeier 3 , David J. Pearce 2 , Andrew P. Black 4
- SOFTWARE---PRACTICE AND EXPERIENCE Softw. Pract. Exper. 2005; 00:1 Prepared using speauth.cls [Version: 2002/09/23 v2.2]
- An Improved Algorithm for Finding the Strongly Connected Components of a Directed Graph
- Mocha: Type Inference for Christopher John Male
- Relationship Aspects David J. Pearce
- EdgeSelection Heuristics for Computing Tutte Polynomials David J. Pearce
- Online algorithms for topological order and strongly connected components
- GILK: A dynamic instrumentation tool for the Linux Kernel
- Mocha: Local Type Inference for Java Chris Male and David J. Pearce
- Online algorithms for maintaining the topological order of a directed acyclic graph
- JPure: A Modular Purity System for Java David J. Pearce
- Efficient Object Querying for Java Darren Willis, David J. Pearce and James Noble
- A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs
- A Featherweight Calculus for FlowSensitive Type Systems in Java David J. Pearce
- FlowSensitive Types for Whiley David J. Pearce and James Noble
- Visualising the Tutte Polynomial Computation Bennett Thompson and David J. Pearce
- A Batch Algorithm for Maintaining a Topological Order David J. Pearce1 Paul H.J. Kelly2
- Online algorithms for topological order and strongly connected components
- Caching and Incrementalisation in the Java Query Language Darren Willis, David J. Pearce and James Noble
- Computing Tutte Polynomials Gary Haggard 1 , David J. Pearce 2 , and Gordon Royle 3
- Extended Abstract: Towards a Semiotics of Object-and Aspect-Oriented Design
- University of London Imperial College of Science, Technology and Medicine
- Computing Tutte Polynomials GARY HAGGARD
- Java Bytecode Verification for @NonNull Types Chris Male, David J. Pearce, Alex Potanin and Constantine Dymnikov
- Computing Tutte Polynomials GARY HAGGARD
- Querying in Java Darren Willis, David J. Pearce, James Noble
- Efficient Field-Sensitive Pointer Analysis of C DAVID J. PEARCE
- JPure: A Modular Purity System for Java David J. Pearce
- Patterns for ADT Optimisation David J. Pearce and James Noble
- Java Bytecode Verification for @NonNull Types Chris Male, David J. Pearce, Alex Potanin and Constantine Dymnikov
- Relationship Aspects David J. Pearce
- ByteCode 2011 Implementing a Language with Flow-Sensitive and
- Online Cycle Detection and Difference Propagation for Pointer Analysis David J. Pearce, Paul H.J. Kelly and Chris Hankin
- The Java Query Language Darren Willis
- Edge-Selection Heuristics for Computing Tutte Polynomials David J. Pearce
- Caching and Incrementalisation in the Java Query Language Darren Willis, David J. Pearce and James Noble
- A Dynamic Topological Sort Algorithm for Directed Acyclic Graphs
- E#cient Object Querying for Java Darren Willis, David J. Pearce and James Noble
- Relationship Aspect Patterns David J. Pearce and James Noble
- JPure: A Modular Purity System for Java David J. Pearce
- A Featherweight Calculus for Flow-Sensitive Type Systems in Java David J. Pearce
- Flow-Sensitive Types for Whiley David J. Pearce and James Noble
- EdgeSelection Heuristics for Computing Tutte Polynomials David J. Pearce 1 Gary Haggard 2 Gordon Royle 3
- Mocha: Local Type Inference for Java Chris Male and David J. Pearce
- VICTORIA UNIVERSITY OF WELLINGTON Te Whare Wananga o te Upoko o te Ika a Maui
- Visualising the Tutte Polynomial Computation Bennett Thompson and David J. Pearce
- A Batch Algorithm for Maintaining a Topological Order David J. Pearce 1 Paul H.J. Kelly 2
- AspectJ for Multilevel Security Roshan Ramachandran
- E#cient FieldSensitive Pointer Analysis of C DAVID J. PEARCE
- Java Bytecode Verification for @NonNull Types Chris Male, David J. Pearce, Alex Potanin and Constantine Dymnikov
- Online Cycle Detection and Difference Propagation for Pointer Analysis David J. Pearce, Paul H.J. Kelly and Chris Hankin
- Formalisation and Implementation of an Algorithm for Bytecode Verification of @NonNull Types
- SOFTWARE--PRACTICE AND EXPERIENCE Softw. Pract. Exper. 2005; 00:1 Prepared using speauth.cls [Version: 2002/09/23 v2.2]
- An Improved Algorithm for Finding the Strongly Connected Components of a Directed Graph
- Edge-Selection Heuristics for Computing Tutte Polynomials David J. Pearce1 Gary Haggard2 Gordon Royle3
- Relationship Aspect Patterns David J. Pearce and James Noble
- An Algorithmic Framework for Recursive Structural Types David J. Pearce
- An Algorithmic Framework for Recursive Structural Types David J. Pearce
- OwnKit: Ownership Inference for Java
