6167 search results - page 943 / 1234 » Can Refinement be Automated |
122
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
We add labels to first-order clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies...
171
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
142
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Fault tolerance mechanisms are a key ingredient of dependable systems. In particular, software-implemented hardware fault tolerance (SIHFT) is gaining in popularity, because of its...
132
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
128
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...