Results 11  20
of
23
Multivalued Possibilities Mappings
 Stepwise Refinement of Distributed Systems, volume LNCS 430
, 1989
"... Abstraction mappings are one of the major tools used to construct correctness proofs for concurrent algorithms. Several examples axe given of situations in which it is useful to allow the abstraction mappings to be multivalued, The examples involve algorithm optimization, algorithm distribution, and ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Abstraction mappings are one of the major tools used to construct correctness proofs for concurrent algorithms. Several examples axe given of situations in which it is useful to allow the abstraction mappings to be multivalued, The examples involve algorithm optimization, algorithm distribution, and proofs of time bounds.
Using Simulation Techniques to Prove Timing Properties
, 1995
"... This thesis presents a methodology based on simulations and invariants for proving timing properties of realtime, distributed systems. This methodology is used to prove tight time bounds for two systems, a leader election protocol for a ring of processes, and Fischer's timingbased mutual excl ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
This thesis presents a methodology based on simulations and invariants for proving timing properties of realtime, distributed systems. This methodology is used to prove tight time bounds for two systems, a leader election protocol for a ring of processes, and Fischer's timingbased mutual exclusion algorithm. A framework for verifying these proofs using the Larch tools is also developed, and the proof for Fischer's algorithm is checked within this framework. Many formal methods have been developed for proving the correctness of untimed distributed systems. However, realtime systems often have subtle timing dependencies that are difficult to analyze and reason about. Furthermore, for many realtime systems, correctness is insufficient; it is important to satisfy certain performance requirements. It is necessary, therefore, to extend the formal models and techniques to the timed setting. We use a timed automaton model, together with simulations which establish that one automaton impl...
Timeconstrained Reactive Automata  A Novel Development Methodology for Embedded Realtime Systems
, 1991
"... ..."
A Stepwise Refinement Heuristic for Protocol Construction
 ACM Transactions on Programming Languages and Systems
, 1992
"... A stepwise refinement heuristic to construct distributed systems is presented The heuristic is based on a conditional refinement relation between system specifications, and a “Marking. ” It is applied to construct four sliding window protocols that provide reliable data transfer over unreliable comm ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
A stepwise refinement heuristic to construct distributed systems is presented The heuristic is based on a conditional refinement relation between system specifications, and a “Marking. ” It is applied to construct four sliding window protocols that provide reliable data transfer over unreliable communication channels. The protocols use moduloN sequence numbers. The first protocol is for channels that can only lose messages in transit. By refining this protocol, we obtain three protocols for channels that can lose, reorder, and duplicate messages in transit. The protocols herein are less restrictive and easier to implement than sliding window protocols previously studied in the protocol verification literature.
Compositional Inductive Verification of Duration Properties of RealTime Systems
 In Proc. of PROCOMET’98
, 1997
"... This paper proposes a method for formal realtime systems development. At high level a system is modelled as a conventional dynamical system with states that are functions of time represented by nonnegative real numbers, while the implementation and refinement at low level are described in terms of ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper proposes a method for formal realtime systems development. At high level a system is modelled as a conventional dynamical system with states that are functions of time represented by nonnegative real numbers, while the implementation and refinement at low level are described in terms of timed transition systems (TTS). Therefore, The system requirements and high level design decisions are time interval properties, and are thus specified and reasoned about in the Duration Calculus (DC), and the properties of the implementation at low level are specified and verified compositionally and inductively in timed linear temporal logic (TLTL). A link from implementation properties to the requirement and design properties is given by interpreting a DC formula in a model of the executions of a TTS and then providing rules for lifting TLTL properties proved for a TTS to DC. The method is illustrated by the Gas Burner case study. Keywords: Realtime Systems, Duration Calculus, Timed Tran...
Formal Methods For The ReEngineering of Computing Systems
 In Proceedings of The 21st IEEE International Conference on Computer Software and Application (COMPSAC'97
, 1997
"... We present a short review of formal methods and their use in the reengineering of computing systems. The paper considers five classes of formal notations and theories, namely state/modelbased, logicbased, algebraicbased, process algebra and netbased formalisms together with combined formalisms ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a short review of formal methods and their use in the reengineering of computing systems. The paper considers five classes of formal notations and theories, namely state/modelbased, logicbased, algebraicbased, process algebra and netbased formalisms together with combined formalisms. Keywords : formal methods, reengineering, wide spectrum language, realtime systems, refinement, reverse engineering, logic. Contents 1 INTRODUCTION 2 2 CLASSIFICATION OF FORMAL METHODS 4 2.1 Modelbased Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Logicbased Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.3 Algebraic Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.4 Process Algebra Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.5 NetBased Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3 CRITERIA AND RESULTS 17 4 DISCUSS...
MBT 2006 Runtime Verification for HighConfidence Systems: A
"... We present a new approach to runtime verification that utilizes classical statistical techniques such as Monte Carlo simulation, hypothesis testing, and confidence interval estimation. Our algorithm, MCM, uses samplingpolicy automata to vary its sampling rate dynamically as a function of the curren ..."
Abstract
 Add to MetaCart
We present a new approach to runtime verification that utilizes classical statistical techniques such as Monte Carlo simulation, hypothesis testing, and confidence interval estimation. Our algorithm, MCM, uses samplingpolicy automata to vary its sampling rate dynamically as a function of the current confidence it has in the correctness of the deployed system. We implemented MCM within the Aristotle tool environment, an extensible, GCCbased architecture for instrumenting C programs for the purpose of runtime monitoring. For a case study involving the dynamic allocation and deallocation of objects in the Linux kernel, our experimental results show that Aristotle reduces the runtime overhead due to monitoring, which is initially high when confidence is low, to levels low enough to be acceptable in the long term as confidence in the monitored system grows. 1