Consistency of property specification patterns with boolean and constrained numerical signals

Property Specification Patterns (PSPs) have been proposed to solve recurring specification needs, to ease the formalization of requirements, and enable automated verification thereof. In this paper, we extend PSPs by considering Boolean as well as atomic numerical assertions. This extension enables us to reason about functional requirements which would not be captured by basic PSPs. We contribute an encoding from constrained PSPs to LTL formulae, and we show experimental results demonstrating that our approach scales on requirements of realistic size generated using a probabilistic model. Finally, we show that our extension enables us to prove (in)consistency of requirements about an embedded controller for a robotic manipulator

Poster: Automatic Consistency Checking of Requirements with ReqV

In the context of Requirements Engineering, checking the consistency of functional requirements is an important and still mostly open problem. In case of requirements written in natural language, the corresponding manual review is time consuming and error prone. On the other hand, automated consistency checking most often requires overburdening formalizations. In this paper we introduce REQV, a tool for formal consistency checking of requirements. The main goal of the tool is to provide an easy-to-use environment for the verification of requirements in Cyber-Physical Systems (CPS). REQV takes as input a set of requirements expressed in a structured natural language, translates them in a formal language and it checks their inner consistency. In case of failure, REQV can also extracts a minimal set of conflicting requirements to help designers in correcting the specification

Automatic segmentation of deep intracerebral electrodes in computed tomography scans

Background: Invasive monitoring of brain activity by means of intracerebral electrodes is widely practiced to improve pre-surgical seizure onset zone localization in patients with medically refractory seizures. Stereo-Electroencephalography (SEEG) is mainly used to localize the epileptogenic zone and a precise knowledge of the location of the electrodes is expected to facilitate the recordings interpretation and the planning of resective surgery. However, the localization of intracerebral electrodes on post-implant acquisitions is usually time-consuming (i.e., manual segmentation), it requires advanced 3D visualization tools, and it needs the supervision of trained medical doctors in order to minimize the errors. In this paper we propose an automated segmentation algorithm specifically designed to segment SEEG contacts from a thresholded post-implant Cone-Beam CT volume (0.4 mm, 0.4 mm, 0.8 mm). The algorithm relies on the planned position of target and entry points for each electrode as a first estimation of electrode axis. We implemented the proposed algorithm into DEETO, an open source C++ prototype based on ITK library. Results: We tested our implementation on a cohort of 28 subjects in total. The experimental analysis, carried out over a subset of 12 subjects (35 multilead electrodes; 200 contacts) manually segmented by experts, show that the algorithm: (i) is faster than manual segmentation (i.e., less than 1s/subject versus a few hours) (ii) is reliable, with an error of 0.5 mm +/- 0.06 mm, and (iii) it accurately maps SEEG implants to their anatomical regions improving the interpretability of electrophysiological traces for both clinical and research studies. Moreover, using the 28-subject cohort we show here that the algorithm is also robust (error <0.005 mm) against deep-brain displacements (<12 mm) of the implanted electrode shaft from those planned before surgery. Conclusions: Our method represents, to the best of our knowledge, the first automatic algorithm for the segmentation of SEEG electrodes. The method can be used to accurately identify the neuroanatomical loci of SEEG electrode contacts by a non-expert in a fast and reliable manner.Peer reviewe

Retrospective evaluation and SEEG trajectory analysis for interactive multi-trajectory planner assistant

Purpose: Focal epilepsy is a neurological disease that can be surgically treated by removing area of the brain generating the seizures. The stereotactic electroencephalography (SEEG) procedure allows patient brain activity to be recorded in order to localize the onset of seizures through the placement of intracranial electrodes. The planning phase can be cumbersome and very time consuming, and no quantitative information is provided to neurosurgeons regarding the safety and efficacy of their trajectories. In this work, we present a novel architecture specifically designed to ease the SEEG trajectory planning using the 3D Slicer platform as a basis. Methods: Trajectories are automatically optimized following criteria like vessel distance and insertion angle. Multi-trajectory optimization and conflict resolution are optimized through a selective brute force approach based on a conflict graph construction. Additionally, electrode-specific optimization constraints can be defined, and an advanced verification module allows neurosurgeons to evaluate the feasibility of the trajectory. Results: A retrospective evaluation was performed using manually planned trajectories on 20 patients: the planning algorithm optimized and improved trajectories in 98% of cases. We were able to resolve and optimize the remaining 2% by applying electrode-specific constraints based on manual planning values. In addition, we found that the global parameters used discards 68% of the manual planned trajectories, even when they represent a safe clinical choice. Conclusions: Our approach improved manual planned trajectories in 98% of cases in terms of quantitative indexes, even when applying more conservative criteria with respect to actual clinical practice. The improved multi-trajectory strategy overcomes the previous work limitations and allows electrode optimization within a tolerable time span

A new tool for touch-free patient registration for robot-assisted intracranial surgery: Application accuracy from a phantom study and a retrospective surgical series

OBJECTIVE The purpose of this study was to compare the accuracy of Neurolocate frameless registration system and frame-based registration for robotic stereoelectroencephalography (SEEG). METHODS The authors performed a 40-trajectory phantom laboratory study and a 127-trajectory retrospective analysis of a surgical series. The laboratory study was aimed at testing the noninferiority of the Neurolocate system. The analysis of the surgical series compared Neurolocate-based SEEG implantations with a frame-based historical control group. RESULTS The mean localization errors (LE) ± standard deviations (SD) for Neurolocate-based and frame-based trajectories were 0.67 ± 0.29 mm and 0.76 ± 0.34 mm, respectively, in the phantom study (p = 0.35). The median entry point LE was 0.59 mm (interquartile range [IQR] 0.25-0.88 mm) for Neurolocate-registration-based trajectories and 0.78 mm (IQR 0.49-1.08 mm) for frame-registration-based trajectories (p = 0.00002) in the clinical study. The median target point LE was 1.49 mm (IQR 1.06-2.4 mm) for Neurolocate-registration-based trajectories and 1.77 mm (IQR 1.25-2.5 mm) for frameregistration- based trajectories in the clinical study. All the surgical procedures were successful and uneventful. CONCLUSIONS The results of the phantom study demonstrate the noninferiority of Neurolocate frameless registration. The results of the retrospective surgical series analysis suggest that Neurolocate-based procedures can be more accurate than the frame-based ones. The safety profile of Neurolocate-based registration should be similar to that of frame-based registration. The Neurolocate system is comfortable, noninvasive, easy to use, and potentially faster than other registration devices

Verification Of Data-Intensive Embedded Systems

Verification of embedded software relying on black-box hardware is challenging whenever precise specifications of the underlying systems are incomplete or not available. Learning structured hardware models is a powerful enabler of verification in these cases, but it can be inefficient when the system to be learned is data-intensive rather than control-intensive. We contribute a methodology to attack this problem based on a specific class of automata which are well suited to model systems wherein data paths are known to be decoupled from control paths. We show the effectiveness of our approach by combining learning and verification to assess the correctness of embedded programs relying on FIFO register circuitry to control an elevator system