Sciweavers

509 search results - page 76 / 102
» On the completeness of compositional reasoning methods
Sort
View
TIP
2010
155views more  TIP 2010»
13 years 3 months ago
Multiframe Super-Resolution Reconstruction of Small Moving Objects
Multiframe super-resolution (SR) reconstruction of small moving objects against a cluttered background is difficult for two reasons: a small object consists completely of "mix...
Adam W. M. van Eekeren, Klamer Schutte, Lucas J. v...
LPNMR
1990
Springer
14 years 25 days ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
PLDI
2011
ACM
12 years 11 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
BMCBI
2008
120views more  BMCBI 2008»
13 years 9 months ago
Statistical issues in the analysis of Illumina data
Background: Illumina bead-based arrays are becoming increasingly popular due to their high degree of replication and reported high data quality. However, little attention has been...
Mark J. Dunning, Nuno L. Barbosa-Morais, Andy G. L...
CAV
2007
Springer
108views Hardware» more  CAV 2007»
14 years 3 months ago
Systematic Acceleration in Regular Model Checking
Abstract. Regular model checking is a form of symbolic model checking technique for systems whose states can be represented as finite words over a finite alphabet, where regular ...
Bengt Jonsson, Mayank Saksena