197 research outputs found
Functional programming languages for verification tools: experiences with ML and Haskell
We compare Haskell with ML as programming languages for verification tools, based on our experience developing TRUTH in Haskell and the Edinburgh Concurrency Workbench (CWB) in ML. We discuss not only technical language features but also the "worlds" of the languages, for example, the availability of tools and libraries
Ordered Navigation on Multi-attributed Data Words
We study temporal logics and automata on multi-attributed data words.
Recently, BD-LTL was introduced as a temporal logic on data words extending LTL
by navigation along positions of single data values. As allowing for navigation
wrt. tuples of data values renders the logic undecidable, we introduce ND-LTL,
an extension of BD-LTL by a restricted form of tuple-navigation. While complete
ND-LTL is still undecidable, the two natural fragments allowing for either
future or past navigation along data values are shown to be Ackermann-hard, yet
decidability is obtained by reduction to nested multi-counter systems. To this
end, we introduce and study nested variants of data automata as an intermediate
model simplifying the constructions. To complement these results we show that
imposing the same restrictions on BD-LTL yields two 2ExpSpace-complete
fragments while satisfiability for the full logic is known to be as hard as
reachability in Petri nets
OR.NET - Approaches for Risk Analysis and Measures of Dynamically Interconnected Medical Devices
Nowadays, it lacks an open, standardized and dynamic interconnection of medical devices. All existing combinations of medical devices consist of isolated solutions with proprietary interfaces, as no common standards for networking and the exchange of data of medical devices exist. This situation leads to confusing operating rooms and inefficient operations. Thus, new strategies need to be developed for the authorization of dynamically interconnected medical devices. Primarily, those concern of an acquisition and methodical adaption of new requirements and risks resulting from this way of interconnection.
The approach is to develop a method for a risk analysis for interconnected medical devices, which is structured modular and consists of a risk assessment of the standalone device and a risk analysis for the interconnection considering the risks involved in the transfer of functions. When interconnecting the medical devices the risk analysis of each of the devices is taken and they are compared by a gap analysis. Through this strategy it will be possible to realize a standard-compliant dynamic interconnection of medical products, which would be advantageous both for clinic operators and producers. This paper presents the current situation of the authorization of combined medical devices and proposes a strategy for the risk management of dynamically interconnected medical devices as a substantial part of the authorization
Symbolic Runtime Verification for Monitoring under Uncertainties and Assumptions
Runtime Verification deals with the question of whether a run of a system
adheres to its specification.
This paper studies runtime verification in the presence of partial knowledge
about the observed run, particularly where input values may not be precise or
may not be observed at all.
We also allow declaring assumptions on the execution which permits to obtain
more precise verdicts also under imprecise inputs.
To this end, we show how to understand a given correctness property as a
symbolic formula and explain that monitoring boils down to solving this formula
iteratively, whenever more and more observations of the run are given.
We base our framework on stream runtime verification, which allows to express
temporal correctness properties not only in the Boolean but also in richer
logical theories.
While in general our approach requires to consider larger and larger sets of
formulas, we identify domains (including Booleans and Linear Algebra) for which
pruning strategies exist, which allows to monitor with constant memory (i.e.
independent of the length of the observation) while preserving the same
inference power as the monitor that remembers all observations.
We empirically exhibit the power of our technique using a prototype
implementation under two important cases studies: software for testing car
emissions and heart-rate monitoring
Sliding between model checking and runtime verification
Abstract. We present a unified semantics for linear temporal logic capturing model checking and runtime verification. Moreover, we present the main ingredients of a corresponding monitor synthesis procedure
08332 Executive Summary -- Distributed Verification and Grid Computing
The Dagstuhl Seminar on Distributed Verification and Grid
Computing took place from 10.08.2008 to 14.08.2008 and brought
together two groups of researchers to discuss their recent work and
recent trends related to parallel verification of large scale computer
systems on large scale grids. In total, 29 experts from 12 countries
attended the seminar
- ā¦