05431 Abstracts Collection -- Deduction and Applications

From 23.10.05 to 28.10.05, the Dagstuhl Seminar 05431 ``Deduction and Applications\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Synthesis Of Distributed Protocols From Scenarios And Specifications

Distributed protocols, typically expressed as stateful agents communicating asynchronously over buffered communication channels, are difficult to design correctly. This difficulty has spurred decades of research in the area of automated model-checking algorithms. In turn, practical implementations of model-checking algorithms have enabled protocol developers to prove the correctness of such distributed protocols. However, model-checking techniques are only marginally useful during the actual development of such protocols; typically as a debugging aid once a reasonably complete version of the protocol has already been developed. The actual development process itself is often tedious and requires the designer to reason about complex interactions arising out of concurrency and asynchrony inherent to such protocols. In this dissertation we describe program synthesis techniques which can be applied as an enabling technology to ease the task of developing such protocols. Specifically, the programmer provides a natural, but incomplete description of the protocol in an intuitive representation — such as scenarios or an incomplete protocol. This description specifies the behavior of the protocol in the common cases. The programmer also specifies a set of high-level formal requirements that a correct protocol is expected to satisfy. These requirements can include safety requirements as well as liveness requirements in the form of Linear Temporal Logic (LTL) formulas. We describe techniques to synthesize a correct protocol which is consistent with the common-case behavior specified by the programmer and also satisfies the high-level safety and liveness requirements set forth by the programmer. We also describe techniques for program synthesis in general, which serve to enable the solutions to distributed protocol synthesis that this dissertation explores

Creating awareness of kinaesthetic learning using the Experience API: current practices, emerging challenges, possible solutions

We describe our use of the Experience API in preparing blue-collar workers for three frequently arising work contexts, including, for example, the requirement to perform maintenance tasks exactly as specified, consistently, quickly, and without error. We provide some theoretical underpinning for modifying and updating the API to remain useful in near-future training scenarios, such as having a shorter time allowed for kinaesthetic learning experiences than in traditional apprenticeships or training. We propose ways to involve a wide range of stakeholders in appraising the API and ensuring that any enhancements to it, or add-ons, are useful, feasible and compatible with current TEL practices and tools, such as learning-design modelling languages

Introduction to Loop Quantum Gravity

This article is based on the opening lecture at the third quantum geometry and quantum gravity school sponsored by the European Science Foundation and held at Zakopane, Poland in March 2011. The goal of the lecture was to present a broad perspective on loop quantum gravity for young researchers. The first part is addressed to beginning students and the second to young researchers who are already working in quantum gravity.Comment: 30 pages, 2 figures. arXiv admin note: substantial text overlap with arXiv:gr-qc/041005

Formal Verification of the AAMP-FV Microcode

This report describes the experiences of Collins Avionics & Communications and SRI International in formally specifying and verifying the microcode in a Rockwell proprietary microprocessor, the AAMP-FV, using the PVS verification system. This project built extensively on earlier experiences using PVS to verify the microcode in the AAMP5, a complex, pipelined microprocessor designed for use in avionics displays and global positioning systems. While the AAMP5 experiment demonstrated the technical feasibility of formal verification of microcode, the steep learning curve encountered left unanswered the question of whether it could be performed at reasonable cost. The AAMP-FV project was conducted to determine whether the experience gained on the AAMP5 project could be used to make formal verification of microcode cost effective for safety-critical and high volume devices

From General Relativity to Quantum Gravity

In general relativity (GR), spacetime geometry is no longer just a background arena but a physical and dynamical entity with its own degrees of freedom. We present an overview of approaches to quantum gravity in which this central feature of GR is at the forefront. However, the short distance dynamics in the quantum theory are quite different from those of GR and classical spacetimes and gravitons emerge only in a suitable limit. Our emphasis is on communicating the key strategies, the main results and open issues. In the spirit of this volume, we focus on a few avenues that have led to the most significant advances over the past 2-3 decades.Comment: To appear in \emph{General Relativity and Gravitation: A Centennial Survey}, commissioned by the International Society for General Relativity and Gravitation and to be published by Cambridge University Press. Abhay Ashtekar served as the `coordinating author' and combined the three contribution