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.
Implementing Feferman-Landin Logic. The objective of this project is to utilise computer based verification tools (such as PVS and Rewritting Logic) to develop a software engineering environment for specifying and verifying systems written in high-level programming languages such as Java, Scheme, and ML. The project will thus subtantially advance the use of formal computer based tools to develop reliable programs and specifications for life-critical systems. The project will also develop form ....Implementing Feferman-Landin Logic. The objective of this project is to utilise computer based verification tools (such as PVS and Rewritting Logic) to develop a software engineering environment for specifying and verifying systems written in high-level programming languages such as Java, Scheme, and ML. The project will thus subtantially advance the use of formal computer based tools to develop reliable programs and specifications for life-critical systems. The project will also develop formally
based interoperability between the PVS and Maude systems, two widely
used computer tools for reasoning about complex systems.Read moreRead less
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.
Foundations of Executable Temporal Logic. In many computer applications, including those of temporal reasoning, distributed computations and knowledge representations, the concept of time is of central importance. Multiple granularity of time also plays a critical role as not all events are necessarily defined over a uniform model of time. This project will develop the foundations of executable logical representations, supporting multiple granularity of time. This will allow system developers a ....Foundations of Executable Temporal Logic. In many computer applications, including those of temporal reasoning, distributed computations and knowledge representations, the concept of time is of central importance. Multiple granularity of time also plays a critical role as not all events are necessarily defined over a uniform model of time. This project will develop the foundations of executable logical representations, supporting multiple granularity of time. This will allow system developers access to powerful logical techniques in those applications. In the process, fundamental problems in modelling multiple granularity of time will be identified, and application-independent solutions to those problems will be provided.Read moreRead less