Systematic verification of safety properties of arbitrary network protocol compositions using CHAIN

Proceedings - International Conference on Network Protocols, ICNP

Volumn 2003-January, Issue , 2003, Pages 234-244

  Bradley, A D ^a   Bestavros, A ^a   Kfoury, A J ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

Algebra; Computer science; Mechanical factors; Protocols; Safety; State space methods; System recovery; Uncertainty; Web and internet services; Web server

Indexed keywords

ACCIDENT PREVENTION; ALGEBRA; CHAINS; COMPLEX NETWORKS; COMPUTER SCIENCE; COMPUTER SYSTEM RECOVERY; HTTP; HYPERTEXT SYSTEMS; INTERNET; MOTION PICTURE EXPERTS GROUP STANDARDS; NETWORK PROTOCOLS; STATE SPACE METHODS; WEB SERVICES;

INTERNET SERVICES; MECHANICAL FACTORS; SYSTEM RECOVERY; UNCERTAINTY; WEB SERVERS;

INTERNET PROTOCOLS;

EID: 84890403266     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2003.1249774     Document Type: Conference Paper

References (25)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
2. J. Baeten and W. Weijland. Process Algebra. Cambridge University Press, 1990.
3. A. D. Bradley and A. Bestavros. Basis token consistency: Extending and evaluating a novel web consistency algorithm. In Workshop on Caching, Coherence, and Consistency (WC3), New York, June 2002. IEEE.
4. A. D. Bradley and A. Bestavros. Basis token consistency: Supporting strong web cache consistency. In Global Internet Worshop, Taipei, Nov. 2002. IEEE.
5. A. D. Bradley, A. Bestavros, and A. J. Kfoury. Safe composition of web communication protocols for extensible edge services. In Workshop on Web Caching and Content Delivery (WCW), Boulder, CO, Aug. 2002.
6. A. D. Bradley, A. Bestavros, and A. J. Kfoury. Safe composition of web communication protocols for extensible edge services. Technical Report BUCS-TR-2002-017, Boston University Computer Science, 2002.
7. A. D. Bradley, A. Bestavros, and A. J. Kfoury. Systematic verification of safety properties of arbitrary network protocol compositions using CHAIN. Technical Report BUCS-TR-2003-012, Boston University Computer Science, 2003.
8. S. Chaki, S. K. Rajamani, and J. Rehof. Types as models: Model checking message-passing programs. In POPL 2002, Portland, OR, Jan. 2002.
9. M. Chechik, B. Devereux, and A. Gurfinkel. Model-checking infinite state-space systems with fine-grained abstractions using SPIN. In 8th SPIN Workshop, Toronto, 2001.
10. J. Dingel and T. Filkorn. Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving. In P. Wolper, editor, Proceedings of the 7th International Conference on Computer Aided Verification, volume 939, pages 54-69, Liege, Belgium, 1995. Springer Verlag.
11. C. Fidge. Logical time in distributed computing systems. Computer, 24(8):28-33, Aug. 1991.
12. T. G. Griffin and G. Wilfong. On the correctness of IBGP configuration. In ACM SIGCOMM, Pittsburgh, PA, Aug. 2002. ACM.
13. D. He, G. Muller, and J. L. Lawall. Distributing MPEG movies over the internet using programmable networks. In International Conference on Distributed Computing Systems (ICDCS), July 2002.
14. G. J. Holzmann. Designing bug-free protocols with SPIN. Computer Communications Journal, pages 97-105, Mar. 1997.
15. D. Jackson. Abstract model checking of infinite specifications. In Proceedings of Formal Methods Europe, Barcelona, Oct. 1994.
16. D. E. Knuth and P. Bendix. Simple word problems in universal algebra. Computational Problems in Abstract Algebra, pages 263-297, 1970.
17. B. Krishnamurthy, J. C. Mogul, and D. M. Kristol. Key differences between HTTP/1.0 and HTTP/1.1. In Proceedings of the WWW-8 Conference, Toronto, May 1999.
18. A. Kučera and P. Jančar. Equivalence-checking with infinite-state systems: Techniques and results. In Proceedings of 29th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM 2002), pages 41-73. Springer-Verlag, 2002.
19. M. Leuschel and T. Massart. Infinite state model checking by abstract interpretation and program specialisation. In A. Bossi, editor, Logic-Based Program Synthesis and Transformation (LOPSTR'99), LNCS 1817, pages 63-82, Venice, Italy, 2000.
20. N. Lynch and F. Vaandrager. Forward and backward simulations - part I: Untimed systems. Information and Computation, 121(2):214-233, Sept. 1995.
21. F. Mattern. Virtual time and global states of distributed systems. In Proc. Parallel and Distributed Algorithms Conf., pages 215-226, 1988.
22. J. Mogul. Is 100-Continue hop-by-hop?, July 7, 1997. HTTP-WG Mailing List Archive, http://www-old.ics.uci.edu/pub/ietf/http/hypermail/1997q3/.
23. V. Paxson. End-to-end internet packet dynamics. IEEE/ACM Transactions on Networking, 7(3):277-292, 1999.
24. S. Shenker. Where's the science? Keynote Address presented at the NSF ANIR Principle Investigators Meeting, Reston, VA, Jan. 2003.
25. J. Touch, D. Wagner, and J. Walrand. Panel recommendations on "Network Trustworthiness". Presented at the NSF ANIR Principle Investigator Meeting, Reston, VA, Jan. 2003.