6608 search results - page 19 / 1322 » On the Completeness of Model Checking |
SFP
2001
13 years 8 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
JAR
2006
13 years 7 months ago
2006
Abstract. As products are growing more complex, so is their documentation. With an increasing number of product options, the diversity in service and maintenance procedures grows a...
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
SARA
2000
Springer
13 years 11 months ago
2000
Springer
BMCBI
2005
13 years 7 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...