85 search results - page 11 / 17 » Towards Automatic Analysis of Election Verifiability Propert... |
CONCUR
2006
Springer
15 years 3 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...
ICCAD
2001
IEEE
15 years 8 months ago
2001
IEEE
tems. STARS manipulates abstract representations of system components to obtain upper bounds on the number of various events in the system, as well as a bound on the response time....
105
click to vote
ICECCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Distributed information systems are critical to the functioning of many businesses; designing them to be dependable is a challenging but important task. We report our experience i...
151
click to vote
CHARME
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
165
click to vote
TSMC
2010
14 years 6 months ago
2010
Business Process Execution Language for Web Services (BPEL) is becoming the industrial standard for modeling web service-based business processes. Behavioral compatibility for web ...