6608 search results - page 303 / 1322 » On the Completeness of Model Checking |
176
click to vote
APSEC
2005
IEEE
16 years 1 months ago
2005
IEEE
In component-based software development, it is important to ensure interoperability between components based on their unambiguous semantic descriptions, in order to obtain a viabl...
244
click to vote
CIBSE
2008
ACM
15 years 9 months ago
2008
ACM
Abstract. Software testing is an expensive and time-consuming activity; it is also error-prone due to human factors. But, it still is the most common effort used in the software in...
181
click to vote
MFCS
2005
Springer
16 years 29 days ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
165
click to vote
CAV
2003
Springer
16 years 21 days ago
2003
Springer
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
197
Voted
CARDIS
2006
Springer
15 years 11 months ago
2006
Springer
Ahead-of-Time and Just-in-Time compilation are common ways to improve runtime performances of restrained systems like Java Card by turning critical Java methods into native code. H...