A Proof Score Approach to Formal Verification of an Imperative Programming Language Compiler

2018 ◽  
pp. 200-217
Author(s):  
Dorian Daudier ◽  
Trinh Ngoc Quoc Bao ◽  
Kazuhiro Ogata
Keyword(s):  
Formal Verification ◽  
Programming Language

Formal Verification of a Subset of UML Diagrams

2011 ◽  
pp. 14-24
Author(s):  
Allaoua Chaoui ◽  
Okba Tibermacine ◽  
Amer R. Zerek
Keyword(s):  
Formal Verification ◽  
Programming Language ◽  
Formal Specification ◽  
State Machine ◽  
Declarative Programming ◽  
Sequence Diagrams ◽  
Uml Diagrams ◽  
Approach Goals ◽  
Formal Specification Language ◽  
State Machine Diagram

We introduce an approach that deals with the verification of UML collaboration and sequence diagrams in respect to the objects internal behaviors which are commonly represented by state machine diagrams. The approach is based on the translation of theses diagrams to Maude specifications. In fact, Maude is a declarative programming language, an executable formal specification language, and also a formal verification system, which permit the achievement of the approach goals. We define in details the rules of translating UML diagrams elements into their corresponding Maude specifications. We present the algebraic structures that represent the OR-States and the AND-states in a state machine diagram, and the structure that represents the collaboration and the sequence diagrams. Also, we explain the mechanism of the execution and the verification of the translated specification, which is based on rewriting logics rules.

Formal Verification of a Subset of UML Diagrams

2012 ◽  
pp. 948-958
Author(s):  
Allaoua Chaoui ◽  
Okba Tibermacine ◽  
Amer R. Zerek
Keyword(s):  
Formal Verification ◽  
Programming Language ◽  
Formal Specification ◽  
State Machine ◽  
Declarative Programming ◽  
Sequence Diagrams ◽  
Uml Diagrams ◽  
Approach Goals ◽  
Formal Specification Language ◽  
State Machine Diagram

We introduce an approach that deals with the verification of UML collaboration and sequence diagrams in respect to the objects internal behaviors which are commonly represented by state machine diagrams. The approach is based on the translation of theses diagrams to Maude specifications. In fact, Maude is a declarative programming language, an executable formal specification language, and also a formal verification system, which permit the achievement of the approach goals. We define in details the rules of translating UML diagrams elements into their corresponding Maude specifications. We present the algebraic structures that represent the OR-States and the AND-states in a state machine diagram, and the structure that represents the collaboration and the sequence diagrams. Also, we explain the mechanism of the execution and the verification of the translated specification, which is based on rewriting logics rules.

scholarly journals PLC Program Translation for Verification Purposes

2017 ◽  
Vol 61 (2) ◽  
pp. 151 ◽  
Author(s):  
Dániel Darvas ◽  
István Majzik ◽  
Enrique Blanco Viñuela
Keyword(s):  
Model Checking ◽  
Formal Verification ◽  
Programming Languages ◽  
Programming Language ◽  
Translation Method ◽  
Programmable Logic ◽  
Program Unit ◽  
Verification Methods ◽  
Plc Program ◽  
Safety Plc

Programmable logic controllers are typically programmed in one of the five languages defined in the IEC 61131 standard. While the ability to choose the appropriate language for each program unit may be an advantage for the developers, it poses a serious challenge to verification methods. In this paper we analyse and compare these languages to show that the ST programming language can efficiently and conveniently represent all PLC languages for formal verification purposes. Furthermore, we provide a translation method from IL to ST programming languages (for the Siemens implementation), together with a sketch of proof for its correctness. This allows the usage of the ST-based PLCverif model checking method for safety PLC programs.

SEMANTICS OF QUANTUM PROGRAMMING LANGUAGE LANQ

2008 ◽  
Vol 06 (supp01) ◽  
pp. 733-738 ◽  
Author(s):  
HYNEK MLNAŘÍK
Keyword(s):  
Formal Verification ◽  
Programming Language ◽  
Operational Semantics ◽  
Memory Model ◽  
Language Abilities ◽  
Quantum Programming

We show a memory model of an imperative concurrent quantum programming language LanQ. The memory model is used to specify the shape of semantical structure upon which the language operational semantics is defined. We also outline the language abilities in the area of formal verification on an example implementation of teleportation protocol.

scholarly journals Formal Verification of Programs in Functional Dataflow Parallel Language

2015 ◽  
Vol 19 (5) ◽  
pp. 81-99
Author(s):  
M. S. Kropacheva ◽  
A. I. Legalov
Keyword(s):  
Formal Verification ◽  
Parallel Programming ◽  
Programming Language ◽  
Functional Data ◽  
Data Flow ◽  
Formal System ◽  
Axiomatic Approach ◽  
Parallel Programs ◽  
Parallel Language ◽  
Parallel Programming Language

The article is devoted to the methods of proving parallel programs correctness that are based on the axiomatic approach. Formal system for functional data-flow parallel programming language Pifagor is described. On the basis of this system programs correctness could be proved.

Programming Language for Severely Retarded Children

1978 ◽  
Vol 9 (4) ◽  
pp. 213-219
Author(s):  
Carol McCall Davis
Keyword(s):  
Programming Language ◽  
Mentally Retarded ◽  
Mentally Retarded Children

This article describes methods of language programming for profoundly mentally retarded children that are based on linguistic principles. Examples of program contents are drawn from research reports and include cuing procedures, as well as progress from receptive through imitative behaviors, labeling responses, and grammatical sequencing.

Sign in / Sign up

Export Citation Format

Share Document