592 search results - page 100 / 119 » Can Component Service-Based Systems Be Proved Correct |
97
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice,...
121
Voted
MST
2007
15 years 3 months ago
2007
Consider a collection of r identical asynchronous mobile agents dispersed on an arbitrary anonymous network of size n. The agents all execute the same protocol and move from node ...
149
click to vote
ICSE
2000
IEEE-ACM
15 years 7 months ago
2000
IEEE-ACM
We present Galileo, an innovative engineering modeling and analysis tool built using an approach we call packageoriented programming (POP). Galileo represents an ongoing evaluatio...
135
Voted
CF
2005
ACM
15 years 5 months ago
2005
ACM
Result checking is the theory and practice of proving that the result of an execution of a program on an input is correct. Result checking has most often been envisioned in the fr...
124
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: It has repeatedly been shown that interacting protein families tend to have similar phylogenetic trees. These similarities can be used to predicting the mapping betwee...