static verification and software testing are not able to verify software single-handedly. therefore, another approach called run-time verification dealing with verifying software behavior against constraints at run-time received attention. however, the run-time verification faces the problem of verification of run-time activities against the constraints are specified in high-level and abstractl...

A complete set of rules is presented for timing verification of domino-style dynamic circuits. These rules include identification of dynamic nodes, generation of accurate timing constraints based on the operating environment of the gate and verification as an enhanced part of a complete timing verification process. This methodology has been implemented in a new static timing verifier and used t...

A common inadequacy of current knowledge-based systems is that they cannot reason about those situations and/or problems that have not been considered by their developers. A major cause of this inadequacy is that the system cannot automatically generate new and valid reasoning rules from those existing rules and facts that are programmed or inputted in the systems by their developers or users. ...

We present an example for application of Constraint Handling Rules to automated test data generation and model checking in verification of mission critical software for satellite control.

We review a number of formal verification techniques supported by STeP, the Stanford Temporal Prover, describing how the tool can be used to verify properties of several versions of the Bakery algorithm for mutual exclusion. We verify the classic two-process algorithm and simple variants, as well as an atomic parameterized version. The methods used include deductive verification rules, verifica...

The automatic algorithm programming model can increase the dependability and efficiency of program development, including specification generation, refinement, formal verification. However, existing has two flaws: incompleteness refinement inadequate automation This paper proposes an based on improved Morgan's calculus. It extends calculus rules designs C++ generation system for realizing compl...

This paper shows how to use Girard’s intuitionistic linear logic extended with arithmetic or other constraints to reason about pointer programs. More specifically, first, the paper defines the proof theory for ILC (Intuitionistic Linear logic with Constraints) and shows it is consistent via a proof of cut elimination. Second, inspired by prior work of O’Hearn, Reynolds and Yang, the paper expla...

Geometrical specification is the bridge to link function, design, manufacture and verification together for a product. The next-generation GPS utilizes duality principle to combine specification and verification of a geometrical product tightly, and to ensure its desired intention (functional requirements). This makes the geometrical specification of a product complete and unambiguous, to reduc...

A verification strategy implementing precondition generation is presented. It automatically constructs a weak precondition for the statements of a Java subset. The strategy uses the rules of an underlying Hoare logic.