interest in applying model checking to software. For infinite-state systems like software, abstraction is even more critical. Techniques for abstracting software are a prerequisite to making software model checking a reality. We present the first algorithm to automatically construct a predicate abstraction

Modern vehicles are increasingly equipped with more sensors which are connected to control units through cables for transmitting crucial real-time sensing data. To reduce the complexity and cost brought to the automotive design and production by the sensor wiring harness, replacing cables with wireless links has been proposed in [1].With its fine capability of solving multipath fading and interference resilience, as well as its freely available spectrum, the ultra-wideband (UWB) technology is considered as a highly promising candidate for such intra-vehicle wireless network. For the purpose of evaluating UWB based sensor network, compared with wired system, from the aspects of performance and reliability in transmitting automotive sensing data, an UWB communication testbed is needed. In this paper we present our first attempt in building an intra-vehicle UWB wireless sensor network to transmit automotive speed data from four wheel speed sensors to the electronic control unit (ECU) 1. Assembly of the testbed consists of ABS motor control simulating system, wheel speed sensors, UWB transmitting nodes and the UWB network coordinator interfacing with ECU. The paper also includes the description of the main testbed software modules and the report of initial measurement result. Future measurement plan and further work needed to improve the testbed are discussed in the conclusion section. 1

Abstract not found

The result is encouraging as it is able to process cache coherence protocols such as Germanand FLASH.

This reports some experiences with a recently-implemented prototype system for verification using predicate abstraction, based on the method of Graf and Saidi [9]. Systems are described using a language of iterated guarded commands, called MurOE \Gamma\Gamma (since it is a simplified version

Predicate abstraction is a popular abstraction technique employed in formal software verification. A crucial requirement to make predicate abstraction effective is to use as few predicates as possible, since the abstraction process is in the worst case exponential (in both time and memory

Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems using a combination of a decision procedure for a subset of first-order logic and symbolic methods originally developed for finite-state model checking. We consider models containing first-order state

Abstract. Predicate abstraction is a popular abstraction technique employed in formal software verification. A crucial requirement to make predicate abstraction effective is to use as few predicates as possible, since the abstraction process is in the worst case exponential (in both time and memory

Abstract. Predicate abstraction is a popular abstraction technique employed in formal software verification. A crucial requirement to make predicate abstraction effective is to use as few predicates as possible, since the abstraction process is in the worst case exponential (in both time and memory

Predicate abstraction and canonical abstraction are two finitary abstractions used to prove properties of programs. We study the relationship between these two abstractions by considering a very limited case: abstraction of (potentially cyclic) singly-linked lists.