299 search results - page 24 / 60 » Model Checking of Real-Time Reachability Properties Using Ab... |
SPIN
2000
Springer
13 years 11 months ago
2000
Springer
Research on how to reason about correctness properties of software systems using model checking is advancing rapidly. Work on exnite-state models from program source code and on ab...
DALT
2008
Springer
13 years 9 months ago
2008
Springer
ing and Verifying Strategy-proofness for Auction Mechanisms E. M. Tadjouddine, F. Guerin, and W. Vasconcelos Department of Computing Science, King's College, University of Abe...
TIME
2006
IEEE
14 years 1 months ago
2006
IEEE
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
TSE
2011
13 years 2 months ago
2011
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
WDAG
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...