A BSP Algorithm for On-the-Fly Checking CTL* Formulas on Security Protocols

@inproceedings{Gava2012ABA,
  title={A BSP Algorithm for On-the-Fly Checking CTL* Formulas on Security Protocols},
  author={Fr{\'e}d{\'e}ric Gava and Micha{\"e}l Guedj and Franck Pommereau},
  booktitle={PDCAT},
  year={2012}
}
This paper presents a distributed algorithm to compute on-the-fly whether a structured model of a security protocol satisfies or not a CTL* formula. The design of this simple and still efficient algorithm is possible by using the structured nature of security protocols. A prototype implementation has been developed, allowing to run benchmarks. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 35 REFERENCES

Efficient on-the-fly model checking for CTL

  • Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science
  • 1995
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

LTL model checking for security protocols

  • Journal of Applied Non-Classical Logics
  • 2009
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Evaluating a peer-to-peer storage system in presence of malicious peers

  • 2011 International Conference on High Performance Computing & Simulation
  • 2011
VIEW 1 EXCERPT

A BSP Algorithm for the State Space Construction of Security Protocols

  • 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology
  • 2010
VIEW 3 EXCERPTS