1894 search results - page 128 / 379 » A TLA Proof System |
112
click to vote
HICSS
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper provides a bound on the number of numeric operations (fixed or floating point) that can safely be performed before accuracy is lost. This work has important implic...
114
click to vote
VMCAI
2004
Springer
15 years 9 months ago
2004
Springer
The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based...
105
click to vote
AIIA
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
113
click to vote
IANDC
2008
15 years 3 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
155
click to vote
HYBRID
1998
Springer
15 years 8 months ago
1998
Springer
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....