Sciweavers

949 search results - page 139 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
CAV
2004
Springer
96views Hardware» more  CAV 2004»
14 years 2 months ago
Widening Arithmetic Automata
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...
Constantinos Bartzis, Tevfik Bultan
SPIN
2000
Springer
14 years 10 days ago
Logic Verification of ANSI-C Code with SPIN
We describe a tool, called AX, that can be used in combination with the model checker SPIN to efficiently verify logical properties of distributed software systems implemented in A...
Gerard J. Holzmann
DSN
2004
IEEE
14 years 16 days ago
Does Your Result Checker Really Check?
A result checker is a program that checks the output of the computation of the observed program for correctness. Introduced originally by Blum, the result checking paradigm has pr...
Lan Guo, Supratik Mukhopadhyay, Bojan Cukic
ATVA
2006
Springer
140views Hardware» more  ATVA 2006»
14 years 16 days ago
On the Construction of Fine Automata for Safety Properties
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Each safety property can be associated with...
Orna Kupferman, Robby Lampert
ICPR
2008
IEEE
14 years 10 months ago
Learning weighted distances for relevance feedback in image retrieval
We present a new method for relevance feedback in image retrieval and a scheme to learn weighted distances which can be used in combination with different relevance feedback metho...
Enrique Vidal, Hermann Ney, Roberto Paredes, Thoma...