Travelled to:1 × China
1 × Switzerland
1 × United Kingdom
2 × Italy
8 × USA
Collaborated with:M.C.Rinard S.Misailovic D.Kim M.Kling S.Sidiroglou M.Fähndrich J.R.Larus B.Boston Zoe Gong S.Achour Z.Qi F.Long V.Ganesh B.D.Carlstrom A.McDonald C.Kozyrakis K.Olukotun Alexander K. Lew Marco F. Cusumano-Towner Benjamin Sherman V.K.Mansinghka S.Rajbhandari Y.He O.Ruwase T.M.Chilimbi H.Hoffmann A.Agarwal M.S.Lam J.Whaley V.B.Livshits M.C.Martin D.Avots C.Unkel J.H.Perkins S.Kim S.Larsen S.P.Amarasinghe J.Bachrach C.Pacheco F.Sherwood G.Sullivan W.Wong Y.Zibin M.D.Ernst
Talks about:program (5) approxim (3) automat (3) verifi (3) properti (2) programm (2) reliabl (2) infinit (2) hardwar (2) execut (2)
Person: Michael Carbin
DBLP: Carbin:Michael
Contributed to:
20142013
2013
20122012
2012
2011
2011
2010
2009
2007
2006
20052018
20202017Wrote 16 papers:
- 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.
- 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.
- 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.
- 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.
- ISSTA-2010-CarbinR #automation #identification
- Automatically identifying critical input regions and code in applications (MC, MCR), pp. 37–48.
- 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.
- PPoPP-2007-CarlstromMCKO #transaction
- Transactional collection classes (BDC, AM, MC, CK, KO), pp. 56–67.
- GPCE-2006-FahndrichCL #generative
- Reflective program generation with patterns (MF, MC, JRL), pp. 275–284.
- PODS-2005-LamWLMACU #database #program analysis #query
- Context-sensitive program analysis as database queries (MSL, JW, VBL, MCM, DA, MC, CU), pp. 1–12.
- OOPSLA-2018-BostonGC #execution #fault tolerance #hardware #modelling #named #programmable #verification
- Leto: verifying application-specific hardware fault tolerance with programmable execution models (BB, ZG, MC), p. 30.
- POPL-2020-LewCSCM #probability #programmable #semantics
- Trace types and denotational semantics for sound programmable inference in probabilistic languages (AKL, MFCT, BS, MC, VKM), p. 32.
- ASPLOS-2017-RajbhandariHRCC #multi #optimisation #performance #scalability
- Optimizing CNNs on Multicores for Scalability, Performance and Goodput (SR, YH, OR, MC, TMC), pp. 267–280.