Parental evaluation of a telemonitoring service for children with Type 1 Diabetes

Introduction In the past years, we developed a telemonitoring service for young patients affected by Type 1 Diabetes. That service provides data to the clinical staff and offers an important tool to the parents, that are able to oversee in real time their children. The aim of this work was to analyze the parents' perceived usefulness of the service. Methods The service was tested by the parents of 31 children enrolled in a seven-day clinical trial during a summer camp. To study the parents' perception we proposed and analyzed two questionnaires. A baseline questionnaire focused on the daily management and implications of their children's diabetes, while a post-study one measured the perceived benefits of telemonitoring. Questionnaires also included free text comment spaces. Results Analysis of the baseline questionnaires underlined the parents' suffering and fatigue: 51% of total responses showed a negative tendency and the mean value of the perceived quality of life was 64.13 in a 0-100 scale. In the post-study questionnaires about half of the parents believed in a possible improvement adopting telemonitoring. Moreover, the foreseen improvement in quality of life was significant, increasing from 64.13 to 78.39 ( p-value\u2009=\u20090.0001). The analysis of free text comments highlighted an improvement in mood, and parents' commitment was also proved by their willingness to pay for the service (median\u2009=\u2009200\u2009euro/year). Discussion A high number of parents appreciated the telemonitoring service and were confident that it could improve communication with physicians as well as the family's own peace of mind

Екатеринбургская неделя. 1883. № 50

This is the author’s accepted manuscript. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-24364-6_12.acmid: 2050798 location: Saarbrücken, Germany numpages: 16acmid: 2050798 location: Saarbrücken, Germany numpages: 1

Quantifier-Free Interpolation of a Theory of Arrays

The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifier- free interpolants in general. In this paper, we show that it is possible to obtain quantifier-free interpolants for a Skolemized version of the extensional theory of arrays. We prove this in two ways: (1) non-constructively, by using the model theoretic notion of amalgamation, which is known to be equivalent to admit quantifier-free interpolation for universal theories; and (2) constructively, by designing an interpolating procedure, based on solving equations between array updates. (Interestingly, rewriting techniques are used in the key steps of the solver and its proof of correctness.) To the best of our knowledge, this is the first successful attempt of computing quantifier- free interpolants for a variant of the theory of arrays with extensionality

Efficient Interpolation for the Theory of Arrays

Existing techniques for Craig interpolation for the quantifier-free fragment of the theory of arrays are inefficient for computing sequence and tree interpolants: the solver needs to run for every partitioning $(A, B)$ of the interpolation problem to avoid creating $AB$-mixed terms. We present a new approach using Proof Tree Preserving Interpolation and an array solver based on Weak Equivalence on Arrays. We give an interpolation algorithm for the lemmas produced by the array solver. The computed interpolants have worst-case exponential size for extensionality lemmas and worst-case quadratic size otherwise. We show that these bounds are strict in the sense that there are lemmas with no smaller interpolants. We implemented the algorithm and show that the produced interpolants are useful to prove memory safety for C programs.Comment: long version of the paper at IJCAR 201

Satisfiability Checking and Symbolic Computation

Symbolic Computation and Satisfiability Checking are viewed as individual research areas, but they share common interests in the development, implementation and application of decision procedures for arithmetic theories. Despite these commonalities, the two communities are currently only weakly connected. We introduce a new project SC-square to build a joint community in this area, supported by a newly accepted EU (H2020-FETOPEN-CSA) project of the same name. We aim to strengthen the connection between these communities by creating common platforms, initiating interaction and exchange, identifying common challenges, and developing a common roadmap. This abstract and accompanying poster describes the motivation and aims for the project, and reports on the first activities.Comment: 3 page Extended Abstract to accompany an ISSAC 2016 poster. Poster available at http://www.sc-square.org/SC2-AnnouncementPoster.pd