Sciweavers

144 search results - page 3 / 29
» Verification of Liveness Properties in Distributed Systems
Sort
View
POPL
2005
ACM
14 years 7 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
CONCUR
2006
Springer
13 years 11 months ago
Liveness, Fairness and Impossible Futures
Impossible futures equivalence is the semantic equivalence on labelled transition systems that identifies systems iff they have the same "AGEF" properties: temporal logic...
Rob J. van Glabbeek, Marc Voorhoeve
CC
2009
Springer
126views System Software» more  CC 2009»
14 years 8 months ago
Live Debugging of Distributed Systems
Debugging distributed systems is challenging. Although incremental debugging during development finds some bugs, developers are rarely able to fully test their systems under realis...
Darren Dao, Jeannie R. Albrecht, Charles Edwin Kil...
SAC
2008
ACM
13 years 6 months ago
Preserving coordination properties when transforming concurrent system components
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
Gudmund Grov, Robert F. Pointon, Greg Michaelson, ...
ASE
2008
102views more  ASE 2008»
13 years 7 months ago
Model driven code checking
Model checkers were originally developed to support the formal verification of high-level design models of distributed system designs. Over the years, they have become unmatched in...
Gerard J. Holzmann, Rajeev Joshi, Alex Groce