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
Journal ArticleDOI

Development and validation of a pancreatic cancer prediction model from electronic health records using machine learning.

TL;DR: A model for early PDAC prediction in the general population, using electronic health records, is developed using mobile devices for diagnosis of pancreatic Adenocarcinoma at an advanced stage.
Book ChapterDOI

A Formal Framework for Modular Synchronous System Design

TL;DR: In this paper, the authors present a formal framework for specifying and automatically implementing systems such as digital circuits and network protocols, which can reduce the design time and effort required to build correct, efficient, complex systems and eliminate the need for the designer to deal directly with global synchronization and concurrency issues.
Posted Content

Dataflow Analysis With Prophecy and History Variables.

TL;DR: This work uses prophecy variables, which predict information about the future program execution, to enable forward reasoning for backward dataflow analyses and is the first to use prophecy variables for dataflow analysis.
Posted Content

The Three Pillars of Machine-Based Programming.

TL;DR: This position paper describes the vision of the future of machine-based programming through a categorical examination of three pillars of research: intention, invention, and adaptation.
Posted Content

An Order-Aware Dataflow Model for Parallel Unix Pipelines

TL;DR: In this paper, the authors present a dataflow model for modeling parallel Unix shell pipelines, which captures the semantics of transformations that exploit data parallelism available in Unix shell computations and prove their correctness.