1855 search results - page 165 / 371 » A coding theorem for distributed computation |
148
click to vote
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
Abstract. We describe how the PVS verification system has been used to verify a safety property of a garbage collection algorithm, originally suggested by Ben-Ari. The safety prope...
132
Voted
CONCUR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
142
Voted
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
155
Voted
PPSN
2010
Springer
15 years 1 months ago
2010
Springer
Recombination (also called crossover) operators are widely used in EAs to generate offspring solutions. Although the usefulness of recombination has been well recognized, theoretic...
138
Voted
CONCUR
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...