551 search results - page 49 / 111 » Formalizing the Logic-Automaton Connection |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
103
click to vote
FMCAD
2008
Springer
14 years 11 months ago
2008
Springer
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
JPDC
2007
14 years 9 months ago
2007
Mesh networks are among the most important interconnection network topologies for large multicomputer systems. Mesh networks perform poorly in tolerating faults in the view of wor...
158
click to vote
POPL
2004
ACM
15 years 10 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
KBSE
2005
IEEE
15 years 3 months ago
2005
IEEE
Feature location aims at locating pieces of code that implement a given set of features (requirements). It is a necessary first step in every program comprehension and maintenanc...