A lot of logical theories were used in order to prove that
a software or a hardware system satisfies predefined safety properties.
Strangely the linear programming theory was left beside and never considered
as a theory to make formal proof. Even so it appears that linear programming,
by the way of the duality theorem, is a logical theory with nice completeness
properties. Moreover proving with linear programming uses well-known efficient
polynomial time algorithms.
In this talk we will show how the behavior of a software/hardware
system can be modeled with linear programming and we will show that the
duality theorem gives an inference engine that is both powerful and algorithmically
Last modified: Fri Apr 21 17:21:06
MET DST 2000