Verifying quantitative reliability for programs that execute on unreliable hardware

Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA

Volumn , Issue , 2013, Pages 33-52

  Carbin, Michael ^a   Misailovic, Sasa ^a   Rinard, Martin C ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximate computing

Indexed keywords

APPROXIMATE COMPUTING; COMPUTING APPLICATIONS; HARDWARE SPECIFICATIONS; HIGH-PERFORMANCE ARCHITECTURE; MULTIMEDIA PROCESSING; RELIABILITY ENGINEERING; RELIABILITY REQUIREMENTS; UNRELIABLE HARDWARES;

COMPUTER PROGRAMMING LANGUAGES; HARDWARE; OBJECT ORIENTED PROGRAMMING; SPECIFICATIONS;

RELIABILITY ANALYSIS;

EID: 84888167548     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2509136.2509546     Document Type: Conference Paper

References (71)

1. J. Ansel, Y. Wong, C. Chan, M. Olszewski, A. Edelman, and S. Amarasinghe. Language and compiler support for auto-tuning variableaccuracy algorithms. CGO, 2011.
2. W. Baek and T. M. Chilimbi. Green: A framework for supporting energy-conscious programming using controlled approximation. PLDI, 2010.
3. T. Bao, Y. Zheng, and X. Zhang. White box sampling in uncertain data processing enabled by program analysis. OOPSLA, 2012.
4. G. Barthe, D. Demange, and D. Pichardie. A formally verified ssabased middle-end: Static single assignment meets compcert. ESOP, 2012.
5. G. Barthe, B. Gŕegoire, and S. Zanella B́eguelin. Formal certification of code-based cryptographic proofs. POPL, 2009.
6. G. Barthe, B. K̈opf, F. Olmedo, and S. Zanella B́eguelin. Probabilistic reasoning for differential privacy. POPL, 2012.
7. N. Benton. Simple relational correctness proofs for static analyses and program transformations. POPL, 2004.
8. M. Blum and S. Kanna. Designing programs that check their work. STOC, 1989.
9. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of computer and system sciences, 1993.
10. F. Cappello, A. Geist, B. Gropp, L. Kale, B. Kramer, and M. Snir. Toward exascale resilience. International Journal of High Performance Computing Applications, 2009.
11. M. Carbin, D. Kim, S. Misailovic, and M. Rinard. Proving acceptability properties of relaxed nondeterministic approximate programs. PLDI, 2012.
12. M. Carbin, D. Kim, S. Misailovic, and M. Rinard. Verified integrity properties for safe approximate program transformations. PEPM, 2013.
13. M. Carbin, S. Misailovic, M. Kling, and M. Rinard. Detecting and escaping infinite loops with Jolt. ECOOP, 2011.
14. M. Carbin, S. Misailovic, and M. Rinard. Verifying quantitative reliability of programs that execute on unreliable hardware. Technical Report MIT-CSAIL-TR-2013-014, MIT, 2013
15. M. Carbin and M. Rinard. Automatically identifying critical input regions and code in applications. ISSTA, 2010.
16. F. Chaitin-Chatelin and V. Fraysse. Lectures on finite precision computations. 1996.
17. S. Chaudhuri, S. Gulwani, R. Lublinerman, and S. Navidpour. Proving programs robust. FSE, 2011.
18. P. Cousot and M. Monerau. Probabilistic abstract interpretation. ESOP, 2012.
19. M. de Kruijf, S. Nomura, and K. Sankaralingam. Relax: an architectural framework for software recovery of hardware faults. ISCA '10.
20. A. Di Pierro and H. Wiklicky. Concurrent constraint programming: Towards probabilistic abstract interpretation. PPDP, 2000.
21. E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. CACM, 18(8), August 1975.
22. D. Ernst, N. S. Kim, S. Das, S. Pant, R. Rao, T. Pham, C. Ziesler, D. Blaauw, T. Austin, K. Flautner, and T. Mudge. Razor: A low-power pipeline based on circuit-level timing speculation. MICRO, 2003.
23. H. Esmaeilzadeh, A. Sampson, L. Ceze, and D. Burger. Architecture support for disciplined approximate programming. ASPLOS, 2012.
24. H. Esmaeilzadeh, A. Sampson, L. Ceze, and D. Burger. Neural acceleration for general-purpose approximate programs. MICRO, 2012.
25. S. Feng, S. Gupta, A. Ansari, and S. Mahlke. Shoestring: probabilistic soft error reliability on the cheap. ASPLOS, 2010.
26. A. Filieri, C. P̌ašareanu, and W. Visser. Reliability analysis in symbolic pathfinder. ICSE, 2013.
27. M. Hiller, A. Jhumka, and N. Suri. On the placement of software mechanisms for detection of data errors. DSN, 2002.
28. H. Hoffmann, S. Sidiroglou, M. Carbin, S. Misailovic, A. Agarwal, and M. Rinard. Dynamic knobs for responsive power-aware computing. ASPLOS, 2011.
29. M. Kling, S. Misailovic, M. Carbin, and M. Rinard. Bolt: on-demand infinite loop escape in unmodified binaries. OOPSLA, 2012.
30. K. Knobe and V. Sarkar. Array ssa form and its use in parallelization. POPL, 1998.
31. D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 1981.
32. K. Lee, A. Shrivastava, I. Issenin, N. Dutt, and N. Venkatasubramanian. Mitigating soft error failures for multimedia applications by selective data protection. CASES, 2006.
33. L. Leem, H. Cho, J. Bau, Q. Jacobson, and S. Mitra. Ersa: error resilient system architecture for probabilistic applications. DATE, 2010.
34. N. Leveson, S. Cha, J. C. Knight, and T. Shimeall. The use of self checks and voting in software error detection: An empirical study. IEEE TSE, 1990.
35. N. Leveson and P. Harvey. Software fault tree analysis. Journal of Systems and Software, 3(2), 1983.
36. X. Li and D. Yeung. Application-level correctness and its impact on fault tolerance. HPCA, 2007.
37. S. Liu, K. Pattabiraman, T. Moscibroda, and B. Zorn. Flikker: saving dram refresh-power through critical data partitioning. ASPLOS, 2011.
38. F. Long, V. Ganesh, M. Carbin, S. Sidiroglou, and Martin Rinard. Automatic input rectification. ICSE, 2012.
39. Xiph.org Video Test Media. http://media.xiph.org/video/derf.
40. J. Meng, A. Raghunathan, S. Chakradhar, and S. Byna. Exploiting the forgiving nature of applications for scalable parallel execution. IPDPS, 2010.
41. S. Misailovic, D. Kim, and M. Rinard. Parallelizing sequential programs with statistical accuracy tests. ACM TECS Special Issue on Probabilistic Embedded Computing, 2013.
42. S. Misailovic, D. Roy, and M. Rinard. Probabilistically accurate program transformations. SAS, 2011.
43. S. Misailovic, S. Sidiroglou, H. Hoffmann, and M. Rinard. Quality of service profiling. ICSE, 2010.
44. D. Monniaux. Abstract interpretation of probabilistic semantics. SAS, 2000.
45. C. Morgan, A. McIver, and K. Seidel. Probabilistic predicate transformers. TOPLAS, 1996.
46. D. Murta and J. N. Oliveira. Calculating fault propagation in functional programs. Technical report, Univ. Minho, 2013.
47. Narayanan S.,Sartori J.,Kumar R.,Jones D. , Scalable stochastic processors, DATE, 2010.
48. J. Nelson, A. Sampson, and L. Ceze. Dense approximate storage in phase-change memory. ASPLOS Ideas & Perspectives, 2011.
49. K. Palem. Energy aware computing through probabilistic switching: A study of limits. IEEE Transactions on Computers, 2005.
50. K. Pattabiraman, V. Grover, and B. Zorn. Samurai: protecting critical data in unsafe languages. EuroSys, 2008.
51. J. Perkins, S. Kim, S. Larsen, S. Amarasinghe, J. Bachrach, M. Carbin, C. Pacheco, F. Sherwood, S. Sidiroglou, G. Sullivan, W. Wong, Y. Zibin, M. Ernst, and M. Rinard. Automatically patching errors in deployed software. SOSP, 2009.
52. F. Perry, L. Mackey, G.A. Reis, J. Ligatti, D.I. August, and D. Walker. Fault-tolerant typed assembly language. PLDI, 2007.
53. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. TACAS, 1998.
54. P. Prata and J. Silva. Algorithm based fault tolerance versus resultchecking for matrix computations. FTCS, 1999.
55. J. Reed and B. Pierce. Distance makes the types grow stronger: A calculus for differential privacy. ICFP, 2010.
56. G. Reis, J. Chang, N. Vachharajani, R. Rangan, and D. August. Swift: Software implemented fault tolerance. CGO 05, 2005.
57. M. Rinard. Acceptability-oriented computing. OOPSLA, 2003.
58. M. Rinard. Probabilistic accuracy bounds for fault-tolerant computations that discard tasks. ICS, 2006.
59. M. Rinard. Using early phase termination to eliminate load imbalances at barrier synchronization points. OOPSLA, 2007.
60. M. Rinard, C. Cadar, D. Dumitran, D.M. Roy, T. Leu, and W.S. Beebee Jr. Enhancing server availability and security through failureoblivious computing. OSDI, 2004.
61. M. Rinard, H. Hoffmann, S. Misailovic, and S. Sidiroglou. Patterns and statistical analysis for understanding reduced resource computing. OOPSLA Onwards!, 2010.
62. M. Rinard and D. Marinov. Credible compilation with pointers. RTRV, 1999.
63. A. Sampson, W. Dietl, E. Fortuna, D. Gnanapragasam, L. Ceze, and D. Grossman. Enerj: Approximate data types for safe and general low-power computation. PLDI, 2011.
64. S. Sankaranarayanan, A. Chakarov, and S. Gulwani. Static analysis for probabilistic programs: inferring whole program properties from finitely many paths. PLDI, 2013.
65. C. Schlesinger, K. Pattabiraman, N. Swamy, D. Walker, and B. Zorn. Yarra: An extension to c for data integrity and partial safety. CSF '11.
66. P. Shivakumar, M. Kistler, S.W. Keckler, D. Burger, and L. Alvisi. Modeling the effect of technology trends on the soft error rate of combinational logic. DSN, 2002.
67. S. Sidiroglou, S. Misailovic, H. Hoffmann, and M. Rinard. Managing performance vs. accuracy trade-offs with loop perforation. FSE, 2011.
68. M. Smith. Probabilistic abstract interpretation of imperative programs using truncated normal distributions. Electronic Notes in Theoretical Computer Science, 2008.
69. A. Thomas and K. Pattabiraman. Error detector placement for soft computation. DSN, 2013.
70. . http://www.videolan.org/x264.html.
71. Z. Zhu, S. Misailovic, J. Kelner, and M. Rinard. Randomized accuracy-aware program transformations for efficient approximate computations. POPL, 2012.