Process algebra approach to distributed quantum computation and secure quantum communication. This project will develop effective methods for reasoning about the behaviours of distributed quantum computing and communicating systems. The developed methods will provide effective techniques for verifying security of quantum cryptographic protocols.
Relaxed correctness criteria for modern multi-core architectures. This project seeks to lay groundwork for fully exploiting the potential of multicore computers. Multicore computers have become ubiquitous over the last decade, now being standard in everything from laptops to mobile phones. Their benefits are clear – better performance leading to more sophisticated applications. Key to ensuring those benefits are complex, and often subtle, algorithms that exploit the parallelism that multicore co ....Relaxed correctness criteria for modern multi-core architectures. This project seeks to lay groundwork for fully exploiting the potential of multicore computers. Multicore computers have become ubiquitous over the last decade, now being standard in everything from laptops to mobile phones. Their benefits are clear – better performance leading to more sophisticated applications. Key to ensuring those benefits are complex, and often subtle, algorithms that exploit the parallelism that multicore computers offer. This project aims to lay foundations for extending those benefits to applications where high reliability is a concern. It plans to do so by developing theoretical results about the correctness of algorithms on standard multicore computers, and practical tools and techniques to help programmers of multicore computers to better understand the behaviour of their code.Read moreRead less
Model-checking quantum Markov chains: towards verification techniques for quantum cryptographic systems. This project will develop effective techniques and practical tools for verification of correctness, safety and reliability of quantum cryptographic protocols and communication systems. It will promote Australia's global standing in quantum computing research and provide frontier technology to industry and governments nationally and internationally.
Geodetic groups: foundational problems in algebra and computer science. The project aims to resolve important and longstanding open problems in Geometric Group Theory and Theoretical Computer Science. Since the 1980s researchers have conjectured that the geometric property of being geodetic is equivalent to several purely algebraic, algorithmic, and language-theoretic characterisations.
The project team's expertise in geodesic properties of groups, the interaction between formal languages and g ....Geodetic groups: foundational problems in algebra and computer science. The project aims to resolve important and longstanding open problems in Geometric Group Theory and Theoretical Computer Science. Since the 1980s researchers have conjectured that the geometric property of being geodetic is equivalent to several purely algebraic, algorithmic, and language-theoretic characterisations.
The project team's expertise in geodesic properties of groups, the interaction between formal languages and groups, and the theory of rewriting systems, together with recent breakthroughs by the team ensures that significant results can be expected.
Benefits include training research students and postdoctoral researchers in cutting-edge techniques, and advancing fundamental knowledge in mathematics and computer science.Read moreRead less
Artificial intelligence meets wireless sensor networks: filling the gaps between sensors using spatial reasoning. Monitoring potential disaster regions and integrating available information with expert knowledge can prevent disasters and save many lives. The outcome of our project is one of the key components for intelligent systems that can autonomously monitor the environment, make the correct inferences and issue appropriate warnings and recommendations.
Machine-checked Foundations for Verified Vote Counting. The project will deliver a general methodology for developing formal logical specifications of the Acts of Parliament for many common systems for counting votes in preferential elections. The project will deliver corresponding computer programs to count votes according to these systems and will deliver formal independently checkable proofs that the programs meet their specification. Such formally verified computer programs provide a legally ....Machine-checked Foundations for Verified Vote Counting. The project will deliver a general methodology for developing formal logical specifications of the Acts of Parliament for many common systems for counting votes in preferential elections. The project will deliver corresponding computer programs to count votes according to these systems and will deliver formal independently checkable proofs that the programs meet their specification. Such formally verified computer programs provide a legally sound basis for counting votes by computer. The methodology will also allow electoral commissioners to improve the natural language descriptions of the relevant Acts of Parliament which are often woefully out of date with current practice.Read moreRead less
The language complexity of problems in algebra and logic. This project focuses on a major problem at the intersection of algebra, logic and computer science, concerning equations over free groups and free monoids. Expected outcomes include a language-theoretic characterisation of solutions of equations in a wide class of groups and monoids, a language-theoretic understanding of the existential and first-order theories of free groups, and a classification of groups with indexed multiplication tab ....The language complexity of problems in algebra and logic. This project focuses on a major problem at the intersection of algebra, logic and computer science, concerning equations over free groups and free monoids. Expected outcomes include a language-theoretic characterisation of solutions of equations in a wide class of groups and monoids, a language-theoretic understanding of the existential and first-order theories of free groups, and a classification of groups with indexed multiplication tables and EDT0L word problem. The project is designed to expand the frontiers of knowledge in theoretical computer science and pure mathematics, but in the longer term to deepen our understanding of computers, their computational power and intrinsic limitations.Read moreRead less
Geodetic groups: foundational problems in algebra and computer science. The project aims to resolve important and longstanding open problems in Geometric Group Theory and Theoretical Computer Science. Since the 1980s researchers have conjectured that the geometric property of being geodetic is equivalent to several purely algebraic, algorithmic, and language-theoretic characterisations.
The project team's expertise in geodesic properties of groups, the interaction between formal languages and g ....Geodetic groups: foundational problems in algebra and computer science. The project aims to resolve important and longstanding open problems in Geometric Group Theory and Theoretical Computer Science. Since the 1980s researchers have conjectured that the geometric property of being geodetic is equivalent to several purely algebraic, algorithmic, and language-theoretic characterisations.
The project team's expertise in geodesic properties of groups, the interaction between formal languages and groups, and the theory of rewriting systems, together with recent breakthroughs by the team ensures that significant results can be expected.
Benefits include training research students and postdoctoral researchers in cutting-edge techniques, and advancing fundamental knowledge in mathematics and computer science.Read moreRead less
Structure of relations: algebra and applications. Relations and relational structures form the fundamental mathematical essence required for studying computational problems and computational systems. This project will provide new algebraic methods for solving old problems in the theory of relations, informing our understanding of computational complexity and the nature of computing.
Design and verification of correct, efficient and secure concurrent systems. This project aims to provide methods for the design and verification of correct, secure and efficient concurrent software that are scalable and mechanised. Computers with multiple processors are now the norm and are used in a wide range of safety, security and mission critical software applications such as transport, health and infrastructure. These multi-core architectures have the potential to lead to important effici ....Design and verification of correct, efficient and secure concurrent systems. This project aims to provide methods for the design and verification of correct, secure and efficient concurrent software that are scalable and mechanised. Computers with multiple processors are now the norm and are used in a wide range of safety, security and mission critical software applications such as transport, health and infrastructure. These multi-core architectures have the potential to lead to important efficiency gains, but can introduce complex and error-prone behaviours that cannot be managed using traditional software development approaches. This project will produce better, scalable and mechanised methods for the design and verification of such software which is expected to reduce the prevalence of failures in efficient, modern software.Read moreRead less