Open Access
An Executable Formal Semantics of C with Applications: Technical Report
Chucky Ellison,Grigore Rosu +1 more
TLDR
In this paper, the authors present an executable formal semantics of C. The semantics yields an interpreter, debugger, state space search tool, and model checker, which is shown capable of automatically finding program errors, both statically and at runtime.Abstract:
This paper describes an executable formal semantics of C. Being executable, the semantics has been thoroughly tested against the GCC torture test suite and successfully passes 770 of 776 test programs. It is the most complete and thoroughly tested formal definition of C to date. The semantics yields an interpreter, debugger, state space search tool, and model checker “for free”. The semantics is shown capable of automatically finding program errors, both statically and at runtime. It is also used to enumerate nondeterministic behavior.read more
Citations
More filters
Posted Content
Symbolic Abstract Contract Synthesis in a Rewriting Framework
TL;DR: An automated technique for inferring software contracts from programs that are written in a non-trivial fragment of C, called KernelC, that supports pointer-based structures and heap manipulation and generates logical axioms that define the precise input/output behavior of the C routines.
Journal ArticleDOI
Reducing Total Correctness to Partial Correctness by a Transformation of the Language Semantics
TL;DR: The authors give a language-parametric solution to the problem of total correctness by automatically reducing it to partial correctness, under the assumption that an expression whose value decreases with each program step in a well-founded order is provided.
Posted Content
Operationally-based Program Equivalence Proofs using LCTRSs.
TL;DR: An operationally-based deductive proof method for program equivalence based on encoding the language semantics as logically constrained term rewriting systems (LCTRSs) and the two programs as terms is proposed, which enables the relational verification of program schemas.
Dissertation
Formally verified compilation of low-level C code
TL;DR: In this paper, the CompCert compiler is extended to provide formal guarantees about the compilation of more programs than CompCert does, by making pointer arithmetic and uninitialised data manipulation defined, introducing a notion of symbolic values that capture the meaning of otherwise undefined idioms.
References
More filters
Book
Advanced Compiler Design and Implementation
TL;DR: Advanced Compiler Design and Implementation by Steven Muchnick Preface to Advanced Topics
The C programming language
TL;DR: This ebook is the first authorized digital version of Kernighan and Ritchie's 1988 classic, The C Programming Language (2nd Ed.), and is a "must-have" reference for every serious programmer's digital library.
Book
The C Programming Language
TL;DR: The C Programming Language (2nd Ed.) as discussed by the authors is the first authorized digital version of Kernighan and Ritchie's 1988 classic, The C Programming Languages (1st Ed.).
Journal ArticleDOI
Conditional rewriting logic as a unified model of concurrency
José Meseguer,José Meseguer +1 more
TL;DR: Maude as discussed by the authors is a programming language whose modules are rewriting logic theories, which is defined and given denotational and operational semantics, and it provides a simple unification of concurrent programming with functional and object-oriented programming and supports high level declarative programming of concurrent systems.
Book ChapterDOI
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
TL;DR: The structure of CIL is described, with a focus on how it disambiguates those features of C that were found to be most confusing for program analysis and transformation, allowing a complete project to be viewed as a single compilation unit.