The University of Queensland

Specifying and Reasoning About Shared-Variable Concurrency

Hayes, Ian J., Jones, Cliff B. and Meinicke, Larissa A. (2023). Specifying and Reasoning About Shared-Variable Concurrency. Theories of Programming and Formal Methods. (pp. 110-135) Cham: Springer Nature Switzerland. doi: 10.1007/978-3-031-40436-8_5

Trace Models of Concurrent Valuation Algebras

Evangelou-Oost, Naso, Meinicke, Larissa, Bannister, Callum and Hayes, Ian J. (2023). Trace Models of Concurrent Valuation Algebras. Formal Methods and Software Engineering. (pp. 118-136) Singapore: Springer Nature Singapore. doi: 10.1007/978-981-99-7584-6_8

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, 31 (2), 133-163. 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 (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

Refinement Algebra for Probabilistic Programs

Meinicke, Larissa and Solin, Kim (2008). Refinement Algebra for Probabilistic Programs. Electronic Notes in Theoretical Computer Science, 201 (C), 177-195. doi: 10.1016/j.entcs.2008.02.020

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.

Using cylindric algebra to support local variables in rely/guarantee concurrency

Meinicke, Larissa A. and Hayes, Ian J. (2023). Using cylindric algebra to support local variables in rely/guarantee concurrency. IEEE/ACM 11th International Conference on Formal Methods in Software Engineering (FormaliSE), Melbourne, VIC, Australia, 14-15 May 2023. Piscataway, NJ, United States: Institute of Electrical and Electronics Engineers. doi: 10.1109/formalise58978.2023.00019

Cylindric Kleene Lattices for Program Construction

Dongol, Brijesh, Hayes, Ian, Meinicke, Larissa and Struth, Georg (2019). Cylindric Kleene Lattices for Program Construction. MPC: 13th International Conference on Mathematics of Program Construction, Porto, Portugal, 7–9 October 2019. Cham, Switzerland: Springer. 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. UTP: 7th International Symposium on Unifying Theories of Programming, Porto, Portugal, 8 October 2019. Cham, Switzerland: Springer. doi: 10.1007/978-3-030-31038-7_9

Encoding fairness in a synchronous concurrent program algebra

Hayes, Ian J. and Meinicke, Larissa A. (2018). Encoding fairness in a synchronous concurrent program algebra. 22nd International Symposium on Formal Methods, FM 2018 Held as Part of the Federated Logic Conference, FloC 2018, Oxford, United Kingdom, 15-17 July 2018. Heidelberg, Germany: Springer. doi: 10.1007/978-3-319-95582-7_13

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. 20th International Conference on Formal Engineering Methods, ICFEM 2018, Gold Coast, QLD Australia, 12-16 November 2018. Cham, Switzerland: Springer. doi: 10.1007/978-3-030-02450-5_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. 15th Asian Symposium on Programming Languages and Systems, APLAS 2017, Suzhou, People's Republic of China, 27-29 November 2017. Heidelberg, Germany: Springer. 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. 8th ACM SIGSOFT International Workshop on Automated Software Testing, A-TEST 2017, co-located with the International ESEC/FSE Conference, FSE 2017, Paderborn, Germany, 4-5 September 2017. New York, NY, United States: Association for Computing Machinery. 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. 21st International Symposium on Formal Methods, FM 2016, Limassol, Cyprus, 9-11 November 2016. Heidelberg, Germany: Springer. 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. World Conference of the International Association of Design Research, Brisbane, Australia, 2-5 November 2015. The International Association of Societies of Design Research.

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. 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, 5 -13 April 2014. Heidelberg, Germany: Springer Verlag. 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. 19th International Symposium on Formal Methods, FM 2014, Singapore, 12 - 16 May 2014. Heidelberg, Germany: Springer Verlag. 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. 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012, Dubrovnik, Croatia, 25 - 28 June 2012. Los Alamitos, CA United States: IEEE Computer Society. 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. 13th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 2012), Cambridge, United Kingdom, 17 - 20 September 2012. Heidelberg, Germany: Springer. 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. 37th International Colloquium on Automata, Languages and Programming (ICALP 2010), Bordeaux, France, 5-10 July 2010. Heidelberg, Germany: Springer. 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. 17th International Static Analysis Symposium (SAS 2010), Perpignan, France, 14-16 September 2010. Heidelberg, Germany: Springer. 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. Mathematics of Program Construction [MPC], Québec City, Québec, Canada, 21-23 June, 2010. Berlin, Germany: Springer. 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é. 2nd World Congress on Formal Methods (FM 2009), Eindhoven, The Netherlands, 2-6 November 2009. Heidelberg, Germany: Springer. 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. 9th International Conference on Mathematics of Program Construction [MPC], Marseille, France, 15-18 July 2008. Berlin, Heidelberg: Springer Verlag. 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. 10th International Conference on Relational Methods in Computer Science/5th International Workshop on Applications of Kleene Algebra, Frauenworth Germany, 7 - 11 April 2008. Heidelberg, Germany: Springer. 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. 6th International Conference: IFM 2007 - Integrated Formal Methods, Oxford, U.K., 2-5 July 2007. Berlin, Germany: Springer-Verlag. 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. Ninth Australiasian Computing Education Conference (ACE 2007), Ballarat, Victoria, Australia, 30 January - 2 February, 2007. New South Wales, Australia: Australian Computer Society, Inc..

Continuous action system refinement

Meinicke, L. A. and Hayes, I. J. (2006). Continuous action system refinement. 8th International Conference on Mathematics of Program Construction (MPC 2006), Kuressaare, Estonia, 3-5 July 2006. Berlin, Germany: Springer-Verlag. doi: 10.1007/11783596_19

Reasoning algebraically about probabilistic loops

Meinicke, Larissa and Hayes, Ian J. (2006). Reasoning algebraically about probabilistic loops. 8th International Conference on Formal Engineering Methods, Macua, PR China, 1-3 November, 2006. Berlin, Germany: Springer-Verlag. 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.