Efficient verification of a multicast protocol for mobile computing

Computer Journal

Volumn 44, Issue 1, 2001, Pages 21-30

  Anastasi, Giuseppe ^a   Bartoli, Alberto ^b   De Francesco, Nicoletta ^a   Santone, Antonella ^a  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF TRIESTE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; DATA COMMUNICATION SYSTEMS; FORMAL LOGIC; MOBILE COMPUTING; MULTICASTING; PROGRAM TRANSLATORS; RADIO LINKS; WIRELESS TELECOMMUNICATION SYSTEMS;

FORMAL VERIFICATION; MULTICAST PROTOCOL; WIRELESS LINKS;

NETWORK PROTOCOLS;

EID: 0035655183     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/44.1.21     Document Type: Article

References (28)

1. The NCSU concurrency workbench
2. Automatic verification of finite-state concurrent systems using temporal logic verification
3. Selective mu-calculus and formula-based equivalence of transition systems
4. LORETO: A tool for reducing state explosion in verification of Lotos programs
5. Group multicast in distributed mobile systems with unreliable wireless network
6. Group-based multicast and dynamic membership in wireless networks with incomplete spatial coverage
7. A framework for delivering multicast messages in networks with mobile hosts
8. Selective mu-calculus: New modal operators for proving properties on reduced transition systems
9. Results on the propositional mu-calculus
10. An introduction to modal and temporal logics for CCS
11. A case study in safety-critical design
12. A practical technique for process abstraction
13. Formula-dependent equivalence for compositional CTL model checking
14. Generation of reduced models for checking fragments of CTL
15. All from one, one for all, on model-checking using representatives
16. Partial-order methods for the verification of concurrent systems
17. A stubborn attack on state explosion
18. Compositional model checking
19. Model checking and modular verification
20. 'On the fly' verification of behavioural equivalences and preorders
21. Tableau-based model checking in the propositional mu-calculus
22. An automata-theoretic approach to branching-time model checking