98 search results - page 15 / 20 » A Formal Logic Approach to Constrained Combinatorial Testing |
253
Voted
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
238
click to vote
CAV
2004
Springer
15 years 11 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
196
Voted
COMPSAC
2002
IEEE
16 years 11 days ago
2002
IEEE
Programs use rules to dictate or constrain specific decisions or actions. These rules have typically been tested, revised, and updated continuously; therefore, they represent a su...
208
click to vote
SIGSOFT
2006
ACM
16 years 8 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
184
Voted
DAC
2007
ACM
15 years 11 months ago
2007
ACM
We present a framework for validating the compliance of a design with a given architecture. Our approach is centered on the concept of misinterpretations. These include missing be...