نتایج جستجو برای: correctness verification

تعداد نتایج: 93307  

2016
Hyggo Oliveira de Almeida Leandro Silva

Validation and verification techniques have been identified as suitable mechanisms to determine if the software meets the needs of the user and to verify if the software works correctly. However, the existing verification techniques do not support friendly visualization. Also, validation techniques with friendly visualization mechanisms do not allow the verification of the system’s correctness....

1995
Vijay Nagasamy Sreeranga Rajan Preeti Ranjan Panda

The complexity of the Fibre Channel protocol poses a challenge to design its implementation “right-the-firsttime”. In this work we have investigated the formal specification and mechanical verification of the Fibre Channel Protocol to address issues of correctness. We present abstract models of the FC-2 layer protocols in SpecCharts and the automated verification of a portion of the fibre chann...

2012
Stefan Mitsch Grant Olney Passmore André Platzer

Hybrid systems with both discrete and continuous dynamics are an important model for real-world physical systems. The key challenge is how to ensure their correct functioning w.r.t. safety requirements. Promising techniques to ensure safety seem to be model-driven engineering to develop hybrid systems in a well-defined and traceable manner and formal verification to prove their correctness, for...

2013
Phillip James Andy Lawrence Faron Moller Markus Roggenbach Monika Seisenberger Anton Setzer Karim Kanso Simon Chadwick

We report on the inclusion of a formal method into a design process in industry. Concretely, we suggest carrying out a verification step in railway interlocking design between programming the interlocking and testing this program. Safety still relies on testing, but the burden of guaranteeing completeness and correctness of the verfication is in this way greatly reduced. We present a complete m...

2006
Alexey Loginov Thomas W. Reps Shmuel Sagiv

In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an acyclic linked list [10]. This paper reports on the automatic verification of the total correctness (partial correctness and termination) of the same list-reversal algorithm, when applied to a possibly-cyclic linked ...

2010
Christoph Baumann Bernhard Beckert Holger Blasum Thorsten Bormer

In the context of the Verisoft XT project functional correctness of the microkernel of PikeOS from SYSGO AG is shown at the source code level using the VCC verification tool, developed by Microsoft Research. In this paper we outline a simulation theorem between a top-level abstract model and the system consisting of the kernel and user programs running in alternation on the real machine. Based ...

2002
Grigoris Antoniou

In this paper we describe a framework for the design of modular knowledge based systems which is motivated by work in algebraic specification and software engineering. The main characteristic of the framework is that verification work can be done in a local setting. We present two concrete module concepts within this framework, and give formal semantics and correctness notions for them. Finally...

Journal: :Information & Software Technology 2014
Carlos A. González Jordi Cabot

Context: Model-driven Engineering (MDE) promotes the utilization of models as primary artifacts in all software engineering activities. Therefore, mechanisms to ensure model correctness become crucial, specially when applying MDE to the development of software, where software is the result of a chain of (semi)automatic model transformations that refine initial abstract models to lower level one...

2005
Andreas Podelski Ina Schaefer Silke Wagner

Procedure summaries are an approximation of the effect of a procedure call. They have been used to prove partial correctness and safety properties. In this paper, we introduce a generalized notion of procedure summaries and present a framework to verify total correctness and liveness properties of a general class of while programs with recursion. We provide a fixpoint system for computing summa...

2014
Alasdair Armstrong Victor B. F. Gomes Georg Struth

We present a reference formalisation of Kleene algebra and demonic refinement algebra with tests in Isabelle/HOL. It provides three different formalisations of tests. Our structured comprehensive libraries for these algebras extend an existing Kleene algebra library. It includes an algebraic account of Hoare logic for partial correctness and several refinement and concurrency control laws in a ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید