Sommario. Automatic verification deals with the validation by means of computers of correctness certificates. The related tools, usually called proof assistant or interactive provers, provide an interactive environment for the creation of formal certificates whose correctness can be assessed in a purely automatic way. Such systems have applications both in mathematics, where certificates are pr...

A number of industrial software development standards mandate that safety-critical software components be developed using formal methods, including formal verification. While formal development is supported by a number of formal development environments, verification of correctness properties is still a major bottleneck. Most formal development environments provide built-in facilities for disch...

We describe a methodology for the formal verification of the correctness, including IEEE-compliance, of register-transfer level models of floating-point hardware designs, and its application to the floating-point units of a series of commercial microprocessors produced by Advanced Micro Devices, Inc. The methodology is based on a mechanical translator from a synthesizable subset of the Verilog ...

For the validation and verification of quantum circuits mainly techniques based on simulation are applied. Although lots of effort has been put into the improvement of these techniques, ensuring the correctness still requires an exhaustive consideration of all input vectors. As a result, these techniques are particularly insufficient to prove a circuit to be error free. As an alternative, we pr...

A value-passing, asynchronous process calculus and its associated theory of confluence are considered as a basis for establishing the correctness of distributed algorithms. In particular, we present an asynchronous version of value-passing CCS and we develop its theory of confluence. We show techniques for demonstrating confluence of complex processes in a compositional manner and we study prop...

The paper presents the formal definition of workflow process, its semantics and correctness assertion. A partial recognizing algorithm for formal verification of acyclic workflow processes is suggested. The algorithm uses molds that represent upper and lower approximations of environment state sets. The consideration of mold transformations on all branching paths allows to avoid the process exe...

This case study describes the specification and formal verification of the key part of TeCOM, a development tool for the design of open loop programmable control developed at the University of Applied Sciences in Leipzig. TeCOM translates the high-levei representation of an open loop programmable control into a machine executable instruction list. The produced instruction list has to exhibit th...

We argue that runtime verification, in the guise of monitororiented programming, is a natural way how to ensure correctness in dynamically-typed, concurrent languages such as Erlang. Our proposal involves a methodology for marrying correctness runtime checking with the fail-fast approach in Erlang, exploiting the rich failure-handling mechanisms of the language. This allows us to smoothly integ...

A certificate is a mathematical object that establishes the validity of a logical formula and that is self-contained, self-explanatory, and can be checked independently and automatically. Certificates arise naturally in many areas of mathematics, and in many different forms. In particular, certificates are common in the context of program verification, where they are used for automatic checking...

Composition technologies improve reuse in the development of large-scale complex systems. Safety critical systems require intensive validation and verification activities. These activities should be compositional in order to reduce the amount of residual verification activities that must be conducted on the composite in addition to the ones conducted on each components. In order to ensure the c...