We investigate the verification problem of infinite-state process w.r.t. logic-based specifications that express properties which may be nonregular. We consider the process algebra PA which integrates and strictly subsumes the algebras BPA (basic process ...

Bugs in multi-threaded programs often arise due to data races. Numerous static and dynamic program analysis techniques have been proposed to detect data races. We propose a novel randomized dynamic analysis technique that utilizes potential data race ...

This tutorial considers the structure and construction of reliable software. By way of introduction, several of the structured programming and software engineering techniques are classified into three groups; those which impact primarily on the program ...

One way to improve the reliability of reactive systems is to use formal development methods. Although powerful techniques exist for verifying specifications, a remaining problem is to show that an implementation satisfies its specification.In this paper ...

In this paper we introduce a new framework for controlling compliance to discretionary access control policies [Cederquist et al. in Proceedings of the International Workshop on Policies for Distributed Systems and Networks (POLICY), 2005; Corin ...

This paper deals with the evaluation of the reliability of a dynamic hierarchical system. Reliability of the system is calculated precisely by incorporating modular imperfect coverage model for both static and dynamic subsystems. Modular imperfect coverage ...

This poster paper addresses the fitness calculation problem fornested if-else constructs. A new term "optimism level" is incorporated into the fitness function to assess the branch distance of nested branches for a given test data.

This paper puts forward a new approach for the specificationand verification of finite state systems. The designof a system is first specified in UML statechart diagrams,then formalized in the ¿-calculus and finally verified automaticallyby NuSMV. We ...

Process algebras are convenient formalisms to develop specifications stepwise. This can be done with the help of partially defined states in a specification. When refining the specification, new transitions are added to partially defined states. At every ...

Today's software systems tend more and more to comprise a multitude of different, often interfering functionalities. Especially in the case of embedded systems with their high requirements on safety this imposes additional risks for unwanted system behavior. ...

Specification-based verification is increasingly beingused when designing systems. In verification, the programunder test is executed repeatedly and the obtained outputsand/or other parameters are compared against the expectedvalues. This ensures that ...

As part of our research for the Carnegie-Mellon University Design Automation System, we have been investigating methods for proving that the system produces correct designs from correct specifications. This paper presents a mathematical model of the ...

The goal of this work is to improve the testing of programs that contain loops and complex methods. We achieve this goal with verification-based testing, which is a technique that can generate test cases not only from source code but also from loop invariants ...