2218 search results - page 107 / 444 » Testing Expressibility Is Hard |
ASPDAC
2004
ACM
14 years 2 months ago
2004
ACM
- Under manufacturing process variation, a path through a fault site is called longest for delay test if there exists a process condition under which the path has the maximum delay...
ESOP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The question of equivalence has long vexed research in concurrency, leading to many different denotational- and bisimulation-based approaches; a breakthrough occurred wit...
TCAD
2002
13 years 8 months ago
2002
As IC densities are increasing, cluster-based FPGA architectures are becoming the architecture of choice for major FPGA manufacturers. A cluster-based architecture is one in which...
LICS
2008
IEEE
14 years 3 months ago
2008
IEEE
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
COMPSAC
2007
IEEE
14 years 3 months ago
2007
IEEE
Although many of the software engineering activities can now be model-supported, the model is often missing in software development. We are interested in retrieving statemachine m...