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
Credible Compilers
TL;DR: This paper presents a new concept in compiler correctness: instead of proving that the compiler performs all of its transformations correctly, the compiler generates a proof that the transformed program correctly implements the input program, so that a simple proof checker can then verify that the program was compiled correctly.
Proceedings ArticleDOI
An integrated synchronization and consistency protocol for the implementation of a high-level parallel programming language
TL;DR: Experimental results that characterize the performance of the integrated synchronization and consistency protocol used in the implementation of Jade, an implicitly parallel language for coarse-grain parallel computation, are presented.
Proceedings ArticleDOI
Comprehensive Java Metadata Tracking for Attack Detection and Repair
TL;DR: ClearTrack, a system that tracks meta-data for each primitive value in Java programs to detect and nullify a range of vulnerabilities such as integer overflow/underflow and SQL/command injection vulnerabilities, is presented.
Posted Content
Efficient Exact Verification of Binarized Neural Networks
Kai Jia,Martin Rinard +1 more
TL;DR: This article proposed a SAT solver for exact verification of binarized neural networks (BNNs) by inducing balanced layer-wise sparsity and low cardinality bounds, and adaptively cancelling the gradients.
Journal ArticleDOI
An order-aware dataflow model for parallel Unix pipelines
TL;DR: In this article, 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.