A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Most shared memory systems maximize performance by unpredictably resolving memory races. Unpredictable memory races can lead to nondeterminism in parallel programs, which can suff...
Derek Hower, Polina Dudnik, Mark D. Hill, David A....
A new multi-core DSP board is available for university and industry engineers. The LogicPD ZoomTM OMAP-L138 eXperimenter Kit, featuring Texas Instruments’ dual core SoC (ARM9 an...
Michael G. Morrow, Cameron H. G. Wright, Thad B. W...
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...