6167 search results - page 32 / 1234 » Can Refinement be Automated |
FASE
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Software models are key in separating and solving independent development concerns. However, there is still a gap on how to transition design information among these sepa...
CADE
2002
Springer
14 years 10 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
MM
2006
ACM
14 years 3 months ago
2006
ACM
Precise automated video search is gaining in importance as the amount of multimedia information is increasing at exponential rates. One of the drawbacks that make video retrieval ...
METRICS
2003
IEEE
14 years 3 months ago
2003
IEEE
This paper addresses not only the question of testability measurement of OO designs but also focuses on its practicability. While detecting testability weaknesses (called testabil...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...