Now showing items 1-4 of 4

    • Challenges in Empirically Testing Memory Persistency Models 

      Klimis, V; Donaldson, AF; Vafeiadis, V; Wickerson, J; Raad, A; Proceedings of the 2024 ACM/IEEE 44th International Conference on Software Engineering: New Ideas and Emerging Results (Association for Computing Machinery (ACM), 2024-04-14)
      Memory persistency models provide the foundational rules for software engineers to develop applications that take advantage of non-volatile memory (NVM), dictating which (and when) writes to NVM are deemed persistent. ...
    • Hyperstate space graphs for automated game analysis 

      Cook, M; Raad, A; 2019 IEEE Conference on Games (CoG) (2019-09-26)
      Automatically analysing games is an important challenge for automated game design, general game playing, and co-creative game design tools. However, understanding the nature of an unseen game is extremely difficult due to ...
    • Inferring Design Constraints from Game Ruleset Analysis 

      Cook, M; Colton, S; Raad, A (IEEE, 2018-10-11)
      Designing game rulesets is an important part of automated game design, and often serves as a foundation for all other parts of the game, from levels to visuals. Popular ways of understanding game rulesets include using AI ...
    • Lost in Interpretation: Navigating Challenges in Validating Persistency Models Amid Vague Specs and Stubborn Machines, All with a Sense of Humour 

      Klimis, V; Donaldson, AF; Vafeiadis, V; Wickerson, J; Raad, A (arXiv, 2024-05-28)
      Memory persistency models provide a foundation for persistent programming by specifying which (and when) writes to non-volatile memory (NVM) become persistent. Memory persistency models for the Intel-x86 and Arm architectures ...