592 search results - page 83 / 119 » Can Component Service-Based Systems Be Proved Correct |
144
click to vote
CCS
2009
ACM
15 years 7 months ago
2009
ACM
We present an approach for the design and analysis of an electronic voting machine based on a novel combination of formal verification and systematic testing. The system was desig...
144
Voted
OOPSLA
2010
Springer
15 years 1 months ago
2010
Springer
Atomic regions are an important concept in correct concurrent programming: since atomic regions can be viewed as having executed in a single step, atomicity greatly reduces the nu...
145
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
137
Voted
SAC
2008
ACM
15 years 2 months ago
2008
ACM
This paper introduces an approach to develop componentbased adaptive distributed applications. Our approach separates the communication and the functional aspects of a distributed...
153
click to vote
STOC
2006
ACM
16 years 3 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...