Chandrasekhar Boyapati

SafeJava: A Unified Type System for Safe Programming (2004)

programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers to partition the locks into a fixed number of equivalence classes...

Chandrasekhar Boyapati, Martin C. Rinard

society today. This thesis presents a new type system that addresses this problem by statically preventing several important classes of programming errors. If a program type checks, we guarantee at...

SafeJava: A Unified Type System for Safe Programming (2004)

Chandrasekhar Boyapati, Martin C. Rinard

society today. This thesis presents a new type system that addresses this problem by statically preventing several important classes of programming errors. If a program type checks, we guarantee at...

Unknown (2004)

society today. This thesis presents a new type system that addresses this problem by statically preventing several important classes of programming errors. If a program type checks, we guarantee at...

ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), October 2001 (2003)

ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), November 2002 (2003)

programs; any well-typed program in our system is free of data races. Our type system is significantly more expressive than previous such type systems. In particular, our system lets programmers...

ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), November 2002 (2003)

programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers to partition the locks into a fixed number of equivalence classes...

ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), October 2001 (2003)

programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers to partition the locks into a xed number of equivalence classes...

Ownership Types for Object Encapsulation (2003)

programs; any well-typed program in our system is free of data races. Our type system is signi cantly more expressive than previous such type systems. In particular, our system lets programmers write...

Chandrasekhar Boyapati, Barbara Liskov, Liuba Shrira

object encapsulation and enable local reasoning about program correctness in object-oriented languages. However, a type system that enforces strict object encapsulation is too constraining: it does...

ACM Symposium on Principles of Programming Languages (POPL), January 2003 (2003)

Chandrasekhar Boyapati, Barbara Liskov, Liuba Shrira

object encapsulation and enable local reasoning about program correctness in object-oriented languages. However, a type system that enforces strict object encapsulation is too constraining: it does...

ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), October 2001 (2003)

Ownership Types for Object Encapsulation (2003)

programs; any well-typed program in our system is free of data races. Our type system is significantly more expressive than previous such type systems. In particular, our system lets programmers...

Chandrasekhar Boyapati, Barbara Liskov, Liuba Shrira

Ownership types provide a statically enforceable way of specifying object encapsulation and enable local reasoning about program correctness in object-oriented languages. However, a type system that...

A Type System for Preventing Data Races and Deadlocks in Java Programs (2002)

Ownership Types for Safe Programming: Preventing Data Races and Deadlocks (2002)

programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers to partition the locks into a xed number of equivalence classes...

A Type System for Preventing Data Races and Deadlocks in Java Programs (2002)

This paper presents a new static type system for multithreaded programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers to...

Safe Concurrent Programming in Java (2002)

programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers to partition the locks into a fixed number of equivalence classes...

Towards An Extensible Virtual Machine (2002)

This paper presents a new static type system for multithreaded programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. In recent previous work, we presented...

Towards An Extensible Virtual Machine (2002)

The Java Virtual Machine Language (JVML) is rapidly emerging as the de-facto standard for representing portable code and Java Virtual Machines (JVMs) are increasingly being used as standard platforms...

A Type System for Preventing Data Races and Deadlocks in Java Programs (2002)

The Java Virtual Machine Language (JVML) is rapidly emerging as the de-facto standard for representing portable code and Java Virtual Machines (JVMs) are increasingly being used as standard platforms...

A Type System for Preventing Data Races and Deadlocks in Java Programs (2002)

This paper presents a new static type system for multi-threaded programs; well-typed programs in our system are guaranteed to be free of data races and deadlocks. Our type system allows programmers...

JPS: A Distributed Persistent Java System (2002)

guaranteed to be free of data races and deadlocks. Our type system allows programmers to partition the locks into a xed number of equivalence classes and specify a partial order among the equivalence...

O(1) Concatenation of Deques With Heap Order (2002)

Distributed persistent object systems provide a convenient environment for applications that need to manage complex long-lived data. Since Java has no persistence model built into it, the tremendous...

Chandrasekhar Boyapati, C. Pandu Rangan

We present a data structure to implement deques with heap order that supports the operations find minimum, push, pop, inject, eject and concatenate two deques, each in O(1) time.

Relaxed Fibonacci heaps: An alternative to Fibonacci heaps with worst case rather than amortized time bounds (2002)

Chandrasekhar Boyapati, C. Pandu Rangan

We present a new data structure called relaxed Fibonacci heaps for implementing priority queues on a RAM. Relaxed Fibonacci heaps support the operations nd minimum, insert, decrease key and meld,...

A Parameterized Type System for Race-Free Java Programs (2001)

A Parameterized Type System for Race-Free Java Programs (2001)

This paper presents a new static type system for multithreaded programs; any well-typed program in our system is free of data races. Our type system is signicantly more expressive than previous such...

A Type System for Preventing Data Races (2001)

This paper presents a new static type system for multithreaded programs; any well-typed program in our system is free of data races. Our type system is significantly more expressive than previous...