509 search results - page 76 / 102 » On the completeness of compositional reasoning methods |
104
click to vote
TIP
2010
14 years 4 months ago
2010
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...
LPNMR
1990
Springer
15 years 1 months ago
1990
Springer
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 ...
110
click to vote
PLDI
2011
ACM
14 years 18 days ago
2011
ACM
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...
BMCBI
2008
14 years 10 months ago
2008
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...
CAV
2007
Springer
15 years 4 months ago
2007
Springer
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 ...