Export Citations
- Author:
- Hanan Samet
No abstract available.
Cited By
Brown F, Renner J, Nötzli A, Lerner S, Shacham H and Stefan D Towards a verified range analysis for JavaScript JITs Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, (135-150)- Verbeek F, Bockenek J, Bharadwaj A, Ravindran B and Roessle I Establishing a refinement relation between binaries and abstract code Proceedings of the 17th ACM-IEEE International Conference on Formal Methods and Models for System Design, (1-5)
- Sun C, Le V and Su Z (2016). Finding compiler bugs via live code mutation, ACM SIGPLAN Notices, 51:10, (849-863), Online publication date: 5-Dec-2016.
- Sun C, Le V and Su Z Finding compiler bugs via live code mutation Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, (849-863)
- Le V, Sun C and Su Z (2015). Finding deep compiler bugs via guided stochastic program mutation, ACM SIGPLAN Notices, 50:10, (386-399), Online publication date: 18-Dec-2015.
- Le V, Sun C and Su Z Finding deep compiler bugs via guided stochastic program mutation Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, (386-399)
- Le V, Sun C and Su Z Randomized stress-testing of link-time optimizers Proceedings of the 2015 International Symposium on Software Testing and Analysis, (327-337)
- Barthe G, Demange D and Pichardie D (2014). Formal Verification of an SSA-Based Middle-End for CompCert, ACM Transactions on Programming Languages and Systems, 36:1, (1-35), Online publication date: 1-Mar-2014.
- Jourdan J, Pottier F and Leroy X Validating LR(1) parsers Proceedings of the 21st European conference on Programming Languages and Systems, (397-416)
- Zimmermann W On the correctness of transformations in compiler back-ends Proceedings of the First international conference on Leveraging Applications of Formal Methods, (74-95)
- Samet H (1978). Proving the correctness of heuristically optimized code, Communications of the ACM, 21:7, (570-582), Online publication date: 1-Jul-1978.
- Samet H A normal form for compiler testing Proceedings of the 1977 symposium on Artificial intelligence and programming languages, (155-162)
- Samet H (1977). A normal form for compiler testing, ACM SIGART Bulletin:64, (155-162), Online publication date: 1-Aug-1977.
- Samet H (1977). A normal form for compiler testing, ACM SIGPLAN Notices, 12:8, (155-162), Online publication date: 1-Aug-1977.
- Samet H Compiler testing via symbolic interpretation Proceedings of the 1976 annual conference, (492-497)
Recommendations
Proving Correctness of an Efficient Abstraction for Interrupt Handling
This paper presents an approach to the efficient abstraction of interrupt handling in microcontroller systems. Such systems usually operate in uncertain environments, giving rise to a high degree of nondeterminism in the corresponding formal models, ...
Proving the correctness of heuristically optimized code
A system for proving that programs written in a high level language are correctly translated to a low level language is described. A primary use of the system is as a postoptimization step in code generation. The low level language programs need not be ...
Proving Total Correctness of Parallel Programs
An approach to proving paralel programs correct is presented. The steps are 1) model the paralel program, 2) prove partial correctness (proper synchronization), and 3) prove the absence of deadlock, livelock, and infinite loops. The parallel program ...