Abstract
The deductive verification of computer programs helps ascertain the absence of errors for all possible inputs and executions. Computer programs can be written in a plethora of languages. The identification of mechanisms for reasoning about the common features of different languages gives rise to language-independent program verification techniques. Existing language-independent verification techniques either work with small-step operational semantics or require the definition of a special-purpose logic. In addition, these techniques have only been demonstrated in verification tasks where the code of the target program is completely known. We present a language-independent verification technique that works with big-step operational semantics and a general-purpose logic. We illustrate the technique by verifying programs in languages of different paradigms. We use the technique to develop a method for verifying blockchain smart contracts that could call into unknown code and be reentered from the callee. All the theoretical results and verification examples are formalized in the Coq proof assistant.
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.
