Verification-Oriented Language C-Light and Its Structural Operational Semantics

Nepomniaschy, V. A.; Anureev, Igor S.; Promsky, Alexey

doi:10.1007/978-3-540-39866-0_12

Cited by 7 publications

(11 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We plan to unify the previously developed various kinds of operational [24,27] and axiomatic [6,18,19,20,23,25,28] semantics on the basis of operational semantics specic transition systems and safety logic specic transition systems, respectively, and to integrate them into the multilingual system of program analysis and verication Spectrum [9,21]. Program specic transition systems will be used in a new denition of the domain-specic language Atoment [10,16] on which the system Spectrum is based, and in the knowledge portal on computer languages [1,17] for formal specication of these languages.…”

Section: Resultsmentioning

confidence: 99%

Program Specific Transition Systems

Anureev¹

2012

bncc.cs

View full text Add to dashboard Cite

Abstract. A new kind of labeled transition systems, program specic transition systems, is proposed. These systems are used to formalize and unify some aspects of program handling. Such aspects as the development of program operational semantics and proof of safety properties of programs are considered, and the appropriate classes of program specic transition systems are dened. Ontological transition systems and operational ontological semantics are dened in terms of program specic transition systems.

show abstract

Section: Resultsmentioning

confidence: 99%

Program Specific Transition Systems

Anureev¹

2012

bncc.cs

View full text Add to dashboard Cite

show abstract

“…В этой статье мы рассматриваем язык C-light, который является выразительным подмножеством языка C, соответ-ствующего стандарту ISO. Для верификации C-light программ нами были предложены двухуров-невый подход [19,20] и метод смешанной аксиоматической семантики [1,3,11]. На первой стадии этого подхода исходная C-light программа транслируется [17] в программу на языке C-kernel [19], который является подмножеством языка C-light.…”

Section: Doi: 1018255/1818-1015-2015-6-773-782unclassified

“…To verify C-light programs the two-level approach [19,20] and the mixed axiomatic semantics method [1,11] were suggested.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Loop Invariants Elimination for Definite Iterations over Unchangeable Data Structures in C Programs

Марьясов¹,

Непомнящий²

2016

Model. anal. inf. sist.

View full text Add to dashboard Cite

The C-program verification is an urgent problem of modern programming. To apply known methods of deductive verification it is necessary to provide loop invariants which might be a challenge in many cases. In this paper we consider the C-light language [18] which is a powerful subset of the ISO C language. To verify C-light programs the two-level approach [19,20] and the mixed axiomatic semantics method [1,3,11] were suggested. At the first stage, we translate [17] the source C-light program into Ckernel one. The C-kernel language [19] is a subset of C-light. The theorem of translation correctness was proved in [10,11]. The C-kernel has less statements with respect to the C-light, this allows to decrease the number of inference rules of axiomatic semantics during its development. At the second stage of this approach, the verification conditions are generated by applying the rules of mixed axiomatic semantics [10, 11] which could contain several rules for the same program statement. In such cases the inference rules are applied depending on the context. Let us note that application of the mixed axiomatic semantics allows to significantly simplify verification conditions in many cases. This article represents an extension of this approach which includes our verification method for definite iteration over unchangeable data structures without loop exit in C-light programs. The method contains a new inference rule for the deifinite iteration without invariants. This rule was implemented in verification conditions generator. At the proof stage the SMT-solver Z3 [12] is used. An example which illustrates the application of this technique is considered.The article is published in the authors' wording.

show abstract

“…Papaspyrou [11] addresses non-determinism as well, but using denotational semantics with monads. Abstract state machines have been used to give on-paper semantics for C [4,9] and more recently for C# [3].…”

Section: Related Workmentioning

confidence: 99%

Formal Verification of a C Compiler Front-End

Blazy

Dargaye

Leroy

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents the formal verification of a compiler front-end that translates a subset of the C language into the Cminor intermediate language. The semantics of the source and target languages as well as the translation between them have been written in the specification language of the Coq proof assistant. The proof of observational semantic equivalence between the source and generated code has been machine-checked using Coq. An executable compiler was obtained by automatic extraction of executable Caml code from the Coq specification of the translator, combined with a certified compiler back-end generating PowerPC assembly code from Cminor, described in previous work.

show abstract

Verification-Oriented Language C-Light and Its Structural Operational Semantics

Cited by 7 publications

References 3 publications

Program Specific Transition Systems

Program Specific Transition Systems

Loop Invariants Elimination for Definite Iterations over Unchangeable Data Structures in C Programs

Formal Verification of a C Compiler Front-End

Contact Info

Product

Resources

About