Programming and proving with classical types

The propositions-as-types correspondence is ordinarily presen- ted as linking the metatheory of typed λ-calculi and the proof theory of intuitionistic logic. Griffin observed that this correspondence could be extended to classical logic through the use of control operators. This observation set off a flurry of further research, leading to the development of Parigot’s λμ-calculus. In this work, we use the λμ-calculus as the foundation for a system of proof terms for classical first-order logic. In particular, we define an extended call-by-value λμ-calculus with a type system in correspondence with full classical logic. We extend the language with polymorphic types, add a host of data types in ‘direct style’, and prove several metatheoretical properties. All of our proofs and definitions are mechanised in Isabelle/HOL, and we automatically obtain an inter- preter for a system of proof terms cum programming language—called μML—using Isabelle’s code generation mechanism. Atop our proof terms, we build a prototype LCF-style interactive theorem prover—called μTP— for classical first-order logic, capable of synthesising μML programs from completed tactic-driven proofs. We present example closed μML programs with classical tautologies for types, including some inexpressible as closed programs in the original λμ-calculus, and some example tactic-driven μTP proofs of classical tautologies

Programmiersprachen und Rechenkonzepte

Seit 1984 veranstaltet die GI-Fachgruppe "Programmiersprachen und Rechenkonzepte", die aus den ehemaligen Fachgruppen 2.1.3 "Implementierung von Programmiersprachen" und 2.1.4 "Alternative Konzepte für Sprachen und Rechner" hervorgegangen ist, regelmäßig im Frühjahr einen Workshop im Physikzentrum Bad Honnef. Das Treffen dient in erster Linie dem gegenseitigen Kennenlernen, dem Erfahrungsaustausch, der Diskussion und der Vertiefung gegenseitiger Kontakte

An approach to impact analysis in software maintenance

Impact analysis is a software maintenance activity, which consists of determining the scope of a requested change, as a basis for planning and implementing it. After a change request has been specified (change understanding) and the initial part of the system to be changed has been identified (change localization), impact analysis helps to understand consequences of the change on other parts of the system. Induced changes, also named ripple effects, among software components are detected. Most existing approaches perform impact analysis for changes occurring at the code level. In this thesis, concepts developed to perform impact analysis at the code level are applied to trace changes occurring at the design level. The method consists of proposing an activity model addressing the different steps of impact analysis and a data model on which propagations of changes can be traced. The method is validated with a case study applied to a system from the aerospace field. The tools we developed on PCTE help for consistency checks in HOOD based designs during editing. Our data-model based on an Entity Relationship notation describes a way to model HOOD diagrams in PCTE and further on to propagate changes on the repository. Examples chosen address the design phase of a simple engine system. We show that addressing modifications at a higher level of abstraction than the code eases understanding and localization of changes. It also limits the propagation of ripple effects (i.e., unexpected behaviour of the system) by detecting secondary changes at an earlier stage

Correct-By-Construction Fault-Tolerant Control

Correct-by-construction control synthesis methods refer to a collection of model-based techniques to algorithmically generate controllers/strategies that make the systems satisfy some formal specifications. Such techniques attract much attention as they provide formal guarantees on the correctness of cyber-physical systems, where corner cases may arise due to the interaction among different modules. The controllers synthesized through such methods, however, may still malfunction due to faults, such as physical component failures and unexpected operating conditions, which lead to a sudden change of the system model. In these cases, we want to guarantee that the performance of the faulty system degrades gracefully, and hence achieve fault tolerance. This thesis is about 1) incorporating fault detection and detectability analysis algorithms in correct-by-construction control synthesis, 2) formalizing the graceful degradation specification for fault tolerant systems with temporal logic, and 3) developing algorithms to synthesize correct-by-construction controllers that achieve such graceful degradation, with possible delay in the fault detection. In particular, two sets of approaches from the temporal logic planning domain, i.e., abstraction-based synthesis and optimization-based path planning, are considered. First, for abstraction-based approaches, we propose a recursive algorithm to reduce the fault tolerant controller synthesis problem into multiple small synthesis problems with simpler specifications. Such recursive reduction leverages the structure of the fault propagation and hence avoids the high complexity of solving the problem monolithically as one general temporal logic game. Furthermore, by exploring the structural properties in the specifications, we show that, even when the fault is detected with delay, the problem can be solved by a similar recursive algorithm without constructing the belief space. Secondly, optimization-based path planning is considered. The proposed approach leverages the recently developed temporal logic encodings and state-of-art mixed integer programming (MIP) solvers. The novelty of this work is to enhance the open-loop strategy obtained through solving the MIP so that it can react contingently to faults and disturbance. Finally, the control synthesis techniques developed for discrete state systems is shown to be applicable to continuous states systems. This is demonstrated by fuel cell thermal management application. Particularly, to apply the abstraction-based synthesis methods to complex systems such as the fuel cell thermal management system, structural properties (e.g., mixed monotonicity) of the system are explored and leveraged to ease abstraction computation, and techniques are developed to improve the scalability of synthesis process whenever the system has a large number of control actions.PHDElectrical Engineering: SystemsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/155031/1/yliren_1.pd

A meta-language for systems architecting

Thesis (Ph. D.)--Massachusetts Institute of Technology, Engineering Systems Division, 2005.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Includes bibliographical references (leaves 164-168).(cont.) To demonstrate its practical value in large-scale engineering systems, the research applied OPN to two space exploration programs and one aircraft design problem. In our experiments, OPN was able to significantly change the modeling and architectural reasoning process by automating a number of manual model construction, manipulation, and simulation tasks.The aim of this research is to design an executable meta-language that supports system architects' modeling process by automating certain model construction, manipulation and simulation tasks. This language specifically addresses the needs in systematically communicating architects' intent with a wide range of stakeholders and to organize knowledge from various domains. Our investigation into existing architecting approaches and technologies has pointed out the need to develop a simple and intuitive, yet formal language, that expresses multiple layers of abstractions, provides reflexive knowledge about the models, mechanizes data exchange and manipulation, while allowing integration with legacy infrastructures. A small set of linguistic primitives, stateful objects and processes that transform them were identified as both required and sufficient building blocks of the meta-language, specified as an Object-Process Network (OPN). To demonstrate the applicability of OPN, a software environment has been developed and applied to define meta-models of large-scale complex system architectures such as space transportation systems. OPN provides three supporting aspects of architectural modeling. As a declarative language, OPN provides a diagrammatic formal language to help architects specify the space of architectural options. As an imperative language, OPN automates the process of creating architectural option instances and computes associated performance metrics for those instances. As a simulation language, OPN uses a function-algebraic model to subsume and compose discrete, continuous, and probabilistic events within one unified execution engine.by Hsueh-Yung Benjamin Koo.Ph.D

The literacy hypothesis and cognitive development

This thesis re-examines possible links between literacy and cognitive development from a medium perspective, where the child\u27s engagement in literacy is assumed to enable literacy-specific forms of thought, and where the explanation for the nature of those cognitive forms is to be sought in the examination of how the physical and semiotic properties of literacy modify the child\u27s symbolic interactions and thought. Specifically, I argue that the existing research suggests that at the onset of literacy the child acquires the ability for metalinguistic awareness. This can be explained by the fact that writing codifies speaking, thus turning words into objects of conscious reflection. I propose a reinterpretation of Piaget\u27s stage of concrete operations within the literacy framework. Further, I argue that metalinguistic awareness enables the emergence of verbal thought, which, after a period of differentiation from the concrete context, can function independently from concrete, perceptual reality. This, I suggest, leads to the achievement of what I call decontextualized thought, which I argue lies at the origins of Piaget\u27s formal operations. I outline several explanations for the emergence of decontextualized thought, and argue that the structural explanation, that writing codifies speaking and that phonetic writing characters are arbitrary with regards to the concrete image, is most central for the understanding of literacy effects. This thesis provides a critical overview of selected central contributors to the literacy hypothesis, addresses several most pressing controversies, and sketches a broader theoretical framework that places the literacy hypothesis within a constructivist framework that stresses the role of child\u27s activity. I suggest that literacy should be treated as an enabling and necessary but not sufficient factor for the emergence of literacy-specific cognitive forms, and that most past criticism of the literacy theory applies only to the \u27strong\u27 view of literacy as a sufficient cause. Because of the scarcity of direct research on literacy guided by the medium approach, much of the empirical research that I review requires reinterpretation. Hence, the current thesis is largely a hypothetical proposal of theoretical and empirical directions that the literacy hypothesis might take

Cooperative Communications inWireless Local Area Networks: MAC Protocol Design and Multi-layer Solutions

This dissertation addresses cooperative communications and proposes multi-layer solu- tions for wireless local area networks, focusing on cooperative MAC design. The coop- erative MAC design starts from CSMA/CA based wireless networks. Three key issues of cooperation from the MAC layer are dealt with: i.e., when to cooperate (opportunistic cooperation), whom to cooperate with (relay selection), and how to protect cooperative transmissions (message procedure design). In addition, a cooperative MAC protocol that addresses these three issues is proposed. The relay selection scheme is further optimized in a clustered network to solve the problem of high collision probability in a dense network. The performance of the proposed schemes is evaluated in terms of through- put, packet delivery rate and energy efficiency. Furthermore, the proposed protocol is verified through formal model checking using SPIN. Moreover, a cooperative code allo- cation scheme is proposed targeting at a clustered network where multiple relay nodes can transmit simultaneously. The cooperative communication design is then extended to the routing layer through cross layer routing metrics. Another part of the work aims at enabling concurrent transmissions using cooperative carrier sensing to improve the per- formance in a WLAN network with multiple access points sharing the same channel

A Summary of the Naval Postgraduate School Research Program, 1986

This report contains 227 summaries of research projects which were carried out under funding to the Naval Postgraduate School Research Program. This research was conducted under the areas of Computer Science, Mathematics, Administrative Sciences, Operations Research, National Security Affairs, Physics, Electrical and Computer Engineering, Meteorology, Aeronautics, Oceanography, and Mechanical Engineering. The table of contents identifies specific research topics.Approved for public release; distribution is unlimited

Reports to the President

A compilation of annual reports for the 1985-1986 academic year, including a report from the President of the Massachusetts Institute of Technology, as well as reports from the academic and administrative units of the Institute. The reports outline the year's goals, accomplishments, honors and awards, and future plans