Sciweavers

1219 search results - page 143 / 244
» Verification of Equivalent-Results Methods
Sort
View
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 10 months ago
A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction
nd Counterexample-Based Abstraction Niklas Een, Alan Mishchenko EECS Department, University of California Berkeley, USA. Nina Amla Cadence Research Laboratroy Berkeley, USA. This p...
Niklas Eén, Alan Mishchenko, Nina Amla
ENTCS
2008
73views more  ENTCS 2008»
13 years 10 months ago
Invariants for Non-Hierarchical Object Structures
We present a Hoare-style specification and verification approach for invariants in sequential OO programs. It allows invariants over nonhierarchical object structures, in which upd...
Ronald Middelkoop, Cornelis Huizing, Ruurd Kuiper,...
IJCV
2000
109views more  IJCV 2000»
13 years 10 months ago
Fast Lighting Independent Background Subtraction
This paper describes a simple method of fast background subtraction based upon disparity verification that is invariant to arbitrarily rapid run-time changes in illumination. Using...
Yuri A. Ivanov, Aaron F. Bobick, John Liu
CCS
2010
ACM
13 years 8 months ago
Developing security protocols by refinement
We propose a development method for security protocols based on stepwise refinement. Our refinement strategy guides sformation of abstract security goals into protocols that are s...
Christoph Sprenger, David A. Basin
FORMATS
2010
Springer
13 years 8 months ago
Robust Satisfaction of Temporal Logic over Real-Valued Signals
Abstract. We consider temporal logic formulae specifying constraints in continuous time and space on the behaviors of continuous and hybrid dynamical system admitting uncertain par...
Alexandre Donzé, Oded Maler