265 search results - page 25 / 53 » How to Prove Inductive Theorems |
ICCS
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we show how symbolic algebra in Mathematica can be used to formally verify analog and mixed signal designs. The verification methodology is based on combining induct...
FBT
2000
13 years 9 months ago
2000
The behavior of reactive systems can be described by their black box properties as a relation between input and output streams. More operational is the behavior's description...
MLQ
2007
13 years 7 months ago
2007
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...
TCS
2010
13 years 6 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
MICAI
2000
Springer
13 years 11 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...