5159 search results - page 466 / 1032 » Structural Testing of Executables |
176
click to vote
ISMIR
2005
Springer
16 years 1 months ago
2005
Springer
In this paper we propose a text represention for musical chord symbols that is simple and intuitive for musically trained individuals to write and understand, yet highly structure...
254
click to vote
TAINN
2005
Springer
16 years 1 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
244
click to vote
AGTIVE
1999
Springer
16 years 1 hour ago
1999
Springer
Abstract. In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the an...
244
click to vote
EURODAC
1994
IEEE
15 years 12 months ago
1994
IEEE
This paper presents a testability improvement method for digital systems described in VHDL behavioral specification. The method is based on testability analysis at registertransfe...
202
click to vote
EURODAC
1995
IEEE
15 years 11 months ago
1995
IEEE
This paper presents a formal approach to test combinational circuits. For the sake of explanation we describe the basic algorithms with the help of the stuck–at fault model. Ple...