Course of action generation for cyber security using classical planning

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 12-21

  Boddy, Mark ^a   Gohde, Johnathan ^a   Haigh, Tom ^a   Harp, Steven ^a  

^a Adventium Labs   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PLANNING; COURSE OF ACTION; CYBER SECURITY; DOCUMENT CONTROL SYSTEMS; EXTENDED SEQUENCES; INITIAL STATE; NETWORK VULNERABILITY; STATE OF THE ART;

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

References (15)

1. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAl 95), 1636-1642.
2. Fox, M. and Long, D. 2002. Pddl2.1: An extension to pddl for expressing temporal planning domains. Technical report, University of Durham.
3. Hoffmann, J. 2003. The Metric-FF planning system: Translating "ignoring delete lists" to numeric slate variables. Journal of Artificial Intelligence Research, accepted for the special issue on the 3rd International Planning Competition.
4. Jonsson, P. and Backstrom, C. 1998. State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence 100(1-2): 125-176.
5. Lin, F. 2003. Compiling causal theories to successor state axioms and strips-like systems. Journal of Artificial Intelligence Research 19:279-314.
6. Noel, S.; Jajodia, S.; O'Berry, B. and Jacobs, M. 2003. Efficient minimum-cost network hardening via exploit dependency graphs. In Proceedings of 19th Annual Computer Security Applications Conference, 86-95. IEEE Computer Society.
7. Phillips, C. and Swiler, L. P. 1998. A graph-based system for network-vulnerability analysis. In Proceedings of the New Security Paradigms Workshop, 11-79.
8. Porteous, J.; Sebastia, L. and Hoffmann, J. 2001. On the extraction, ordering, and usage of landmarks in planning. In Proceedings of the 6th European Conference on Planning (ECP01).
9. Ritchey, R. W. and Ammann, P. 2000. Using model checking to analyze network vulnerabilities. In Proceedings 2000 IEEE Computer Society Symposium on Security and Privacy, 156-165.
10. Seindal, R. GNU m4. GNU Software Foundation. http://www.seindal.dk/rene/ gnu/.
11. Sheyner, O.; Haines, J.; Jha, S.; Lippmann, R.; and Wing, J. M. 2002. Automated generati on and analysis of attack graphs. In 2002 IEEE Symposium on Security and Privacy ISSP '02, 273-284. Washington - Brussels - Tokyo: IEEE.
12. Sheyner, O. 2004. Scenario Graphs and Attack Graphs. Ph.D. Dissertation, Computer Science Department, Pittsburgh, PA.
13. Wool, A. 2001. Architecting the lumeta firewall analyzer. In Proceedings of the 10th USENIX Security Symposium. Washington, D.C.: USENIX.
14. Zerkle, D. and Levitt, K. 1996. NetKuang-A multi-host configuration vulnerability checker. In Proc. of the 6th USENIX Security Symposium, 195-201.
15. Zimmerman, T., and Kambhampati, S. 2002. Generating parallel plans satisfying multiple criteria in anytime fashion. In AIPS-02 Workshop on Planning and Scheduling with Multiple Criteria.