Results 1  10
of
28
unknown title
, 2009
"... Zapiski predavanj 4 interno gradivo za predmet VSO, 2008/09 A. Praktični nasveti za administracijo operacijskega sistema MS Windows Vista V tem delu predavanj bomo pregledali knjigo William R. Stanek: Microsoft Windows Vista ..."
Abstract
 Add to MetaCart
Zapiski predavanj 4 interno gradivo za predmet VSO, 2008/09 A. Praktični nasveti za administracijo operacijskega sistema MS Windows Vista V tem delu predavanj bomo pregledali knjigo William R. Stanek: Microsoft Windows Vista
Witness and counterexample automata for ACTL
 In Formal Techniques for Networked and Distributed Systems
, 2004
"... Abstract. Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path along the model of the system. However, a single computation path is not enough to explain all reasons of a va ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path along the model of the system. However, a single computation path is not enough to explain all reasons of a validity or a failure. Our work in this area is motivated by the application of actionbased model checking algorithms to the test case generation for models formally specified with a CCSlike process algebra. There, only linear and finite witnesses and counterexamples are useful and for the given formula and model an efficient representation of the set of witnesses (counterexamples) explaining all reasons of validity (failure) is needed. This paper identifies a fragment of action computation tree logic (ACTL) that can be handled in this way. Moreover, a suitable form of witnesses and counterexamples is proposed and witness and counterexample automata are introduced, which are finite automata recognizing them. An algorithm for generating such automata is given. 1
The Efficient Symbolic Tools Package
 In Proceedings of the SoftCOM 2000, volume I
, 2000
"... Abstract: Efficient Symbolic Tools (EST) is a software package for formal verification of concurrent systems. It appears as an educational project and has been entirely written in the Laboratory of Microcomputer Systems at the Faculty of Electrical Engineering and Computer Science in Maribor. The ma ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract: Efficient Symbolic Tools (EST) is a software package for formal verification of concurrent systems. It appears as an educational project and has been entirely written in the Laboratory of Microcomputer Systems at the Faculty of Electrical Engineering and Computer Science in Maribor. The main purpose of our work was a study of algorithms that could serve for formal verification of complex protocols, which are used in computer and telecommunication networks.
Notes on specifying systems in EST
"... EST is a tool for formal verification of systems. A system to be verified should be specified in a CCSlike syntax. CCS has been chosen because it is widely used in theoretical approaches due to a relatively small set of operators and nice laws valid for them. In this paper we make an overview of op ..."
Abstract
 Add to MetaCart
EST is a tool for formal verification of systems. A system to be verified should be specified in a CCSlike syntax. CCS has been chosen because it is widely used in theoretical approaches due to a relatively small set of operators and nice laws valid for them. In this paper we make an overview of operators supported by EST. They can be classified into two groups: standard CCS operators and additional operators which we introduced to shorten specifications and to facilitate traslations from other formalisms. 1
Model Checking: A Formal Method for Safety Assurance of Logistic Systems
, 2000
"... Model checking is a formal method widely used in computer science for verification of concurrent systems, e.g. communication protocols. The method requires that a system is given with a graph and properties of the system are given as a set of logic formulas. Model checking is an algorithmic method a ..."
Abstract
 Add to MetaCart
Model checking is a formal method widely used in computer science for verification of concurrent systems, e.g. communication protocols. The method requires that a system is given with a graph and properties of the system are given as a set of logic formulas. Model checking is an algorithmic method and it can be carried out fully automatically by fixpoint calculation. This paper describes how to use model checking for safety assurance of logistic systems. 1 Introduction Safety assurance of logistic systems is a multilayer problem. In general, it can be partitioned into two parts: ffl the design of traffic networks that enable safe traffic flow realisation and ffl the care of all subjects involved in the traffic. Although the behaviour of traffic participants is somehow standardised by traffic rules, it is not always predictable in praxis. Therefore, particular attention is paid to the design of traffic networks, which have to prevent all participants from dangerous situations. With ...
Demonstration of Sorting Algorithms on Mobile Platforms
"... This paper presents a systematic approach to the implementation of a mobile framework for demonstrating of sorting algorithms. Wellknown corresponding projects are listed. The pseudocode form is discussed, together with the graphical presentation of actions. A set of atomic operations that reveal ..."
Abstract
 Add to MetaCart
This paper presents a systematic approach to the implementation of a mobile framework for demonstrating of sorting algorithms. Wellknown corresponding projects are listed. The pseudocode form is discussed, together with the graphical presentation of actions. A set of atomic operations that reveal the concept of sorting algorithms has been identified. Implementations of Gnome Sort, Insertion Sort, and Quicksort are given as a portable Cstyle code. The presented code has been tested within a prototype application on a modern smartphone. The project was oriented towards the usage in mobile learning systems. 1
Exploring Properties of a Bounded Retransmission Protocol with VIS
 Journal of Computing and Information Technology CIT
, 1999
"... title = "Exploring properties of a bounded retransmission protocol with VIS", ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
title = "Exploring properties of a bounded retransmission protocol with VIS",
CTL and ACTL patterns
, 2001
"... Model checking has become a widely used technique for verification of concurrent systems. However, its use is still much restricted to scientists with high mathematical education because temporal logic formulae are difficult to understand and even more difficult to create. Therefore, many projects h ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Model checking has become a widely used technique for verification of concurrent systems. However, its use is still much restricted to scientists with high mathematical education because temporal logic formulae are difficult to understand and even more difficult to create. Therefore, many projects have been started to find out how computers can help engineers in specifying system properties. This paper reports on using patterns of temporal logic formulae, which facilitate the usage of model checking.
Verification of mutual exclusion algorithms with est
 in Proceedings of the Tenth Electrotechnical and Computer Science Conference ERK’2001 Portoroˇz
, 2001
"... Mutual exclusion algorithms are a simple and popular example of concurrent systems. We report about the verification of some of them with verification package EST. In the paper we propose modified models for Dekker’s and Peterson’s algorithm which give a compound system without divergent states. For ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Mutual exclusion algorithms are a simple and popular example of concurrent systems. We report about the verification of some of them with verification package EST. In the paper we propose modified models for Dekker’s and Peterson’s algorithm which give a compound system without divergent states. For Hyman’s algorithm, we explain why it does not preserve mutual exclusion. 1
Results 1  10
of
28