Existing attack graph generators are not well documented, they do not comply with the current requirements to be applied in practice, or their implementations of theoretical research papers are not publicly available. MulVAL is an attack graph generator using logic programming for determining attack graphs. The goal is to create a tool in Python language that will provide similar functionality as MulVAL.

The implementation part of the thesis consists of the following subtasks:

• create a structure of JSON file for generation rules that were written to a text file in the past,
• implement an attack graph generator in Python that will replace MulVAL,
• implement functionality that will output the final attack graph to a JSON file or implement simple visualization,
• test the tool,
• other subtasks according to the actual needs of the implementation.

The text of the thesis will contain a brief overview of research in the area of attack graph generation. The student will also describe the implementation problem and the created implementation.

Attack graph generation is considered to be a difficult task. For this reason, it is expected that the generator will correctly construct attack graphs for straightforward input cases. Furthermore, the student will clearly define what more complex cases (e.g., removal of cycles) the generator can process.