Run-time verification of networked software
RV'10 Proceedings of the First international conference on Runtime verification
Model checking distributed systems by combining caching and process checkpointing
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Tools to generate and check consistency of model classes for Java PathFinder
ACM SIGSOFT Software Engineering Notes
Modeling class loaders in Java PathFinder version 7
ACM SIGSOFT Software Engineering Notes
Automated generation of model classes for Java PathFinder
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such systems. However, a simple state space exploration scheme is not applicable, as backtracking results in repeated communication operations. A cache-based approach solves this problem by hiding redundant communication operations from the environment. In this work, we propose a change from a linear-time to a branching-time cache, allowing us to relax restrictions in previous work regarding communication traces that differ between schedules. We successfully applied the new algorithm to real-life programs where a previous solution is not applicable.