Sciweavers

3616 search results - page 65 / 724
» Conditional Memory Ordering
Sort
View
FOSSACS
2012
Springer
14 years 2 days ago
Concurrent Games with Ordered Objectives
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
Patricia Bouyer, Romain Brenguier, Nicolas Markey,...
SPAA
2005
ACM
15 years 10 months ago
Efficient algorithms for verifying memory consistency
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
Chaiyasit Manovit, Sudheendra Hangal
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
15 years 11 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
ERSHOV
2009
Springer
15 years 11 months ago
Proving the Equivalence of Higher-Order Terms by Means of Supercompilation
One of the applications of supercompilation is proving properties of programs.We focus in this paper on a speci c task: proving term equivalence for a higher-order lazy functiona...
Ilya Klyuchnikov, Sergei A. Romanenko
ICC
2007
IEEE
15 years 10 months ago
A Space-Time Code Design for Partial-Response CPM: Diversity Order and Coding Gain
— Using a linear decomposition of continuous phase modulated (CPM) signals with tilted-phase, sufficient conditions are derived under which M-ary partial-response CPM spacetime ...
Alenka G. Zajic, Gordon L. Stüber