Travelled to:1 × China
1 × Hungary
1 × Poland
1 × Portugal
1 × South Africa
1 × Switzerland
1 × Turkey
2 × Estonia
2 × Germany
2 × Ireland
4 × France
42 × USA
5 × United Kingdom
6 × Canada
7 × Italy
Collaborated with:V.Kuncak ∅ S.Misailovic M.Carbin R.Rugina A.Salcianu D.Kim P.Lam B.Demsky P.C.Diniz K.Zee S.Achour F.Long H.H.Nguyen C.Boyapati M.S.Lam Jiasi Shen 0001 S.Sidiroglou-Douskos S.Sidiroglou H.Hoffmann V.A.Saraswat V.Ganesh José Pablo Cambronero P.Hawkins A.Aiken K.Fisher M.Sagiv S.Bugrara M.Kling D.M.Roy W.Chin S.Qin J.Zhao M.V.Marinescu C.S.Ananian F.Vivien D.Jackson J.Whaley Z.Qi Feras A. Saad V.K.Mansinghka W.S.Beebee T.Wies T.Leek B.Marnette O.Gheorghioiu R.Lee P.Panangaden Varun Mangalick Rahul Sarpeshkar M.Samak Z.A.Zhu J.A.Kelner F.Craciun J.Rubin M.I.Gordon N.Nguyen C.E.Freer J.H.Perkins M.D.Ernst C.Bouillaguet A.Podelski D.Marinov S.Khurshid L.Zhang Marco F. Cusumano-Towner Ulrich Schaechtle C.W.O'Donnell M.Soos S.Devadas A.Solar-Lezama A.Agarwal P.J.Guo S.McCamant C.Cadar D.Dumitran T.Leu Thurston H. Y. Dang N.Vasilakis Jerry Wu E.Lahtinen N.Rittenhouse P.Piselli S.Kim S.Larsen S.P.Amarasinghe J.Bachrach C.Pacheco F.Sherwood G.Sullivan W.Wong Y.Zibin
Talks about:program (27) analysi (20) data (14) automat (10) structur (9) comput (9) system (7) use (7) approxim (6) constraint (5)
Person: Martin C. Rinard
DBLP: Rinard:Martin_C=
Facilitated 2 volumes:
Ed
EdContributed to:
2015
201520152014
2014
20142013
2013
2012
2012
2012201220122012
20122011
2011
201120112011
2011201020102010
200920092009
200920082007
2007
20072007
2007200620062005
20052005200520052005
2004
20042004200420042003
2003
2003
2003
20032003200320032003200220022002200120012001200120012000200019991999199919971997199719961992199119911990
2015
2018
2018201920192016201920192020Wrote 92 papers:
- ASPLOS-2015-Sidiroglou-Douskos #automation #branch #integer #using
- Targeted Automatic Integer Overflow Discovery Using Goal-Directed Conditional Branch Enforcement (SSD, EL, NR, PP, FL, DK, MCR), pp. 473–486.
- ISSTA-2015-QiLAR #analysis #correctness #generative
- An analysis of patch plausibility and correctness for generate-and-validate patch generation systems (ZQ, FL, SA, MCR), pp. 24–36.
- OOPSLA-2015-AchourR #approximate #detection
- Approximate computation with outlier detection in Topaz (SA, MCR), pp. 711–730.
- OOPSLA-2014-MisailovicCAQR #approximate #kernel #named #optimisation
- Chisel: reliability- and accuracy-aware optimization of approximate computational kernels (SM, MC, SA, ZQ, MCR), pp. 309–328.
- PLDI-2014-LongSR #automation #fault #runtime
- Automatic runtime error repair and containment via recovery shepherding (FL, SSD, MCR), p. 26.
- POPL-2014-LongSKR #fault #generative #integer
- Sound input filter generation for integer overflow errors (FL, SSD, DK, MCR), pp. 439–452.
- OOPSLA-2013-CarbinMR #hardware #reliability #source code #verification
- Verifying quantitative reliability for programs that execute on unreliable hardware (MC, SM, MCR), pp. 33–52.
- PEPM-2013-CarbinKMR #approximate #program transformation
- Verified integrity properties for safe approximate program transformations (MC, DK, SM, MCR), pp. 63–66.
- DAC-2012-Rinard #reasoning
- Obtaining and reasoning about good enough software (MCR), pp. 930–935.
- ESOP-2012-HawkinsAFRS #reasoning
- Reasoning about Lock Placements (PH, AA, KF, MCR, MS), pp. 336–356.
- ICSE-2012-LongGCSR #automation
- Automatic input rectification (FL, VG, MC, SS, MCR), pp. 80–90.
- OOPSLA-2012-KlingMCR #infinity #named #on-demand
- Bolt: on-demand infinite loop escape in unmodified binaries (MK, SM, MC, MCR), pp. 431–450.
- PLDI-2012-CarbinKMR #approximate #nondeterminism #proving #source code
- Proving acceptability properties of relaxed nondeterministic approximate programs (MC, DK, SM, MCR), pp. 169–180.
- PLDI-2012-HawkinsAFRS #concurrent #data transformation #representation #synthesis
- Concurrent data representation synthesis (PH, AA, KF, MCR, MS), pp. 417–428.
- POPL-2012-ZhuMKR #approximate #performance #program transformation #random
- Randomized accuracy-aware program transformations for efficient approximate computations (ZAZ, SM, JAK, MCR), pp. 441–454.
- SAT-2012-GaneshOSDRS #named #problem #satisfiability
- Lynx: A Programmatic SAT Solver for the RNA-Folding Problem (VG, CWO, MS, SD, MCR, ASL), pp. 143–156.
- ASPLOS-2011-HoffmannSCMAR #power management
- Dynamic knobs for responsive power-aware computing (HH, SS, MC, SM, AA, MCR), pp. 199–212.
- ECOOP-2011-CarbinMKR #detection #infinity
- Detecting and Escaping Infinite Loops with Jolt (MC, SM, MK, MCR), pp. 609–633.
- ESEC-FSE-2011-Sidiroglou-DouskosMHR #performance #trade-off
- Managing performance vs. accuracy trade-offs with loop perforation (SSD, SM, HH, MCR), pp. 124–134.
- PEPM-2011-Rinard #bound #probability #program analysis #program transformation #source code
- Probabilistic accuracy bounds for perforated programs: a new foundation for program analysis and transformation (MCR), pp. 79–80.
- PLDI-2011-HawkinsAFRS #data transformation #representation #synthesis
- Data representation synthesis (PH, AA, KF, MCR, MS), pp. 38–49.
- PLDI-2011-KimR #commutative #data type #linked data #open data #semantics #verification
- Verification of semantic commutativity conditions and inverse operations on linked data structures (DK, MCR), pp. 528–541.
- SAS-2011-MisailovicRR #program transformation
- Probabilistically Accurate Program Transformations (SM, DMR, MCR), pp. 316–333.
- ICSE-2010-MisailovicSHR #profiling #quality
- Quality of service profiling (SM, SS, HH, MCR), pp. 25–34.
- ISSTA-2010-CarbinR #automation #identification
- Automatically identifying critical input regions and code in applications (MC, MCR), pp. 37–48.
- OOPSLA-2010-RinardHMS #analysis #comprehension #statistics
- Patterns and statistical analysis for understanding reduced resource computing (MCR, HH, SM, SS), pp. 806–821.
- CADE-2009-Rinard #proving #reasoning
- Integrated Reasoning and Proof Choice Point Selection in the Jahob System — Mechanisms for Program Survival (MCR), pp. 1–16.
- ICSE-2009-GaneshLR #fuzzing
- Taint-based directed whitebox fuzzing (VG, TL, MCR), pp. 474–484.
- PLDI-2009-ZeeKR #imperative #proving #source code
- An integrated proof language for imperative programs (KZ, VK, MCR), pp. 338–351.
- SOSP-2009-PerkinsKLABCPSSSWZER #automation #fault
- Automatically patching errors in deployed software (JHP, SK, SL, SPA, JB, MC, CP, FS, SS, GS, WFW, YZ, MDE, MCR), pp. 87–102.
- PLDI-2008-ZeeKR #data type #functional #linked data #open data #verification
- Full functional verification of linked data structures (KZ, VK, MCR), pp. 349–361.
- CADE-2007-KuncakR #algebra #performance #satisfiability #towards
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (VK, MCR), pp. 215–230.
- FoSSaCS-2007-MarnetteKR #bound #constraints #polynomial #set
- Polynomial Constraints for Sets with Cardinality Bounds (BM, VK, MCR), pp. 258–273.
- ISMM-2007-NguyenR #detection #memory management #using
- Detecting and eliminating memory leaks using cyclic memory allocation (HHN, MCR), pp. 15–30.
- OOPSLA-2007-Rinard #termination #using
- Using early phase termination to eliminate load imbalances at barrier synchronization points (MCR), pp. 369–386.
- OOPSLA-2007-Rinard07a
- Living in the comfort zone (MCR), pp. 611–622.
- VMCAI-2007-BouillaguetKWZR #data type #first-order #proving #theorem proving #using #verification
- Using First-Order Theorem Provers in the Jahob Data Structure Verification System (CB, VK, TW, KZ, MCR), pp. 74–88.
- ISSTA-2006-DemskyEGMPR #consistency #data type #specification
- Inference and enforcement of data structure consistency specifications (BD, MDE, PJG, SM, JHP, MCR), pp. 233–244.
- VMCAI-2006-WiesKLPR #analysis #constraints
- Field Constraint Analysis (TW, VK, PL, AP, MCR), pp. 157–173.
- CADE-2005-KuncakNR #algebra #algorithm
- An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic (VK, HHN, MCR), pp. 260–277.
- CC-2005-LamKR #consistency #data type #named #verification
- Hob: A Tool for Verifying Data Structure Consistency (PL, VK, MCR), pp. 237–241.
- ICSE-2005-DemskyR #data type #reasoning #using
- Data structure repair using goal-directed reasoning (BD, MCR), pp. 176–185.
- SAS-2005-ChinNQR #memory management #object-oriented #source code #verification
- Memory Usage Verification for OO Programs (WNC, HHN, SQ, MCR), pp. 70–86.
- SAT-2005-MarinovKBZR #compilation #declarative #modelling #optimisation
- Optimizations for Compiling Declarative Models into Boolean Formulas (DM, SK, SB, LZ, MCR), pp. 187–202.
- VMCAI-2005-LamKR #consistency #data type #type system
- Generalized Typestate Checking for Data Structure Consistency (PL, VK, MCR), pp. 430–447.
- VMCAI-2005-SalcianuR #analysis #java #source code
- Purity and Side Effect Analysis for Java Programs (AS, MCR), pp. 199–215.
- FSE-2004-RinardSB #analysis #aspect-oriented #classification #source code
- A classification system and analysis for aspect-oriented programs (MCR, AS, SB), pp. 147–158.
- OSDI-2004-RinardCDRLB #security
- Enhancing Server Availability and Security Through Failure-Oblivious Computing (MCR, CC, DD, DMR, TL, WSB), pp. 303–316.
- PLDI-2004-ChinCQR #object-oriented
- Region inference for an object-oriented language (WNC, FC, SQ, MCR), pp. 243–254.
- SAS-2004-KuncakR #logic
- Generalized Records and Spatial Conjunction in Role Logic (VK, MCR), pp. 361–376.
- VMCAI-2004-KuncakR #algebra #analysis #constraints
- Boolean Algebra of Shape Analysis Constraints (VK, MCR), pp. 59–72.
- ECOOP-2003-LamR #analysis #automation #design #type system
- A Type System and Analysis for the Automatic Extraction and Enforcement of Design Information (PL, MCR), pp. 275–302.
- FASE-2003-ZhaoR #aspectj #behaviour #interface #named #specification
- Pipa: A Behavioral Interface Specification Language for AspectJ (JZ, MCR), pp. 150–165.
- FME-2003-MarinescuR #composition #design #framework
- A Formal Framework for Modular Synchronous System Design (MCVM, MCR), pp. 482–502.
- LCTES-2003-AnanianR #java #optimisation #source code
- Data size optimizations for java programs (CSA, MCR), pp. 59–68.
- LICS-2003-KuncakR #decidability #recursion #type system
- Structural Subtyping of Non-Recursive Types is Decidable (VK, MCR), pp. 96–107.
- OOPSLA-2003-DemskyR #automation #data type #detection #fault
- Automatic detection and repair of errors in data structures (BD, MCR), pp. 78–95.
- PLDI-2003-BoyapatiSBR #java #memory management #realtime
- Ownership types for safe region-based memory management in real-time Java (CB, AS, WSB, MCR), pp. 324–337.
- POPL-2003-GheorghioiuSR #analysis #interprocedural
- Interprocedural compatibility analysis for static object preallocation (OG, AS, MCR), pp. 273–284.
- SAS-2003-KuncakR #abstraction #decidability
- Existential Heap Abstraction Entailment Is Undecidable (VK, MCR), pp. 418–438.
- ICSE-2002-DemskyR #object-oriented #source code
- Role-based exploration of object-oriented programs (BD, MCR), pp. 313–334.
- OOPSLA-2002-BoyapatiLR #programming
- Ownership types for safe programming: preventing data races and deadlocks (CB, RL, MCR), pp. 211–230.
- OOPSLA-2002-ZeeR #static analysis
- Write barrier removal by static analysis (KZ, MCR), pp. 191–210.
- POPL-2002-KuncakLR #analysis
- Role analysis (VK, PL, MCR), pp. 17–32.
- CC-2001-RuginaR #compilation
- Design-Driven Compilation (RR, MCR), pp. 150–164.
- OOPSLA-2001-BoyapatiR #java #source code #type system
- A Parameterized Type System for Race-Free Java Programs (CB, MCR), pp. 56–69.
- PLDI-2001-VivienR #analysis #pointer
- Incrementalized Pointer and Escape Analysis (FV, MCR), pp. 35–46.
- PPoPP-2001-SalcianuR #analysis #parallel #pointer #source code #thread
- Pointer and escape analysis for multithreaded programs (AS, MCR), pp. 12–23.
- SAS-2001-Rinard #analysis #parallel #source code #thread
- Analysis of Multithreaded Programs (MCR), pp. 1–19.
- FoSE-2000-JacksonR #analysis #roadmap
- Software analysis: a roadmap (DJ, MCR), pp. 133–145.
- PLDI-2000-RuginaR #analysis #array #bound #memory management #pointer
- Symbolic bounds analysis of pointers, array indices, and accessed memory regions (RR, MCR), pp. 182–195.
- OOPSLA-1999-WhaleyR #analysis #composition #java #pointer #source code
- Compositional Pointer and Escape Analysis for Java Programs (JW, MCR), pp. 187–206.
- PLDI-1999-RuginaR #analysis #parallel #pointer #source code #thread
- Pointer Analysis for Multithreaded Programs (RR, MCR), pp. 77–90.
- PPoPP-1999-RuginaR #algorithm #automation #divide and conquer #parallel
- Automatic Parallelization of Divide and Conquer Algorithms (RR, MCR), pp. 72–83.
- PLDI-1997-DinizR #adaptation #effectiveness #feedback
- Dynamic Feedback: An Effective Technique for Adaptive Computing (PCD, MCR), pp. 71–84.
- POPL-1997-RinardD #parallel
- Synchronization Transformations for Parallel Computing (PCD, MCR), pp. 187–200.
- PPoPP-1997-Rinard #automation #effectiveness #source code #using
- Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives (MCR), pp. 112–123.
- PLDI-1996-RinardD #analysis #commutative #compilation #framework
- Commutativity Analysis: A New Analysis Framework for Parallelizing Compilers (MCR, PCD), pp. 54–67.
- POPL-1992-RinardL #semantics
- Semantic Foundations of Jade (MCR, MSL), pp. 105–118.
- POPL-1991-SaraswatRP #concurrent #constraints #programming #semantics
- Semantic Foundations of Concurrent Constraint Programming (VAS, MCR, PP), pp. 333–352.
- PPoPP-1991-LamR #parallel #programming
- Coarse-Grain Parallel Programming in Jade (MSL, MCR), pp. 94–105.
- POPL-1990-SaraswatR #concurrent #constraints #programming
- Concurrent Constraint Programming (VAS, MCR), pp. 232–245.
- ASE-2015-RubinGNR #communication #mobile
- Covert Communication in Mobile Applications (T) (JR, MIG, NN, MCR), pp. 647–657.
- SLE-2018-Rinard #approach #correctness #reliability
- A new approach for software correctness and reliability (MCR), pp. 1–2.
- Onward-2018-RinardSM #learning #source code
- Active learning for inference and regeneration of computer programs that store and retrieve data (MCR, JS0, VM), pp. 12–28.
- Onward-2019-CambroneroDV0WR #learning #re-engineering
- Active learning for software engineering (JPC, THYD, NV, JS0, JW, MCR), pp. 62–78.
- OOPSLA-2019-CambroneroR #learning #named #source code
- AL: autogenerating supervised learning programs (JPC, MCR), p. 28.
- PLDI-2016-AchourSR #programmable #synthesis
- Configuration synthesis for programmable analog devices with Arco (SA, RS, MCR), pp. 177–193.
- PLDI-2019-0001R #database #learning #modelling #using
- Using active learning to synthesize models of applications that access databases (JS0, MCR), pp. 269–285.
- POPL-2019-SaadCSRM #automation #modelling #probability #source code #synthesis
- Bayesian synthesis of probabilistic programs for automatic data modeling (FAS, MFCT, US, MCR, VKM), p. 32.
- POPL-2020-SaadFRM #approximate #probability
- Optimal approximate sampling from discrete probability distributions (FAS, CEF, MCR, VKM), p. 31.
- POPL-2020-SamakKR
- Synthesizing replacement classes (MS, DK, MCR), p. 33.