Discovery Early Career Researcher Award - Grant ID: DE130100292
Funder
Australian Research Council
Funding Amount
$285,000.00
Summary
Towards a stronger proof system for combinatorial optimisation. Combinatorial optimisation problems such as staff rostering, vehicle routing or resource allocation are central to the efficiency of many businesses and industries. This project will improve optimisation technology by using the low-level structure of the problems to find better solutions. This will save time, money and reduce environmental impact.
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.
Efficient multi-context systems for heterogeneous information reasoning and sharing. This project aims to investigate formal models and efficient methods for processing information from heterogeneous sources such as the World Wide Web. When the project is successfully completed, new theories, technologies and systems for reasoning about heterogeneous knowledge bases will be developed.
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.
Symbolic synthesis of knowledge-based program implementations. Systems with concurrent streams of activity are ubiquitous in computer hardware and software designs, but are conceptually complex, and fraught with faults and inefficiency. The project aims to address these difficulties by automating aspects of system design, to relieve the designer of the need to reason about complex patterns of information flow.
Generalised topological spaces. Pure mathematics creates abstractions of real-world entities; one such is the idea of a 'topological space', which abstracts from geometric forms like cubes and toruses. But topological spaces fail to capture geometric structures arising in areas like quantum physics; and this project seeks to rectify this, by developing a new more general notion.
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
Verification of quantum cryptographic protocols: a process algebra approach. Security analysis of quantum cryptographic systems is notoriously difficult. This project aims to develop theoretic foundations and algorithms, as well as efficient software tools, to verify quantum cryptographic protocols by innovatively bridging two research fields: quantum cryptography and quantum process algebra. The pioneering research may provide innovative, game-changing security technologies for banks, business, ....Verification of quantum cryptographic protocols: a process algebra approach. Security analysis of quantum cryptographic systems is notoriously difficult. This project aims to develop theoretic foundations and algorithms, as well as efficient software tools, to verify quantum cryptographic protocols by innovatively bridging two research fields: quantum cryptography and quantum process algebra. The pioneering research may provide innovative, game-changing security technologies for banks, business, finance, security industry, police, and counter-terrorism both within Australia and globally.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.