The following pages link to Martin C. Rinard (Q1268805):
Displaying 35 items.
- (Q861704) (redirect page) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- Lock coarsening: Eliminating lock overhead in automatically parallelized object-based programs (Q1268806) (← links)
- Exploiting verified neural networks via floating point numerical error (Q2145326) (← links)
- Verifying low-dimensional input neural networks via input quantization (Q2145327) (← links)
- (Q2764071) (← links)
- Reasoning about Lock Placements (Q2892737) (← links)
- Randomized accuracy-aware program transformations for efficient approximate computations (Q2942894) (← links)
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (Q3608775) (← links)
- Applications experience in Jade (Q4208625) (← links)
- On the Complexity of Commutativity Analysis (Q4341043) (← links)
- (Q4406677) (← links)
- (Q4417827) (← links)
- (Q4424843) (← links)
- (Q4473733) (← links)
- (Q4779111) (← links)
- (Q4813414) (← links)
- Role analysis (Q5178895) (← links)
- Automated Deduction – CADE-20 (Q5394619) (← links)
- Sound input filter generation for integer overflow errors (Q5408440) (← links)
- Using First-Order Theorem Provers in the Jahob Data Structure Verification System (Q5452598) (← links)
- Static Analysis (Q5466572) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711506) (← links)
- Relational and Kleene-Algebraic Methods in Computer Science (Q5712440) (← links)
- Theory and Applications of Satisfiability Testing (Q5713710) (← links)
- Polynomial Constraints for Sets with Cardinality Bounds (Q5758056) (← links)
- Static Analysis (Q5897429) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5898616) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5901903) (← links)
- On the impact of player capability on congestion games (Q6109527) (← links)
- Depth-bounded Epistemic Logic (Q6199597) (← links)
- The Fast Loaded Dice Roller: A Near-Optimal Exact Sampler for Discrete Probability Distributions (Q6336352) (← links)
- Depth-bounded epistemic logic (Q6436633) (← links)
- TRAFS: A Nonsmooth Convex Optimization Algorithm with $\mathcal{O}\left(\frac{1}{\epsilon}\right)$ Iteration Complexity (Q6514254) (← links)
- Edge-dominance games on graphs (Q6736024) (← links)
