Amortised resource analysis with separation logic

Type-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete resource bounds for functional programs, with good support for inference. In this work we translate the idea of amortised resource analysis to imperative languages by embedding a logic of resources, based on Bunched Implications, within Separation Logic. The Separation Logic component allows us to assert the presence and shape of mutable data structures on the heap, while the resource component allows us to state the resources associated with each member of the structure. We present the logic on a small imperative language with procedures and mutable heap, based on Java bytecode. We have formalised the logic within the Coq proof assistant and extracted a certified verification condition generator. We demonstrate the logic on some examples, including proving termination of in-place list reversal on lists with cyclic tails

Towards a canonical classical natural deduction system

This paper studies a new classical natural deduction system, presented as a typed calculus named \lml. It is designed to be isomorphic to Curien-Herbelin's calculus, both at the level of proofs and reduction, and the isomorphism is based on the correct correspondence between cut (resp. left-introduction) in sequent calculus, and substitution (resp. elimination) in natural deduction. It is a combination of Parigot's $\lambda\mu$-calculus with the idea of ``coercion calculus'' due to Cervesato-Pfenning, accommodating let-expressions in a surprising way: they expand Parigot's syntactic class of named terms. This calculus aims to be the simultaneous answer to three problems. The first problem is the lack of a canonical natural deduction system for classical logic. \lml is not yet another classical calculus, but rather a canonical reflection in natural deduction of the impeccable treatment of classical logic by sequent calculus. The second problem is the lack of a formalization of the usual semantics of Curien-Herbelin's calculus, that explains co-terms and cuts as, respectively, contexts and hole-filling instructions. The mentioned isomorphism is the required formalization, based on the precise notions of context and hole-expression offered by \lml. The third problem is the lack of a robust process of ``read-back'' into natural deduction syntax of calculi in the sequent calculus format, that affects mainly the recent proof-theoretic efforts of derivation of $\lambda$-calculi for call-by-value. An isomorphic counterpart to the $Q$-subsystem of Curien-Herbelin's-calculus is derived, obtaining a new $\lambda$-calculus for call-by-value, combining control and let-expressions.Fundação para a Ciência e a Tecnologia (FCT

Structuring an event ontology for disease outbreak detection

<p>Abstract</p> <p>Background</p> <p>This paper describes the design of an event ontology being developed for application in the machine understanding of infectious disease-related events reported in natural language text. This event ontology is designed to support timely detection of disease outbreaks and rapid judgment of their alerting status by 1) bridging a gap between layman's language used in disease outbreak reports and public health experts' deep knowledge, and 2) making multi-lingual information available.</p> <p>Construction and content</p> <p>This event ontology integrates a model of experts' knowledge for disease surveillance, and at the same time sets of linguistic expressions which denote disease-related events, and formal definitions of events. In this ontology, rather general event classes, which are suitable for application to language-oriented tasks such as recognition of event expressions, are placed on the upper-level, and more specific events of the experts' interest are in the lower level. Each class is related to other classes which represent participants of events, and linked with multi-lingual synonym sets and axioms.</p> <p>Conclusions</p> <p>We consider that the design of the event ontology and the methodology introduced in this paper are applicable to other domains which require integration of natural language information and machine support for experts to assess them. The first version of the ontology, with about 40 concepts, will be available in March 2008.</p

Two-way converter between the HL7 aECG and SCP-ECG data formats using BioSig

This paper presents an effort launched in 2006 by the OpenECG network, led by the Graz University of Technology and supported by IFEE 1073, ISO 11073 and CEN TC251 to create a two-way, converter in C++ between the SCP-ECG and the HL7 aECG standards. In the conversion, GDF, the BioSig internal data format, was used as an intermediate structure. This design approach allowed people with different expertise to be involved in the implementation of the converter. ECG data sets from the OpenECG portal were used to test the converter. However, some data mapping problems were identified. In fact, the SCP-ECG standard includes clinical data of the patient such as blood pressure, weight, and height, etc, which are not part of the HL7 aECG standard. Moreover, the annotations of HL7 aECG can be translated to GDF events, but, currently the only way SCP-ECG might support HL7 aECG annotations or GDF events is by using custom togs or sections. The first version of the converter has been released in open source to be tested by the BioSig and OpenECG communities. Some data mapping issues remain open in this first release. However, it is the expectation of the OpenECG community that they will be addressed in the collaboration among the relevant Standard Developing Organizations as a critical step towards the improvement of interoperability in electrocardiography