No abstract

Abstract

Multi-formalism specifications are essential for the modelling of complex systems including different aspects such as data or concurrency. We advocate a formalism which combines the CCS process algebra with the CASL algebraic specification language. Formal foundations of this combination are presented following two steps, the syntax and the semantics. Our proposal is illustrated with a real size case study: an access control system to a set of buildings. With this concrete example, we aim at showing how our formalism proposal could be used to specify a comprehensive application.

No abstract

In this paper we introduce a verification methodology well adapted to circuits where the specifications are described in terms of characteristic properties instead of algorithmic procedures. This method avoids most of the interpretation mistakes which could invalidate the proof process. In order to describe implementations, we present a formalism, based on sequences, which is close to HDLs. Then these description and proof methodologies are implemented in the Larch Prover which is adequate for this kind of verifications. This work is illustrated by the verification of the correctness of the nontrivial Minmax circuit.