Abstract
In this issue of the SIGLOG newsletter, the technical column on verification presents an invited contribution on "Algorithmic Logic-Based Verification" by Arie Gurfinkel (Software Engineering Institute / Carnegie Mellon University), Temesghen Kahsai (NASA Ames / Carnegie Mellon University), and Jorge Navas (NASA Ames / SGT Inc.). The increasing number of programming languages and intermediate representations poses an obstacle in the development of a unified verification framework. The article presents a case for the use of Constrained Horn Clauses (CHC) as a universal representation for transition systems to overcome this obstacle. This article should be of special interest to the readers of this newsletter as CHCs have been used in various logic-based application domains, but are relatively new to the domain of verification. I would like to thank the authors for submitting the article.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
