Proving acceptability properties of relaxed nondeterministic approximate programs

ACM SIGPLAN Notices

Volumn 47, Issue 6, 2012, Pages 169-180

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Acceptability; Coq; Relational Hoare Logic; Relaxed Programs

Indexed keywords

ACCEPTABILITY; APPROXIMATE FUNCTION; COMMON STRUCTURES; COQ; DATA TYPE; DYNAMIC SEMANTIC; HOARE LOGIC; LANGUAGE CONSTRUCTS; LOOP PERFORATIONS; MEMOIZATION; NON-DETERMINISM; PROGRAM TRANSFORMATIONS; REASONING APPROACH; RELATIONAL REASONING; SYNCHRONIZATION ELIMINATION; TARGET PROGRAMMING LANGUAGE;

COMMERCE;

SEMANTICS;

EID: 84866368235     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2345156.2254086     Document Type: Conference Paper

References (39)

1. The Coq Proof Assistant. http://coq.inria.fr.
2. Scimark 2.0. http://math.nist.gov/scimark2.
3. J. Ansel, C. Chan, Y. L. Wong, M. Olszewski, Q. Zhao, A. Edelman, and S. Amarasinghe. Petabricks: A language and compiler for algorithmic choice. PLDI, 2009.
4. W. Baek and T. M. Chilimbi. Green: A framework for supporting energy-conscious programming using controlled approximation. PLDI, 2010.
5. G. Barthe, J. Crespo, and C. Kunz. Relational verification using product programs. FM, 2011.
6. G. Barthe, B. Kopf, 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. W. Blume and R. Eigenmann. Performance analysis of parallelizing compilers on the Perfect Benchmarks programs. Transactions on Parallel and Distributed Systems, 3(6), 1992.
9. M. Carbin, D. Kim, S. Misailovic, and M. Rinard. Reasoning about Relaxed Programs. Technical Report MIT-CSAIL-TR-2011-050, MIT, 2011.
10. M. Carbin and M. Rinard. Automatically Identifying Critical Input Regions and Code in Applications. ISSTA, 2010.
11. S. Chaudhuri, S. Gulwani, R. Lublinerman, and S. Navidpour. Proving Programs Robust. FSE, 2011.
12. J.M. Crespo and C. Kunz. A machine-checked framework for relational separation logic. SEFM, 2011.
13. B. Demsky and M. Rinard. Data structure repair using goal-directed reasoning. ICSE, 2005.
14. R. W. Floyd. Assigning meanings to programs. Mathematical aspects of computer science, 19(19-32), 1967.
15. C. A. R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10), October 1969.
16. H. Hoffman, S. Sidiroglou, M. Carbin, S. Misailovic, A. Agarwal, and M. Rinard. Dynamic knobs for responsive power-aware computing. ASPLOS, 2011.
17. H. Hoffmann, S. Misailovic, S. Sidiroglou, A. Agarwal, and M. Rinard. Using Code Perforation to Improve Performance, Reduce Energy Consumption, and Respond to Failures . Technical Report MITCSAIL-TR-2009-042, MIT, 2009.
18. S. Liu, K. Pattabiraman, T. Moscibroda, and B. Zorn. Flikker: Saving dram refresh-power through critical data partitioning. ASPLOS, 2011.
19. A. Milicevic, D. Rayside, K. Yessenov, and D. Jackson. Unifying execution of imperative and declarative code. ICSE, 2011.
20. S. Misailovic, D. Kim, and M. Rinard. Parallelizing sequential programs with statistical accuracy tests. Technical Report MIT-CSAILTR-2010-038, MIT, 2010.
21. S. Misailovic, D. Roy, and M. Rinard. Probabilistically Accurate Program Transformations. SAS, 2011.
22. S. Misailovic, S. Sidiroglou, H. Hoffmann, and M. Rinard. Quality of service profiling. ICSE, 2010.
23. C. Morgan. The specification statement. Transactions on Programming Languages and Systems, 10(3), 1988.
24. A. Nanevski, A. Banerjee, and D. Garg. Verification of information flow and access control policies with dependent types. SP, 2011.
25. J. Nelson, A. Sampson, and L. Ceze. Dense approximate storage in phase-change memory. ASPLOS-WACI, 2011.
26. A. Pnueli, M. Siegel, and E. Singerman. Translation validation. TACAS, 1998.
27. D. Rayside, A. Milicevic, K. Yessenov, G. Dennis, and D. Jackson. Agile specifications. OOPSLA, 2009.
28. M. Rinard. Acceptability-oriented computing. OOPSLA Onwards '03.
29. M. Rinard. Probabilistic accuracy bounds for fault-Tolerant computations that discard tasks. ICS, 2006.
30. M. Rinard. Using early phase termination to eliminate load imbalances at barrier synchronization points. OOPSLA, 2007.
31. M. C. Rinard and D. Marinov. Credible compilation with pointers. RTRV, 1999.
32. Martin Rinard. A lossy, synchronization-free, race-full, but still acceptably accurate parallel space-subdivision tree construction algorithm. Technical Report MIT-CSAIL-TR-2012-005, MIT, 2012.
33. H. Samimi, E. Aung, and T. Millstein. Falling back on executable specifications. ECOOP, 2010.
34. A. Sampson, W. Dietl, E. Fortuna, D. Gnanapragasam, L. Ceze, and D. Grossman. Enerj: Approximate data types for safe and general lowpower computation. PLDI, 2011.
35. S. Sidiroglou, S. Misailovic, H. Hoffmann, and M. Rinard. Managing Performance vs. Accuracy Trade-offsWith Loop Perforation. FSE '11.
36. H Yang. Relational separation logic. Theoretical Computer Science, 375(1-3), May 2007.
37. J. Yang, K. Yessenov, and A. Solar-Lezama. A language for automatically enforcing privacy policies. POPL, 2012.
38. Z. Zhu, S. Misailovic, J. Kelner, and M. Rinard. Randomized accuracy-aware program transformations for efficient approximate computations. POPL, 2012.
39. L. Zuck, A. Pnueli, and R. Leviathan. Validation of optimizing compilers. Technical report, Weizmann Institute of Science, 2001.