1650 search results - page 161 / 330 » The HOM problem is decidable |
185
click to vote
FROCOS
2009
Springer
15 years 11 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
144
click to vote
IDA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract Deciding which computer architecture provides the best performance for a certain program is an important problem in hardware design and benchmarking. While previous approa...
156
click to vote
RP
2009
Springer
15 years 11 months ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
138
click to vote
TARK
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a logic designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent prefere...
126
click to vote
SASO
2008
IEEE
15 years 10 months ago
2008
IEEE
We investigate periodic time synchronization of networks without centralized control, which can be modeled as a problem of aligning local variables taking values on a circle. Sync...