scholarly journals UML Automatic Verification Tool with Formal Methods

2005 ◽  
Vol 127 (4) ◽  
pp. 3-16 ◽  
Author(s):  
M. Encarnación Beato ◽  
Manuel Barrio-Solórzano ◽  
Carlos E. Cuesta ◽  
Pablo de la Fuente
Keyword(s):  
Formal Methods ◽  
Automatic Verification ◽  
Verification Tool

Turbine–Generating Unit Model Automatic Verification Tool Design Based On PMU Data

2021 ◽  
Author(s):  
Y.E. Tepikin ◽  
F.N. Gaidamakin ◽  
E.I. Satsuk ◽  
D.M. Dubinin
Keyword(s):  
Tool Design ◽  
Automatic Verification ◽  
Verification Tool ◽  
Unit Model

scholarly journals Optimization of ProVerif programs for AKE-protocols

2021 ◽  
Vol 33 (5) ◽  
pp. 105-116
Author(s):  
Evgenii Maksimovich Vinarskii ◽  
Alexey Vasilyevich Demakov
Keyword(s):  
Formal Verification ◽  
Formal Methods ◽  
Distinctive Feature ◽  
Formal Specification ◽  
Cryptographic Protocols ◽  
Experimental Results ◽  
Automatic Verification ◽  
Cryptographic Protocol ◽  
Encryption Scheme ◽  
Program Model

Cryptographic protocols are used to establish a secure connection between “honest” agents who communicate strictly in accordance with the rules of the protocol. In order to make sure that the designed cryptographic protocol is cryptographically strong, various software tools are usually used. However, an adequate specification of a cryptographic protocol is usually presented as a set of requirements for the sequences of transmitted messages, including the format of such messages. The fulfillment of all these requirements leads to the fact that the formal specification for a real cryptographic protocol becomes cumbersome, as a result of which it is difficult to analyze it by formal methods. One of such rapidly developing tools for formal verification of cryptographic protocols is ProVerif. A distinctive feature of the ProVerif tool is that with large protocols, it often fails to analyze them, i.e. it can neither prove the security of the protocol nor refute it. In such cases, they resort either to the approximation of the problem, or to equivalent transformations of the program model in the ProVerif language, simplifying the ProVerif model. In this article, we propose a way to simplify the ProVerif specifications for AKE protocols using the El Gamal encryption scheme. Namely, we suggest equivalent transformations that allow us to construct a ProVerif specification that simplifies the analysis of the specification for the ProVerif tool. Experimental results for the Needham-Schroeder and Yahalom cryptoprotocols show that such an approach can be promising for automatic verification of real protocols.

scholarly journals On Construction and Verification of PLC-Programs

2015 ◽  
Vol 19 (4) ◽  
pp. 25-36 ◽  
Author(s):  
E. V. Kuzmin ◽  
V. A. Sokolov
Keyword(s):  
Model Checking ◽  
Automatic Verification ◽  
Programmable Logic ◽  
Programmable Logic Controllers ◽  
Program Correctness ◽  
Verification Tool ◽  
Discrete Problems ◽  
Plc Program ◽  
Logic Controllers

We review some methods and approaches to programming discrete problems for Programmable Logic Controllers on the example of constructing PLC-programs for controling a code lock. For these approaches we evaluate the usability of the model checking method for the analysis of program correctness with respect to the automatic verification tool Cadence SMV. Some possible PLC-program vulnerabilities arising at a number approaches to programming of PLC are revealed.

scholarly journals Automatic Verification of Real-Timed Systems Using EPSILON

1994 ◽  
Vol 1 (19) ◽  
Author(s):  
Jens Chr. Godskesen ◽  
Kim G. Larsen ◽  
Arne Skou
Keyword(s):  
Diagnostic Information ◽  
Automatic Verification ◽  
The Novel ◽  
Timed Systems ◽  
Verification Tool

In this paper we report on an application and extension of the theory of <em>Timed Modal Specifications</em> (TMS) and its associated verification tool E<small>PSILON</small>. The novel feature with which E<small>PSILON</small> has been extended is the ability to automatically generate <em> diagnostic information</em> in cases of erroneous refinement steps.

scholarly journals Implementation of Taylor models in CORA 2018

10.29007/zzc7 ◽  
2018 ◽  
Author(s):  
Matthias Althoff ◽  
Dmitry Grebenyuk ◽  
Niklas Kochdumper
Keyword(s):  
Formal Verification ◽  
Formal Methods ◽  
Interval Arithmetic ◽  
Affine Arithmetic ◽  
Advantages And Disadvantages ◽  
Taylor Models ◽  
Verification Tool ◽  
Input Variables ◽  
First Time

Tool Presentation: Computing guaranteed bounds of function outputs when their input variables are bounded by intervals is an essential technique for many formal methods. Due to the importance of bounding function outputs, several techniques have been proposed for this problem, such as interval arithmetic, affine arithmetic, and Taylor models. While all methods provide guaranteed bounds, it is typically unknown to a formal verification tool which approach is best suitable for a given problem. For this reason, we present an implementation of the aforementioned techniques in our MATLAB tool CORA so that advantages and disadvantages of different techniques can be quickly explored without hav- ing to compile code. In this work we present the implementation of Taylor models and affine arithmetic; our interval arithmetic implementation has already been published. We evaluate the performance of our implementation using a set of benchmarks against Flow* and INTLAB. To the best of our knowledge, we have also evaluated for the first time how a combination of interval arithmetic and Taylor models performs: our results indicate that this combination is faster and more accurate than only using Taylor models.

scholarly journals Synthesizing Distinguishing Formulae for Real Time Systems

1994 ◽  
Vol 1 (48) ◽  
Author(s):  
Jens Chr. Godskesen
Keyword(s):  
Real Time ◽  
Diagnostic Information ◽  
Automatic Verification ◽  
Real Time Systems ◽  
Logical Formula ◽  
Verification Tool ◽  
Parallel Networks ◽  
Bisimulation Equivalence ◽  
Time Systems

This paper describes a technique for generating diagnostic information for the <em>timed</em> bisimulation equivalence and the <em>timed</em> simulation preorder. More precisely, given two (parallel) networks of regular real-time processes, the technique will provide a logical formula that differentiates them in case they are not timed (bi)similar. Our method may be seen as an extension of the algorithm by Cerans for deciding timed bisimilarity in that information of time-quantities has been added sufficient for generating distinguishing formulae. The technique has been added to the automatic verification tool E<small>PSILON</small> and applied to various examples.

scholarly journals Model-Checking Real-Time Control Programs. Verifying LEGO Mindstorms Systems Using UPPAAL

1999 ◽  
Vol 6 (53) ◽  
Author(s):  
Torsten K. Iversen ◽  
Kåre J. Kristoffersen ◽  
Kim G. Larsen ◽  
Morten Laursen ◽  
Rune G. Madsen ◽  
...  
Keyword(s):  
Real Time ◽  
Timed Automata ◽  
Scheduling Algorithm ◽  
Automatic Verification ◽  
Real Time Control ◽  
Time System ◽  
Real Time System ◽  
Control Programs ◽  
Time Control ◽  
Verification Tool

In this paper, we present a method for automatic verification<br />of real-time control programs running on LEGO <br />RCX bricks using the verification tool UPPAAL. The control<br />programs, consisting of a number of tasks running concurrently,<br />are automatically translated into the timed automata<br />model of UPPAAL. The fixed scheduling algorithm<br />used by the LEGO RCX processor is modeled in UPPAAL,<br />and supply of similar (sufficient) timed automata<br />models for the environment allows analysis of the overall<br />real-time system using the tools of UPPAAL. To illustrate<br />our techniques we have constructed, modeled and verified<br />a machine for sorting LEGO bricks by color.

Sign in / Sign up

Export Citation Format

Share Document