High transconductance organic electrochemical transistors.

The development of transistors with high gain is essential for applications ranging from switching elements and drivers to transducers for chemical and biological sensing. Organic transistors have become well-established based on their distinct advantages, including ease of fabrication, synthetic freedom for chemical functionalization, and the ability to take on unique form factors. These devices, however, are largely viewed as belonging to the low-end of the performance spectrum. Here we present organic electrochemical transistors with a transconductance in the mS range, outperforming transistors from both traditional and emerging semiconductors. The transconductance of these devices remains fairly constant from DC up to a frequency of the order of 1 kHz, a value determined by the process of ion transport between the electrolyte and the channel. These devices, which continue to work even after being crumpled, are predicted to be highly relevant as transducers in biosensing applications

In vivo recordings of brain activity using organic transistors.

In vivo electrophysiological recordings of neuronal circuits are necessary for diagnostic purposes and for brain-machine interfaces. Organic electronic devices constitute a promising candidate because of their mechanical flexibility and biocompatibility. Here we demonstrate the engineering of an organic electrochemical transistor embedded in an ultrathin organic film designed to record electrophysiological signals on the surface of the brain. The device, tested in vivo on epileptiform discharges, displayed superior signal-to-noise ratio due to local amplification compared with surface electrodes. The organic transistor was able to record on the surface low-amplitude brain activities, which were poorly resolved with surface electrodes. This study introduces a new class of biocompatible, highly flexible devices for recording brain activity with superior signal-to-noise ratio that hold great promise for medical applications

Rich Counter-Examples for Temporal-Epistemic Logic Model Checking

Model checking verifies that a model of a system satisfies a given property, and otherwise produces a counter-example explaining the violation. The verified properties are formally expressed in temporal logics. Some temporal logics, such as CTL, are branching: they allow to express facts about the whole computation tree of the model, rather than on each single linear computation. This branching aspect is even more critical when dealing with multi-modal logics, i.e. logics expressing facts about systems with several transition relations. A prominent example is CTLK, a logic that reasons about temporal and epistemic properties of multi-agent systems. In general, model checkers produce linear counter-examples for failed properties, composed of a single computation path of the model. But some branching properties are only poorly and partially explained by a linear counter-example. This paper proposes richer counter-example structures called tree-like annotated counter-examples (TLACEs), for properties in Action-Restricted CTL (ARCTL), an extension of CTL quantifying paths restricted in terms of actions labeling transitions of the model. These counter-examples have a branching structure that supports more complete description of property violations. Elements of these counter-examples are annotated with parts of the property to give a better understanding of their structure. Visualization and browsing of these richer counter-examples become a critical issue, as the number of branches and states can grow exponentially for deeply-nested properties. This paper formally defines the structure of TLACEs, characterizes adequate counter-examples w.r.t. models and failed properties, and gives a generation algorithm for ARCTL properties. It also illustrates the approach with examples in CTLK, using a reduction of CTLK to ARCTL. The proposed approach has been implemented, first by extending the NuSMV model checker to generate and export branching counter-examples, secondly by providing an interactive graphical interface to visualize and browse them.Comment: In Proceedings IWIGP 2012, arXiv:1202.422

Intervention in acute coronary syndromes:do patients undergo intervention on the basis of their risk characteristics? The Global Registry of Acute Coronary Events (GRACE)

OBJECTIVE: To determine whether revascularisation is more likely to be performed in higher-risk patients and whether the findings are influenced by hospitals adopting more or less aggressive revascularisation strategies. METHODS: GRACE (Global Registry of Acute Coronary Events) is a multinational, observational cohort study. This study involved 24,189 patients enrolled at 73 hospitals with on-site angiographic facilities. RESULTS: Overall, 32.5% of patients with a non-ST elevation acute coronary syndrome (ACS) underwent percutaneous coronary intervention (PCI; 53.7% in ST segment elevation myocardial infarction (STEMI)) and 7.2% underwent coronary artery bypass grafting (CABG; 4.0% in STEMI). The cumulative rate of in-hospital death rose correspondingly with the GRACE risk score (variables: age, Killip class, systolic blood pressure, ST segment deviation, cardiac arrest at admission, serum creatinine, raised cardiac markers, heart rate), from 1.2% in low-risk to 3.3% in medium-risk and 13.0% in high-risk patients (c statistic = 0.83). PCI procedures were more likely to be performed in low- (40% non-STEMI, 60% STEMI) than medium- (35%, 54%) or high-risk patients (25%, 41%). No such gradient was apparent for patients undergoing CABG. These findings were seen in STEMI and non-ST elevation ACS, in all geographical regions and irrespective of whether hospitals adopted low (4.2-33.7%, n = 7210 observations), medium (35.7-51.4%, n = 7913 observations) or high rates (52.6-77.0%, n = 8942 observations) of intervention. CONCLUSIONS: A risk-averse strategy to angiography appears to be widely adopted. Proceeding to PCI relates to referral practice and angiographic findings rather than the patient\u27s risk status. Systematic and accurate risk stratification may allow higher-risk patients to be selected for revascularisation procedures, in contrast to current international practice

Implicit and explicit body representations

Several forms of perception require that sensory information be referenced to representations of the size and shape of the body. This requirement is especially acute in somatosensation in which the main receptor surface (i.e., the skin) is itself coextensive with the body. In this paper I will review recent research investigating the body representations underlying somatosensory information processing, including abilities such as tactile localisation, tactile size perception, and position sense. These representations show remarkably large and stereotyped distortions of represented body size and shape. Intriguingly, these distortions appear to mirror distortions characteristic of somatosensory maps, though in attenuated form. In contrast, when asked to make overt judgments about perceived body form, participants are generally quite accurate. This pattern of results suggests that higher-level somatosensory processing relies on a class of implicit body representation, distinct from the conscious body image. I discuss the implications of these results for understanding the nature of body representation and the factors which influence it

Model Checking Boot Code from AWS Data Centers

This paper describes our experience with symbolic model checking in an industrial setting. We have proved that the initial boot code running in data centers at Amazon Web Services is memory safe, an essential step in establishing the security of any data center. Standard static analysis tools cannot be easily used on boot code without modification owing to issues not commonly found in higher-level code, including memory-mapped device interfaces, byte-level memory access, and linker scripts. This paper describes automated solutions to these issues and their implementation in the C Bounded Model Checker (CBMC). CBMC is now the first source-level static analysis tool to extract the memory layout described in a linker script for use in its analysis

Multivariant Assertion-based Guidance in Abstract Interpretation

Approximations during program analysis are a necessary evil, as they ensure essential properties, such as soundness and termination of the analysis, but they also imply not always producing useful results. Automatic techniques have been studied to prevent precision loss, typically at the expense of larger resource consumption. In both cases (i.e., when analysis produces inaccurate results and when resource consumption is too high), it is necessary to have some means for users to provide information to guide analysis and thus improve precision and/or performance. We present techniques for supporting within an abstract interpretation framework a rich set of assertions that can deal with multivariance/context-sensitivity, and can handle different run-time semantics for those assertions that cannot be discharged at compile time. We show how the proposed approach can be applied to both improving precision and accelerating analysis. We also provide some formal results on the effects of such assertions on the analysis results.Comment: Pre-proceedings paper presented at the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018), Frankfurt am Main, Germany, 4-6 September 2018 (arXiv:1808.03326

Witness and Counterexample Automata for ACTL

Abstract. Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path along the model of the system. However, a single computation path is not enough to explain all reasons of a validity or a failure. Our work in this area is motivated by the application of action-based model checking algorithms to the test case generation for models formally specified with a CCS-like process algebra. There, only linear and finite witnesses and counterexamples are useful and for the given formula and model an efficient representation of the set of witnesses (counterexamples) explaining all reasons of validity (failure) is needed. This paper identifies a fragment of action computation tree logic (ACTL) that can be handled in this way. Moreover, a suitable form of witnesses and counterexamples is proposed and witness and counterex-ample automata are introduced, which are finite automata recognizing them. An algorithm for generating such automata is given.