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
Journal ArticleDOI
Lock Coarsening
Pedro C. Diniz,Martin Rinard +1 more
TL;DR: Experiments with two automatically parallelized applications show these algorithms to be effective in reducing the lock overhead to negligible levels and that an overly aggressive lock coarsening algorithm may harm the overall parallel performance by serializing sections of the parallel computation.
Journal ArticleDOI
Generalized typestate checking using set interfaces and pluggable analyses
TL;DR: A generalization of standard typestate systems in which the typestate of each object is determined by its membership in a collection of abstract typestate sets, which characterizes global sharing patterns.
Journal ArticleDOI
Data size optimizations for java programs
C. Scott Ananian,Martin Rinard +1 more
TL;DR: A set of techniques for reducing the memory consumption of object-oriented programs that include analysis algorithms and optimizations that use the results of these analyses to eliminate fields with constant values, reduce the sizes of fields based on the range of values that can appear in each field, and eliminates fields with common default values or usage patterns.
Book ChapterDOI
Integrating Model Checking and Theorem Proving for Relational Reasoning
TL;DR: The Prioni tool as mentioned in this paper integrates model checking and theorem proving for relational reasoning, taking as input formulas written in Alloy, a declarative language based on relations, to check the validity of Alloy formulas for a given scope that bounds the universe of discourse.
Proceedings ArticleDOI
Probabilistic programming with programmable inference
TL;DR: Inference metaprogramming enables the concise expression of probabilistic models and inference algorithms across diverse elds, such as computer vision, data science, and robotics, within a single Probabilistic programming language.