1116 search results - page 97 / 224 » Applying Predicate Abstraction to Abstract State Machines |
ISCIS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Based on a distinguishing sequence for a Finite State Machine (FSM), an efficient checking sequence may be produced from the elements of a set Eα of α –sequences and ...
105
click to vote
KBSE
2009
IEEE
15 years 6 months ago
2009
IEEE
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
ISLPED
2003
ACM
15 years 4 months ago
2003
ACM
The power consumption of a sequential circuit can be reduced by decomposing it into subcircuits which can be turned off when inactive. Power can also be reduced by careful state e...
ENTCS
2007
14 years 11 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
MLDM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. An efficient low-level word image representation plays a crucial role in general cursive word recognition. This paper proposes a novel representation scheme, where a word...