Larissa Meinicke's research interests include mathematical notations and techniques for the formal specification and development of computing systems; probabilistic systems; computer security; abstract algebra and refinement algebra; real-time and fault-tolerant systems.
Dr Meinicke is currently a lecturer in the Division of Systems and Software Engineering Research in the School of Information Technology and Electrical Engineering.
She completed her PhD in the area of Computer Science at the University of Queensland in 2008 under the supervision of Professor Ian Hayes. Since then she has worked as a researcher at the Department of Information Technologies at Åbo Akademi University in Finland, both as a part of Professor Ralph-Johan Back’s Formal Methods and Programming research group, and as a member of the European Commission for Information and Communication Technologies project "Deploy".
From 2009 to 2011 Dr Meinicke worked on the ARC Research project "Hidden-state modelling for modular analysis of information flow, protection and risk evaluation" in conjunction with Associate Professor Annabelle McIver and Professor Carroll Morgan at Macquarie University in Sydney. Information about this research may be found at the Specification and Development of Probabilistic Systems page (below).
Book Chapter: Cylindric Kleene Lattices for Program Construction
Dongol, Brijesh, Hayes, Ian, Meinicke, Larissa and Struth, Georg (2019). Cylindric Kleene Lattices for Program Construction. In Lecture Notes in Computer Science (pp. 197-225) Cham: Springer International Publishing. doi:10.1007/978-3-030-33636-3_8
Book Chapter: Developing an Algebra for Rely/Guarantee Concurrency: Design Decisions and Challenges
Hayes, Ian J. and Meinicke, Larissa A. (2019). Developing an Algebra for Rely/Guarantee Concurrency: Design Decisions and Challenges. In Unifying Theories of Programming (pp. 176-197) Cham: Springer International Publishing. doi:10.1007/978-3-030-31038-7_9
Journal Article: A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency
Hayes, Ian J., Meinicke, Larissa A., Winter, Kirsten and Colvin, Robert J. (2018) A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. Formal Aspects of Computing, . doi:10.1007/s00165-018-0464-4
Design and verification of correct, efficient and secure concurrent systems
(2019–2022) ARC Discovery Projects
A mechanized framework for weak memory model security
(2019) Commonwealth Defence Science and Technology Group
An extensible framework for analysis of Java language-based security conformance
(2015–2019) ARC Linkage Projects
Unifying Hybrid Models Through the Rely-Guarantee Algebra
Doctor Philosophy
Cylindric Kleene Lattices for Program Construction
Dongol, Brijesh, Hayes, Ian, Meinicke, Larissa and Struth, Georg (2019). Cylindric Kleene Lattices for Program Construction. In Lecture Notes in Computer Science (pp. 197-225) Cham: Springer International Publishing. doi:10.1007/978-3-030-33636-3_8
Developing an Algebra for Rely/Guarantee Concurrency: Design Decisions and Challenges
Hayes, Ian J. and Meinicke, Larissa A. (2019). Developing an Algebra for Rely/Guarantee Concurrency: Design Decisions and Challenges. In Unifying Theories of Programming (pp. 176-197) Cham: Springer International Publishing. doi:10.1007/978-3-030-31038-7_9
Type capabilities for object-oriented programming languages
Wu, Xi, Lu, Yi, Meiring, Patrick A., Hayes, Ian J. and Meinicke, Larissa A. (2018). Type capabilities for object-oriented programming languages. In Formal methods and software engineering (pp. 215-230) Cham, Switzerland: Springer International Publishing. doi:10.1007/978-3-030-02450-5_13
A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency
Hayes, Ian J., Meinicke, Larissa A., Winter, Kirsten and Colvin, Robert J. (2018) A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency. Formal Aspects of Computing, . doi:10.1007/s00165-018-0464-4
Designing a semantic model for a wide-spectrum language with concurrency
Colvin, Robert J., Hayes, Ian J. and Meinicke, Larissa A. (2017) Designing a semantic model for a wide-spectrum language with concurrency. Formal Aspects of Computing, 29 5: 1-23. doi:10.1007/s00165-017-0416-4
Hidden-Markov program algebra with iteration
Mciver, Annabelle, Meinicke, Larissa and Morgan, Carroll (2015) Hidden-Markov program algebra with iteration. Mathematical Structures in Computer Science, 25 2: 320-360. doi:10.1017/S0960129513000625
Hidden-Markov program algebra with iteration
McIver, Annabelle, Meinicke, Larissa and Morgan, Carroll (2015) Hidden-Markov program algebra with iteration. Mathematical Structures in Computer Science, 25 S02: 320-360. doi:10.1017/S0960129513000625
Abstractions of non-interference security: probabilistic versus possibilistic
Hoang, Thai Son, McIver, Annabelle K., Meinicke, Larissa, Morgan, Carroll C., Sloane, Anthony and Susatyo, Enrico (2014) Abstractions of non-interference security: probabilistic versus possibilistic. Formal Aspects of Computing, 26 1: 169-194. doi:10.1007/s00165-012-0237-4
Linking unifying theories of program refinement
Hayes, Ian J., Dunne, Steve E. and Meinicke, Larissa A. (2013) Linking unifying theories of program refinement. Science of Computer Programming, 78 11: 2086-2107. doi:10.1016/j.scico.2012.07.010
Refinement algebra for probabilistic programs
Meinicke, Larissa and Solin, Kim (2010) Refinement algebra for probabilistic programs. Formal Aspects of Computing, 22 1: 3-31. doi:10.1007/s00165-009-0111-1
Algebraic reasoning for probabilistic action systems and while-loops
Meinicke, Larissa and Hayes, Ian J. (2008) Algebraic reasoning for probabilistic action systems and while-loops. Acta Informatica, 45 5: 321-382. doi:10.1007/s00236-008-0073-4
Evaluation of a new assesment scheme for a third-year concurrency course
Strooper, Paul and Meinicke, Larissa (2007) Evaluation of a new assesment scheme for a third-year concurrency course. Conferences in Research and Practice in Information Technology Series, 66 147-154.
Encoding fairness in a synchronous concurrent program algebra
Hayes, Ian J. and Meinicke, Larissa A. (2018). Encoding fairness in a synchronous concurrent program algebra. In: Klaus Havelund, Jan Peleska, Bill Roscoe and Erik de Vink, Formal Methods - 22nd International Symposium, FM 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings. 22nd International Symposium on Formal Methods, FM 2018 Held as Part of the Federated Logic Conference, FloC 2018, Oxford, United Kingdom, (222-239). 15-17 July 2018. doi:10.1007/978-3-319-95582-7_13
Capabilities for Java: Secure access to resources
Hayes, Ian J., Wu, Xi and Meinicke, Larissa A. (2017). Capabilities for Java: Secure access to resources. In: Bor-Yuh Evan Chang, Programming Languages and Systems - 15th Asian Symposium, APLAS 2017, Proceedings. 15th Asian Symposium on Programming Languages and Systems, APLAS 2017, Suzhou, People's Republic of China, (67-84). 27-29 November 2017. doi:10.1007/978-3-319-71237-6_4
Evaluating quality of security testing of the JDK
Krishnan, Padmanabhan, O’Donoghue, Rebecca, Loh, Jerome and Meinicke, Larissa (2017). Evaluating quality of security testing of the JDK. In: A-TEST 2017 - Proceedings of the 8th ACM SIGSOFT International Workshop on Automated Software Testing, Co-located with FSE 2017. 8th ACM SIGSOFT International Workshop on Automated Software Testing, A-TEST 2017, co-located with the International ESEC/FSE Conference, FSE 2017, Paderborn, Germany, (19-20). 4-5 September 2017. doi:10.1145/3121245.3121246
An algebra of synchronous atomic steps
Hayes, Ian J., Colvin, Robert J., Meinicke, Larissa A., Winter, Kirsten and Velykis, Andrius (2016). An algebra of synchronous atomic steps. In: John Fitzgerald, Constance Heitmeyer, Stefania Gnesi and Anna Philippou, FM 2016: Formal Methods - 21st International Symposium, Proceedings. 21st International Symposium on Formal Methods, FM 2016, Limassol, Cyprus, (352-369). 9-11 November 2016. doi:10.1007/978-3-319-48989-6_22
Designing for visually impaired developers
Epifani, Andrea, Boden, Marie, Meinicke, Larissa, Matthews, Ben and Viller, Stephen (2015). Designing for visually impaired developers. In: Vesna Popovic, Alethea Blackler, Ding-Bang Luh, Nithikul Nimkulrat, Ben Kraal and Yukari Nagai, IASDR 2015 Interplay: Proceedings. World Conference of the International Association of Design Research, Brisbane, Australia, (609-622). 2-5 November 2015.
Abstract channels and their robust information-leakage ordering
McIver, Annabelle, Morgan, Carroll, Smith, Geoffrey, Espinoza, Barbara and Meinicke, Larissa (2014). Abstract channels and their robust information-leakage ordering. In: Martín Abadi and Steve Kremer, Principles of Security and Trust - Third International Conference, POST 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Proceedings. 3rd International Conference on Principles of Security and Trust, POST 2014 - Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, (83-102). 5 -13 April 2014. doi:10.1007/978-3-642-54792-8_5
Invariants, well-founded statements and real-time program algebra
Hayes, Ian J. and Meinicke, Larissa (2014). Invariants, well-founded statements and real-time program algebra. In: Cliff Jones, Pekka Pihlajasaari and Jun Sun, FM 2014: Formal Methods - 19th International Symposium, Proceedings. 19th International Symposium on Formal Methods, FM 2014, Singapore, (318-334). 12 - 16 May 2014. doi:10.1007/978-3-319-06410-9_23
A kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism
McIver, Annabelle, Meinicke, Larissa and Morgan, Carroll (2012). A kantorovich-monadic powerdomain for information hiding, with probability and nondeterminism. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, (461-470). 25 - 28 June 2012. doi:10.1109/LICS.2012.56
Towards an algebra for real-time programs
Dongol, Brijesh, Hayes, Ian J., Meinicke, Larissa and Solin, Kim (2012). Towards an algebra for real-time programs. In: Wolfram Kahl and Timothy G. Griffin, Proceedings: 13th International Conference, RAMiCS 2012. 13th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2012), Cambridge, United Kingdom, (50-65). 17 - 20 September 2012. doi:10.1007/978-3-642-33314-9_4
Compositional closure for Bayes Risk in probabilistic noninterference
McIver, Annabelle, Meinicke, Larissa and Morgan, Carroll (2010). Compositional closure for Bayes Risk in probabilistic noninterference. In: Samson Abramsky, Cyril Gavoille and Claude Kirchner, Automata, languages and programming: 37th International Colloquium, ICALP 2010: Proceedings, part II. 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Bordeaux, France, (223-235). 5-10 July 2010. doi:10.1007/978-3-642-14162-1_19
Linear-invariant generation for probabilistic programs: Automated support for proof-based methods
Katoen, Joost-Pieter, McIver, Annabelle, Meinicke, Larissa and Morgan, Carroll C. (2010). Linear-invariant generation for probabilistic programs: Automated support for proof-based methods. In: Radhia Cousot and Matthieu Martel, Static Analysis: 17th International Symposium, SAS 2010: Proceedings. 17th International Static Analysis Symposium (SAS 2010), Perpignan, France, (390-406). 14-16 September 2010. doi:10.1007/978-3-642-15769-1_24
Unifying theories of programming that distinguish nontermination and abort
Hayes, I. J., Dunne, S. E. and Meinicke, L. (2010). Unifying theories of programming that distinguish nontermination and abort. In: Claude Bolduc, Jules Desharnais and Béchir Ktari, Lecture Notes in Computer Science. Mathematics of Program Construction: 10th International Conference, MPC 2010. Mathematics of Program Construction [MPC], Québec City, Québec, Canada, (178-194). 21-23 June, 2010. doi:10.1007/978-3-642-13321-3
Security, probability and nearly fair coins in the cryptographers' café
McIver, Annabelle, Meinicke, Larissa and Morgan, Carroll (2009). Security, probability and nearly fair coins in the cryptographers' café. In: Ana Cavalcanti and Dennis Dams, FM 2009: Formal Methods: SecondWorld Congress proceedings. 2nd World Congress on Formal Methods (FM 2009), Eindhoven, The Netherlands, (41-71). 2-6 November 2009. doi:10.1007/978-3-642-05089-3_5
Probabilistic Choice in Refinement Algebra
Meinicke, L. and Hayes, I. J. (2008). Probabilistic Choice in Refinement Algebra. In: P. Audebaud and C. Paulin-Mohring, Lecture Notes in Computer ScienceProceedings of the 9th international conference on Mathematics of Program Construction. 9th International Conference on Mathematics of Program Construction [MPC], Marseille, France, (243-267). 15-18 July 2008. doi:10.1007/978-3-540-70594-9_14
Reactive probabilistic programs and refinement algebra
Meinicke, L. A. and Solin, K. (2008). Reactive probabilistic programs and refinement algebra. In: Relations and Kleene algebra in computer science : 10th International Conference on Relational Methods in Computer Science and 5th International Conference on Applications of Kleene Algebra, RelMiCS/AKA 2008: Proceedings. 10th International Conference on Relational Methods in Computer Science/5th International Workshop on Applications of Kleene Algebra, Frauenworth Germany, (304-319). 7 - 11 April 2008. doi:10.1007/978-3-540-78913-0_23
A stepwise development process for reasoning about the reliability of real-time systems
Meinicke, L. and Smith, G. (2007). A stepwise development process for reasoning about the reliability of real-time systems. In: J. Davies and J. Gibbons, Integrated Formal Methods 2007. 6th International Conference: IFM 2007 - Integrated Formal Methods, Oxford, U.K., (439-458). 2-5 July 2007. doi:10.1007/978-3-540-73210-5_23
Evaluation of a new assessment scheme for a third-year concurrency course
Strooper, P. A. and Meinicke, L. (2007). Evaluation of a new assessment scheme for a third-year concurrency course. In: Simon Mann, Proceedings of the Ninth Australiasian Computing Education Conference (ACE 2007). Ninth Australiasian Computing Education Conference (ACE 2007), Ballarat, Victoria, Australia, (147-154). 30 January - 2 February, 2007.
Continuous action system refinement
Meinicke, L. A. and Hayes, I. J. (2006). Continuous action system refinement. In: Tarmo Uustalu, Mathematics of Program Construction. 8th International Conference on Mathematics of Program Construction (MPC 2006), Kuressaare, Estonia, (316-337). 3-5 July 2006.
Reasoning algebraically about probabilistic loops
Meinicke, Larissa and Hayes, Ian J. (2006). Reasoning algebraically about probabilistic loops. In: Z. Liu and J. He, 8th International Conference on Formal Engineering Methods, Macua, PR China, (380-399). 1-3 November, 2006. doi:10.1007/11901433_21
Transformation Rules for Probabilistic Progams: An Algebraic Approach
Meinicke, Larissa A. (2008). Transformation Rules for Probabilistic Progams: An Algebraic Approach PhD Thesis, School of Information Technology and Electrical Engineering, The University of Queensland.
Design and verification of correct, efficient and secure concurrent systems
(2019–2022) ARC Discovery Projects
A mechanized framework for weak memory model security
(2019) Commonwealth Defence Science and Technology Group
An extensible framework for analysis of Java language-based security conformance
(2015–2019) ARC Linkage Projects
Understanding concurrent programs using rely-guarantee thinking
(2013–2015) ARC Discovery Projects
Unifying Hybrid Models Through the Rely-Guarantee Algebra
Doctor Philosophy — Principal Advisor
Other advisors: