Simplest Runtime Verification System for Go
Published:
A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.
Published:
Page not found. Your pixels are in another canvas.
About me
This is a page not in th emain menu
Published:
Published:
Due to its simplicity and functionality, Go is receiving attention among developers. However, there are not that many tools to focus on the correctness of Go concurrency. Two recent Go static verification papers (1, 2) extract a system of type equations from the Go source code SSA IR 1 equivalent. A calculus mirrors channel-based behaviors of Go programs (goroutines, functions, channel create/communicate/close, etc.) in the form of mutually recursive definitions. Table1 explains the syntax of MiGo. The behavioral typing system derives from MiGo can be checked for liveness and safety in three steps:
Single Static Assignment (SSA) is a form property of Intermediate Representation (IR), which requires that each variable assigned precisely once. Go has a package that generates SSA IR from source. ↩
Debugging HPC applications
Highlight and visualize differences
Analyzing Go programs
In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications (acceptance rate: 29%), 2015
In Proceedings of Seventh Workshop on Extreme-Scale Programming Tools, Supercomputing Conference, Dallas, Texas, November 2018, 2018
In Student Forum Of FMCAD’19, San Jose, California, USA, October 2019 (Under Submission), 2018
In Proceedings of the IEEE International Conference on Cluster Computing, Albuquerque, New Mexico, September 2019 (acceptance rate: 23%), 2019
In arXiv, 2021
In 2021 IEEE International Symposium on Workload Characterization, 2021
Published:
This is a description of your talk, which is a markdown files that can be all markdown-ified like any other post. Yay markdown!
Published:
This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.
CS3100 Course, University of Utah, School of Computing, 2017
Teaching Mentor for CS3100-Models of Computation. Instructor: Dr. Ganesh Gopalakrishnan
CS4230 Course, University of Utah, School of Computing, 2018
Teaching Mentor for CS4230-Parallel Processing. Instructor: Dr. Ganesh Gopalakrishnan