Results 1 - 10 of 2,669

Refining middleware functions for verification purpose

by Jérôme Hugues, Laurent Pautet, École Nationale Supérieure, Des Télécommunications, Fabrice Kordon - in Proc. of the Monterey Workshop on Software Engineering for Embedded Systems: From Requirements to Implementation , 2003
"... The development of real-time, dependable or scalable distributed applications requires specific middleware that enables the formal verification of domain-specific properties. So far, typical middleware implementations do not directly address these issues. They focus on patterns and frameworks to mee ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
The development of real-time, dependable or scalable distributed applications requires specific middleware that enables the formal verification of domain-specific properties. So far, typical middleware implementations do not directly address these issues. They focus on patterns and frameworks

The algorithmic analysis of hybrid systems

by R. Alur, C. Courcoubetis, N. Halbwachs , T. A. Henzinger, P.-H. Ho, X. Nicollin , A. Olivero , J. Sifakis , S. Yovine - THEORETICAL COMPUTER SCIENCE , 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract - Cited by 778 (71 self) - Add to MetaCart
to dynamical laws. For verification purposes, we restrict ourselves to linear hybrid systems, where all variables follow piecewise-linear trajectories. We provide decidability and undecidability results for classes of linear hybrid systems, and we show that standard program-analysis techniques can be adapted

Symbolic Model Checking for Real-time Systems

by Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, Sergio Yovine - INFORMATION AND COMPUTATION , 1992
"... We describe finite-state programs over real-numbered time in a guarded-command language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in an ..."
Abstract - Cited by 578 (50 self) - Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a -calculus on computation trees over real-numbered time. Unfortunately

A NEW PLANT MODELLING APPROACH FOR FORMAL VERIFICATION PURPOSES

by unknown authors
"... Abstract: This paper presents a new approach in plant modeling for the formal verification of real time systems. A system composed by two tanks is used, where all its components are modeled by simple modules and all the interdependences of the system’s modular models are presented. As innovating par ..."
Abstract - Add to MetaCart
parameters in the plant modeling, having as purpose its use on formal verification tasks, the plant is modeled using Dymola software and Modelica programming language. The results obtained in simulation are used to define the plant models that are used for the formal verification tasks, using the model

Building Meaningful Timed Models of Closed-loop DES for Verification Purposes

by Matthieu Perina, Jean-marc Faurea
"... Formal verification methods require that a model of the system to analyze, in the form of a network of automata for instance, be built previously. Every evolution of this formal model must represent a real evolution of the modeled system; if the model contains indeed spurious evolutions, meaningless ..."
Abstract - Add to MetaCart
Formal verification methods require that a model of the system to analyze, in the form of a network of automata for instance, be built previously. Every evolution of this formal model must represent a real evolution of the modeled system; if the model contains indeed spurious evolutions

seL4: Formal Verification of an OS Kernel

by Gerwin Klein, Kevin Elphinstone, Gernot Heiser, June Andronick, David Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt, Rafal Kolanski, Michael Norrish, Thomas Sewell, Harvey Tuch, Simon Winwood - ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES , 2009
"... Complete formal verification is the only known way to guarantee that a system is free of programming errors. We present our experience in performing the formal, machine-checked verification of the seL4 microkernel from an abstract specification down to its C implementation. We assume correctness of ..."
Abstract - Cited by 297 (47 self) - Add to MetaCart
Complete formal verification is the only known way to guarantee that a system is free of programming errors. We present our experience in performing the formal, machine-checked verification of the seL4 microkernel from an abstract specification down to its C implementation. We assume correctness

Moscow: Russian Federation (2009)" Building Meaningful Timed Plant Models for Verification Purposes

by Matthieu Perin, Jean-marc Faure, Dassault Systemes, Delmia R, D Services , 2009
"... This paper presents a method to build a formal model of a plant, in the form of a network of timed automata, to be used for model-based verification of controllers. To ensure re-usability, this model is built by instantiation of generic components models. When the instantiated components models are ..."
Abstract - Add to MetaCart
This paper presents a method to build a formal model of a plant, in the form of a network of timed automata, to be used for model-based verification of controllers. To ensure re-usability, this model is built by instantiation of generic components models. When the instantiated components models

Unis d'Amérique (2006)" A generic approach to build plant models for DES verification purposes

by J. Machado, B. Denis, J. -j. Lesage , 2009
"... Abstract—The modeling of plant behavior is often essential in the design, performance analysis or diagnosis of Discrete Event Systems (DES). Yet this task remains a difficult one for which little research has been devoted. In this paper, we propose a technique for building behavioral models specific ..."
Abstract - Add to MetaCart
specific to large-scale plants, in order to perform a formal verification of the controller by means of "model-checking". In this aim, we have opted to use a modular approach with an appropriate class of automata. To obtain the overall plant model, parallel evolutions of the elementary automata

PURPOSE

by unknown authors , 2012
"... To determine the type of income verification that is required at the time of application for subsidized housing. ..."
Abstract - Add to MetaCart
To determine the type of income verification that is required at the time of application for subsidized housing.

Proceedings of the Federated Conference on Computer Science and Information Systems pp. 849–854 ISBN 978-83-60810-22-4 Automated Conversion of ST Control Programs to Why for Verification Purposes

by unknown authors
"... Abstract—The paper presents a prototype tool ST2Why, which converts a Behavioral Interface Specification Language for ST language from IEC 61131-3 standard to Why code. The specification annotations are stored as special comments, which are close to implementation and readable by the programmer. Fur ..."
Abstract - Add to MetaCart
. Further transformation with Why tool into verification lemmas, confirms compliance between specification and implementation. Proving lemmas is performed in Coq, but other provers can be used as well. I.
Results 1 - 10 of 2,669