Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Chris Andreae

dblp:70/5425 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 2 first-authorSystems, architecture and hardware · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Programming languages and type systems · 41% Program analysis · 41% Software testing · 18%

Topics — the 5 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › type systems › static typing
pluggable type systems
0.222010
JavaCOP: Declarative pluggable types for java · ACM Trans. Program. Lang. Syst. 2010
A framework for implementing pluggable type systems · OOPSLA 2006
Program analysis
data flow analysis
0.112010
JavaCOP: Declarative pluggable types for java · ACM Trans. Program. Lang. Syst. 2010
Program analysis › data flow analysis
flow-sensitive analysis
0.112010
JavaCOP: Declarative pluggable types for java · ACM Trans. Program. Lang. Syst. 2010
Programming languages and type systems
type systems
0.112010
JavaCOP: Declarative pluggable types for java · ACM Trans. Program. Lang. Syst. 2010
Software testing › system software testing › language processor testing
type system testing
0.112010
JavaCOP: Declarative pluggable types for java · ACM Trans. Program. Lang. Syst. 2010

Methods — techniques the papers use, named apart from their topics

declarative constraint language · 0.1abstract syntax tree constraints · 0.1declarative rule language · 0.1
YearPublicationVenuePosition
2010 JavaCOP: Declarative pluggable types for java
abstract
Pluggable types enable users to enforce multiple type systems in one programming language. We have developed a suite of tools, called the JavaCOP framework, that allows developers to create pluggable type systems for Java. JavaCOP provides a simple declarative language in which program constraints are defined over a program's abstract syntax tree. The JavaCOP compiler automatically enforces these constraints on programs during compilation. The JavaCOP framework also includes a dataflow analysis API in order to support type systems which depend on flow-sensitive information. Finally, JavaCOP includes a novel test framework which helps users gain confidence in the correctness of their pluggable type systems. We demonstrate the framework by discussing a number of pluggable type systems which have been implemented in JavaCOP in order to detect errors and enforce strong invariants in programs. These type systems range from general-purpose checkers, such as a type system for nonnull references, to domain-specific ones, such as a checker for conformance to a library's usage rules.
Shane Markstrum, Daniel Marino, Matthew Esquivel, Todd D. Millstein, Chris Andreae, James Noble 0001
ACM Trans. Program. Lang. Syst.5
2007 Scoped types and aspects for real-time Java memory management
Chris Andreae, Yvonne Coady, Celina Berg, James Noble 0001, Jan Vitek, Tian Zhao 0002
Real Time Syst.1
2006 Scoped Types and Aspects for Real-Time Java
Chris Andreae, Yvonne Coady, Celina Berg, James Noble 0001, Jan Vitek, Tian Zhao 0002
ECOOP1
2006 A framework for implementing pluggable type systems
abstract
Pluggable types have been proposed to support multiple type systems in the same programming language. We have designed and implemented JavaCOP, a program constraint system for implementing practical pluggable type systems for Java. JavaCOP enforces user-defined typing constraints written in a declarative and expressive rule language. We have validated our design by (re)implementing a range of type systems and program checkers. By using a program constraint system to implement pluggable types, programmers are able to check that their programs will operate correctly in restricted environments, adhere to strict programming rules, avoid null pointer errors or scoped memory exceptions, and meet style guidelines, while programming language researchers can easily experiment with novel type systems.
Chris Andreae, James Noble 0001, Shane Markstrum, Todd D. Millstein
OOPSLA1
2005 Usability methods and mobile devices: an evaluation of MoFax
abstract
When researchers extend a conventional communication application to mobile devices, the communication becomes ubiquitous. We recently examined a mobile communication application from a usability perspective. We found that despite the potentially high utility of the mobile communication application, it had usability issues that required user interface redesign. This paper is an alert for mobile and ubiquitous multimedia designers that they must not ignore usability considerations when designing software and hardware solutions for ubiquitous mobility.
Tim Wright, Pak Yoong, James Noble 0001, Roger Cliffe, Rashina Hoda, Donald Gordon, Chris Andreae
MUM7