Sciweavers

3470 search results - page 565 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
JSC
2010
100views more  JSC 2010»
13 years 5 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
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...
Igor V. Konnov, Vladimir A. Zakharov
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 2 months ago
Tight Upper Bounds for Streett and Parity Complementation
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...
Yang Cai, Ting Zhang
HPCA
2011
IEEE
13 years 2 months ago
Calvin: Deterministic or not? Free will to choose
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....
ICASSP
2011
IEEE
13 years 2 months ago
WinDSK8: A user interface for the OMAP-L138 DSP board
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...
VSTTE
2012
Springer
12 years 6 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak