2000 | OriginalPaper | Chapter
Simplification of Proof Procedures Based on the Path Condition Concepts
Authors : Mireille Larnac, Janine Magnier, Vincent Chapurlat
Published in: Computer Aided Systems Theory - EUROCAST’99
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The formal proof of properties of a system first requires the expression of the behavior of the system into a formal language.The scope of this paper is the simplification of the proof procedure of properties of systems which are represented by discrete time models (Finite State Machines or extensions) The formulas which are manipulated are decomposed and the global proof is reduced to the study of a small subset of elementary proofs. This method was obtained by re-using some work developed in the framework of the management of the Path Condition in Symbolic Simulation.