A Program Result Checker for the Lexical Analysis of the GNU C Compiler | Zendy

Sabine Glesner | Zendy; Simone Förster | Zendy; Matthias Jäger | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Program Result Checker for the Lexical Analysis of the GNU C Compiler

Author(s) -

Sabine Glesner,

Simone Förster,

Matthias Jäger

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.01.029

Subject(s) - compiler , computer science , hol , programming language , construct (python library) , compiler correctness , automated theorem proving , gas meter prover , compiler construction , mathematics , mathematical proof , geometry

In theory, program result checking has been established as a well-suited method to construct formally correct compiler frontends but it has never proved its practicality for real-life compilers. Such a proof is necessary to establish result checking as the method of choice to implement compilers correctly. We show that the lexical analysis of the GNU C compiler can be formally specified and checked within the theorem prover Isabelle/HOL utilizing program checking. Thereby we demonstrate that formal specification and verification techniques are able to handle real-life compilers

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research