290 search results - page 16 / 58 » Theorem Proving Using Lazy Proof Explication |
LPAR
2010
Springer
14 years 8 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
HICSS
1994
IEEE
15 years 1 months ago
1994
IEEE
1 This paper presents a methodology to guide equational reasoning in a goal directed way. Suggested by rippling methods developed in the eld of inductive theorem proving we use att...
AAECC
1997
Springer
15 years 1 months ago
1997
Springer
Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is...
ENTCS
2008
14 years 9 months ago
2008
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
JFP
2000
14 years 9 months ago
2000
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...