140 search results - page 9 / 28 » Verifying timing properties of concurrent algorithms |
STOC
2000
ACM
13 years 11 months ago
2000
ACM
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
CSFW
2008
IEEE
14 years 1 months ago
2008
IEEE
Zdancewic and Myers introduced observational determinism as a scheduler independent notion of security for concurrent programs. This paper proposes a type system for verifying obs...
CHARME
2001
Springer
13 years 11 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
EMSOFT
2006
Springer
13 years 9 months ago
2006
Springer
Distributed real-time and embedded (DRE) systems have stringent constraints on timeliness and other properties whose assurance is crucial to correct system behavior. Formal tools ...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...