Sciweavers

26 search results - page 6 / 6
» Constraint-Based Random Stimuli Generation for Hardware Veri...
Sort
View
ICALP
2009
Springer
16 years 19 days ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner