425 search results - page 9 / 85 » The TPS Theorem Proving System |
FLOPS
2008
Springer
14 years 11 months ago
2008
Springer
Bundy and Richardson [7] presented a technique for reasoning about lists using ellipsis (the dots in 1+2+...+10), where a polymorphic function, denoted by 2, is used to encapsulate...
FM
2003
Springer
15 years 2 months ago
2003
Springer
Incomplete, inaccurate, ambiguous, and volatile requirements have plagued the software industry since its inception. The convergence of model-based development and formal methods o...
CADE
2012
Springer
13 years 15 hour ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— This paper examines the stability of quantum feedback networks. We introduce a novel characterization, in terms of equivalence classes of operators, that may be used to...