Abstract
Complex asynchronous, distributed systems could benefit significantly from model checking, but model checking programs do not natively support verification of distributed software. Several frameworks have been developed recently that apply model checking to networked software, but none of these frameworks support complete modeling of programs that use the User Datagram Protocol (UDP). This paper presents the first framework to model realistic rather than ideal UDP network operations using Java Pathfinder, and describes its use in verifying a distributed UDP-based application.
- C. Artho and P. Garoche. Accurate centralization for applying model checking on networked applications. In Automated Software Engineering, pages 177--188. IEEE, 2006. Google Scholar
Digital Library
- C. Artho, Leungwattanakit, W., M. Hagiya, and Y. Tanabe. Efficient model checking of networked applications. Objects, Components, Models and Patterns, pages 22--40, 2008.Google Scholar
- C. Artho, W. Leungwattanakit, M. Hagiya, Y. Tanabe, and M. Yamamoto. Cache-based model checking of networked applications: From linear to branching time. In Automated Software Engineering, pages 447--458. IEEE, 2009. Google Scholar
Digital Library
- E. Barlas and T. Bultan. Netstub: a framework for verification of distributed java applications. In Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering, pages 24--33. ACM, 2007. Google Scholar
Digital Library
- E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999. Google Scholar
Digital Library
- K. Haveland and T. Pressburger. Model checking java programs using java pathfinder. International Journal on Software Tools for Technology Transfer, 2(4):366--381, 2000.Google Scholar
Cross Ref
- M. Musuvathi and D. Engler. Model checking large network protocol implementations. In Proceedings of the First Symposium on Networked Systems Design and Implementation, pages 155--168. NSDI, March 2004. Google Scholar
Digital Library
- B. Richards. Bugs as features: Teaching network protocols through debugging. In Proceedings of the thirty-first SIGCSE Technical Symposium on Computer Science Education, pages 24--33. ACM, March 2000. Google Scholar
Digital Library
- B. Richards and B. Stull. Teaching wireless networks with minimal resources. In Proceedings of the thirty-fifth SIGCSE Technical Symposium on Computer Science Education, pages 306--310. ACM, March 2004. Google Scholar
Digital Library
- B. Richards and N. Waisbrot. Illustrating networking concepts with wireless handheld devices. In Proceedings of the Seventh Annual Conference on Innovation and Technology in Computer Science Education, pages 28--33. ACM, June 2002. Google Scholar
Digital Library
- N. Shafiei and P. Mehlitz. Extending jpf to verify distributed systems. SIGSOFT Softw. Eng. Notes, 39(1):1--5, February 2014. Google Scholar
Digital Library
- N. Shafiei, E. Ruppert, and J. Ostroff. Model Checking Distributed Java Applications. Unpublished Thesis Proposal. University of York., 2013.Google Scholar
- S. Stoller and Y. Liu. Transformations for model checking distributed java programs. In Proceedings of the 8th international SPIN workshop on Model checking of software, pages 192--199. Springer-Verlag, 2001. Google Scholar
Digital Library
Index Terms
A framework for model checking UDP network programs with Java pathfinder
Recommendations
A framework for model checking UDP network programs with Java pathfinder
HILT '14: Proceedings of the 2014 ACM SIGAda annual conference on High integrity language technologyComplex asynchronous, distributed systems could benefit significantly from model checking, but model checking programs do not natively support verification of distributed software. Several frameworks have been developed recently that apply model ...
Tools to generate and check consistency of model classes for Java PathFinder
Java PathFinder (JPF) is a model checker for Java applications. Like any other model checker, JPF has to combat the notorious state space explosion problem. Since JPF is a JVM, it can only model check Java bytecode and needs to handle native calls ...
Model Checking Randomized Algorithms with Java PathFinder
QEST '10: Proceedings of the 2010 Seventh International Conference on the Quantitative Evaluation of SystemsOn the one hand, probabilistic model checkers such as PRISM have been successfully employed to verify models of probabilistic systems. However, they are not suitable for checking properties such as uncaught exceptions of the actual code of the system. ...







Comments