research-article

Public Access

Verifying quantitative reliability for programs that execute on unreliable hardware

Authors:

Michael Carbin,

Sasa Misailovic,

Martin C. RinardAuthors Info & Claims

Communications of the ACM, Volume 59, Issue 8

Pages 83 - 91

https://doi.org/10.1145/2958738

Published: 22 July 2016 Publication History

All formats PDF

References

[1]

Achour, S., Rinard, M. Approximate checkers for approximate computations in topaz. In OOPSLA (2015).

Google Scholar

[2]

Ansel, J., Wong, Y., Chan, C., Olszewski, M., Edelman, A., Amarasinghe, S. Language and compiler support for auto-tuning variable-accuracy algorithms. In CGO (2011).

Digital Library

Google Scholar

[3]

Baek, W., Chilimbi, T.M. Green: A framework for supporting energy-conscious programming using controlled approximation. In PLDI (2010).

Digital Library

Google Scholar

[4]

Blum, M., Kanna, S. Designing programs that check their work. In STOC (1989).

Digital Library

Google Scholar

[5]

Carbin, M., Kim, D., Misailovic, S., Rinard, M. Proving acceptability properties of relaxed nondeterministic approximate programs. In PLDI (2012).

Digital Library

Google Scholar

[6]

Carbin, M., Kim, D., Misailovic, S., Rinard, M. Verified integrity properties for safe approximate program transformations. In PEPM (2013).

Digital Library

Google Scholar

[7]

Carbin, M., Rinard, M. Automatically identifying critical input regions and code in applications. In ISSTA (2010).

Digital Library

Google Scholar

[8]

Chaudhuri, S., Gulwani, S., Lublinerman, R., Navidpour, S. Proving programs robust. In FSE (2011).

Digital Library

Google Scholar

[9]

de Kruijf, M., Nomura, S., Sankaralingam, K. Relax: An architectural framework for software recovery of hardware faults. In ISCA (2010).

Digital Library

Google Scholar

[10]

Ernst, D., Kim, N.S., Das, S., Pant, S., Rao, R., Pham, T., Ziesler, C., Blaauw, D., Austin, T., Flautner, K., Mudge, T. Razor: A low-power pipeline based on circuit-level timing speculation. In MICRO (2003).

Digital Library

Google Scholar

[11]

Esmaeilzadeh, H., Sampson, A., Ceze, L., Burger, D. Architecture support for disciplined approximate programming. In ASPLOS (2012).

Digital Library

Google Scholar

[12]

Hoffman, H., Sidiroglou, S., Carbin, M., Misailovic, S., Agarwal, A., Rinard, M. Dynamic knobs for responsive power-aware computing. In ASPLOS (2011).

Digital Library

Google Scholar

[13]

Leem, L., Cho, H., Bau, J., Jacobson, Q., Mitra, S. Ersa: Error resilient system architecture for probabilistic applications. In DATE (2010).

Digital Library

Google Scholar

[14]

Leveson, N., Cha, S., Knight, J.C., Shimeall, T. The use of self checks and voting in software error detection: An empirical study. In IEEE TSE (1990).

Digital Library

Google Scholar

[15]

Liu, S., Pattabiraman, K., Moscibroda, T., Zorn, B. Flikker: Saving dram refresh-power through critical data partitioning. In ASPLOS (2011).

Digital Library

Google Scholar

[16]

Meng, J., Chakradhar, S., Raghunathan, A. Best-effort parallel execution framework for recognition and mining applications. In IPDPS (2009).

Digital Library

Google Scholar

[17]

Misailovic, S., Carbin, M., Achour, S., Qi, Z., Rinard, M. Chisel: Reliability- and accuracy-aware optimization of approximate computational kernels. In OOPSLA (2014).

Digital Library

Google Scholar

[18]

Misailovic, S., Kim, D., Rinard, M. Parallelizing sequential programs with statistical accuracy tests. ACM TECS Special Iss. Prob. Embedded Comput. (2013).

Digital Library

Google Scholar

[19]

Misailovic, S., Roy, D., Rinard, M. Probabilistically accurate program transformations. In SAS (2011).

Digital Library

Google Scholar

[20]

Misailovic, S., Sidiroglou, S., Hoffmann, H., Rinard, M. Quality of service profiling. In ICSE (2010).

Digital Library

Google Scholar

[21]

Narayanan, S., Sartori, J., Kumar, R., Jones, D. Scalable stochastic processors. In DATE (2010).

Digital Library

Google Scholar

[22]

Palem, K. Energy aware computing through probabilistic switching: A study of limits. IEEE Trans. Comput. (2005).

Digital Library

Google Scholar

[23]

Perry, F., Mackey, L., Reis, G., Ligatti, J., August, D., Walker, D. Fault-tolerant typed assembly language. In PLDI (2007).

Digital Library

Google Scholar

[24]

Reis, G., Chang, J., Vachharajani, N., Rangan, R., August, D. Swift: Software implemented fault tolerance. In CGO (2005).

Digital Library

Google Scholar

[25]

Rinard, M. Probabilistic accuracy bounds for fault-tolerant computations that discard tasks. In ICS (2006).

Digital Library

Google Scholar

[26]

Rinard, M., Cadar, C., Dumitran, D., Roy, D., Leu, T., Beebee, W. Jr. Enhancing server availability and security through failure-oblivious computing. In OSDI (2004).

Digital Library

Google Scholar

[27]

Sampson, A., Dietl, W., Fortuna, E., Gnanapragasam, D., Ceze, L., Grossman, D. Ener J: Approximate data types for safe and general low-power computation. In PLDI (2011).

Digital Library

Google Scholar

[28]

Sankaranarayanan, S., Chakarov, A., Gulwani, S. Static analysis for probabilistic programs: Inferring whole program properties from finitely many paths. In PLDI (2013).

Digital Library

Google Scholar

[29]

Sidiroglou, S., Misailovic, S., Hoffmann, H., Rinard, M. Managing performance vs. accuracy trade-offs with loop perforation. In FSE (2011).

Google Scholar

[30]

Zhu, Z., Misailovic, S., Kelner, J., Rinard, M. Randomized accuracy-aware program transformations for efficient approximate computations. In POPL (2012).

Digital Library

Google Scholar

Cited By

View all

Klinkenberg LBlumenthal CChen MHaase DKatoen J(2024)Exact Bayesian Inference for Loopy Probabilistic Programs using Generating FunctionsProceedings of the ACM on Programming Languages10.1145/36498448:OOPSLA1(923-953)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649844
Feng SChen MSu HKaminski BKatoen JZhan N(2023)Lower Bounds for Possibly Divergent Probabilistic ProgramsProceedings of the ACM on Programming Languages10.1145/35860517:OOPSLA1(696-726)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586051
Wang LWang X(2022)Approximate communication for energy-efficient network-on-chipPower-Efficient Network-on-Chips: Design and Evaluation10.1016/bs.adcom.2021.09.004(151-215)Online publication date: 2022
https://doi.org/10.1016/bs.adcom.2021.09.004
Show More Cited By

Index Terms

Verifying quantitative reliability for programs that execute on unreliable hardware
1. Theory of computation
  1. Logic
    1. Programming logic
  2. Semantics and reasoning
    1. Program reasoning
      1. Pre- and post-conditions
      2. Program verification

Recommendations

Verifying quantitative reliability for programs that execute on unreliable hardware
OOPSLA '13: Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications

Emerging high-performance architectures are anticipated to contain unreliable components that may exhibit soft errors, which silently corrupt the results of computations. Full detection and masking of soft errors is challenging, expensive, and, for some ...
Verifying quantitative reliability for programs that execute on unreliable hardware
OOPSLA '13

Emerging high-performance architectures are anticipated to contain unreliable components that may exhibit soft errors, which silently corrupt the results of computations. Full detection and masking of soft errors is challenging, expensive, and, for some ...
Embedded software reliability for unreliable hardware
EMSOFT '14: Proceedings of the 14th International Conference on Embedded Software

While advancements in chip manufacturing technology has accelerated the growth of embedded systems, it has revealed serious reliability and robustness challenges at various abstraction levels that threaten the applicability of scaled technologies [2, 3]...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 59, Issue 8

August 2016

94 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/2975594

Editor:
Moshe Y. Vardi
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 July 2016

Published in CACM Volume 59, Issue 8

Check for updates

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
16,323
Total Downloads

Downloads (Last 12 months)3,534
Downloads (Last 6 weeks)10

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Klinkenberg LBlumenthal CChen MHaase DKatoen J(2024)Exact Bayesian Inference for Loopy Probabilistic Programs using Generating FunctionsProceedings of the ACM on Programming Languages10.1145/36498448:OOPSLA1(923-953)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649844
Feng SChen MSu HKaminski BKatoen JZhan N(2023)Lower Bounds for Possibly Divergent Probabilistic ProgramsProceedings of the ACM on Programming Languages10.1145/35860517:OOPSLA1(696-726)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586051
Wang LWang X(2022)Approximate communication for energy-efficient network-on-chipPower-Efficient Network-on-Chips: Design and Evaluation10.1016/bs.adcom.2021.09.004(151-215)Online publication date: 2022
https://doi.org/10.1016/bs.adcom.2021.09.004
Chen MKatoen JKlinkenberg LWinkler T(2022)Does a Program Yield the Right Distribution?Computer Aided Verification10.1007/978-3-031-13185-1_5(79-101)Online publication date: 7-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-13185-1_5
Batz KFesefeldt IJansen MKatoen JKeßler FMatheja CNoll T(2022)Foundations for Entailment Checking in Quantitative Separation LogicProgramming Languages and Systems10.1007/978-3-030-99336-8_3(57-84)Online publication date: 29-Mar-2022
https://doi.org/10.1007/978-3-030-99336-8_3
Demianiuk VHajaj CKogan K(2021)PCL: Packet Classification with Limited KnowledgeIEEE INFOCOM 2021 - IEEE Conference on Computer Communications10.1109/INFOCOM42981.2021.9488751(1-10)Online publication date: 10-May-2021
https://dl.acm.org/doi/10.1109/INFOCOM42981.2021.9488751
Batz KKaminski BKatoen JMatheja CNoll T(2019)Quantitative separation logic: a logic for reasoning about probabilistic pointer programsProceedings of the ACM on Programming Languages10.1145/32903473:POPL(1-29)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1145/3290347
Alioto MDe VMarongiu A(2018)Energy-Quality Scalable Integrated Circuits and Systems: Continuing Energy Scaling in the Twilight of Moore’s LawIEEE Journal on Emerging and Selected Topics in Circuits and Systems10.1109/JETCAS.2018.28814618:4(653-678)Online publication date: Dec-2018
https://doi.org/10.1109/JETCAS.2018.2881461
Wang LWang XWang Y(2017)ABDTR: Approximation-Based Dynamic Traffic Regulation for Networks-on-Chip Systems2017 IEEE International Conference on Computer Design (ICCD)10.1109/ICCD.2017.31(153-160)Online publication date: Nov-2017
https://doi.org/10.1109/ICCD.2017.31

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations