Sciweavers

2911 search results - page 399 / 583
» A Logic of Graph Constraints
Sort
View
DM
2000
150views more  DM 2000»
15 years 6 months ago
A note on generalized chromatic number and generalized girth
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
Béla Bollobás, Douglas B. West
ISSTA
2009
ACM
16 years 1 months ago
Precise pointer reasoning for dynamic test generation
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
Bassem Elkarablieh, Patrice Godefroid, Michael Y. ...
CAV
2004
Springer
151views Hardware» more  CAV 2004»
15 years 10 months ago
QB or Not QB: An Efficient Execution Verification Tool for Memory Orderings
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Ganesh Gopalakrishnan, Yue Yang, Hemanthkumar Siva...
PEPM
2010
ACM
16 years 3 months ago
PET: a partial evaluation-based test case generation tool for Java bytecode
PET is a prototype Partial Evaluation-based Test case generation tool for a subset of Java bytecode programs. It performs white-box test generation by means of two consecutive Par...
Elvira Albert, Miguel Gómez-Zamalloa, Germ&...
ICAI
2003
15 years 7 months ago
A Quantitative Model of Capabilities in Multi-Agent Systems
Reasoning about capabilities in multi-agent systems is crucial for many applications. There are two aspects of reasoning about the capabilities of an agent to achieve its goals. O...
Linli He, Thomas R. Ioerger