scispace - formally typeset
M

Martin Rinard

Researcher at Massachusetts Institute of Technology

Publications -  381
Citations -  19269

Martin Rinard is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Data structure & Compiler. The author has an hindex of 70, co-authored 372 publications receiving 18126 citations. Previous affiliations of Martin Rinard include University of California, Santa Barbara & Stanford University.

Papers
More filters
Book

Concurrent constraint programming

Vijay Saraswat, +1 more
TL;DR: This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of computing with partial information, and the concomitant notions of consistency and entailment, and develops the cc family of languages, which is very similar to Milner's CCS.
Proceedings ArticleDOI

Ownership types for safe programming: preventing data races and deadlocks

Chandrasekhar Boyapati, +2 more
TL;DR: A new static type system for multithreaded programs is presented; well-typed programs in the system are guaranteed to be free of data races and deadlocks.
Proceedings ArticleDOI

Automatic patch generation by learning correct code

Fan Long, +1 more
TL;DR: Experimental results show that, on a benchmark set of 69 real-world defects drawn from eight open-source projects, Prophet significantly outperforms the previous state-of-the-art patch generation system.
Proceedings ArticleDOI

Managing performance vs. accuracy trade-offs with loop perforation

Stelios Sidiroglou-Douskos, +3 more
TL;DR: The results indicate that, for a range of applications, this approach typically delivers performance increases of over a factor of two (and up to a factors of seven) while changing the result that the application produces by less than 10%.
Proceedings ArticleDOI

Compositional pointer and escape analysis for Java programs

John Whaley, +1 more
TL;DR: A combined pointer and escape analysis algorithm for Java programs that uses the escape information to eliminate synchronization for objects that are accessed by only one thread and to allocate objects on the stack instead of in the heap.