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 ChapterDOI
Using first-order theorem provers in the Jahob data structure verification system
TL;DR: The integration of efficient resolution-based theorem provers into the Jahob data structure verification system enables Jahob to automatically verify the correctness of a range of complex dynamically instantiable data structures, such as hash tables and search trees, without the need for interactive theorem proving or techniques tailored to individual data structures.
Journal Article
Generalized lypestate checking for data structure consistency
TL;DR: In this paper, the authors present an analysis to verify abstract set specifications for programs that use object field values to determine the membership of objects in abstract sets, using set algebra formulas whose validity implies the validity of the set specifications.
Journal ArticleDOI
Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems
TL;DR: HiGLOB as mentioned in this paper is a general framework for global load balancing in structured peer-to-peer (P2P) systems, where each node has two key components: a histogram manager maintains a histograms that reflects a global view of the distribution of the load in the system, and a load-balancing manager redistributes the load whenever the node becomes overloaded or underloaded.
The design, implementation and evaluation of Jade: a portable, implicitly parallel programming language
TL;DR: The design, implementation and evaluation of Jade, a new programming language for parallel computations that exploit task-level concurrency, are presented and results that characterize how well they perform are presented.
Journal ArticleDOI
Effective fine-grain synchronization for automatically parallelized programs using optimistic synchronization primitives
TL;DR: Experimental results indicate that the use of optimistic synchronization in this context can significantly reduce the memory consumption and improve the overall performance.