What packets may come: Automata for network monitoring

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2001, Pages 206-219

  Bhargavan, Karthikeyan ^a   Chandra, Satish ^b   McCann, Peter J ^b   Gunter, Carl A ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET TRANSMISSION CONTROL PROTOCOL; NETWORK MONITORING;

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; INPUT OUTPUT PROGRAMS; NETWORK PROTOCOLS; PACKET NETWORKS;

COMPUTER NETWORKS;

EID: 0035042203     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. The Esterel synchronous programming language: Design, semantics, implementation
2. Verisim: Formal analysis of network simulations
3. A taxonomy of logical network analysis techniques
4. Model checking for programming languages using VeriSoft
5. Specification-based testing of reactive software: Tools and experiments
6. Passive testing and its applications to network management
7. Runtime assurance based on formal specifications
8. An introduction to input/output automata
9. Efficient specification-based test oracles
10. Automated packet trace analysis of TCP implementations
11. Bro: A system for detecting network intruders in real-time
12. End-to-end internet packet dynamics
13. Implementing a generalized tool for network monitoring