425 search results - page 33 / 85 » The TPS Theorem Proving System |
ICSE
2003
IEEE-ACM
16 years 2 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
133
click to vote
ICFP
2003
ACM
16 years 1 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
119
Voted
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
100
click to vote
LPAR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
162
Voted
FBT
2000
15 years 3 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...