| This paper presents a new timing analysis algorithm for eecient state space exploration during the synthesis of timed circuits or the veriication of timed systems. The source of the computational complexity in the synthesis or veriication of a timed system is in nding the reachable timed state space. We introduce a new algorithm which utilizes geometric regions to represent the timed state sp...

Even relatively simple code analysis can be a daunting task for many first year students. Perceived complexity, coupled with foreign and harsh syntax, often outstrips the ability for students to take in what they are seeing in terms of their verbal memory. That is, first year students often lack the experience to encode critical building blocks in source code, and their interrelationships, into...

The aim of this study was to perform a systematic review of the scientific literature on handball match analysis and to identify potential research areas for future work. Data were collected from Web of Science, MEDLINE, SPORTDiscus, Scopus, EBSCO, and ProQuest databases. The initial search found 148 journal articles. Only the papers focused on handball match analysis regarding tactical and tec...

The study of pathological changes of bone is an important task in diagnostic procedures of patients with metabolic bone diseases such as osteoporosis as well as in monitoring the health state of astronauts during long-term space flights. The recent availability of high-resolution three-dimensional (3D) imaging of bone challenges the development of data analysis techniques able to assess changes...

In this paper, we show how thread partitioning helps in proving properties of mobile systems. Thread partitioning consists in gathering the threads of a mobile system into several classes. The partitioning criterion is left as a parameter of both the mobility model and the properties we are interested in. Then, we design a polynomial time abstract interpretationbased static analysis that counts...

A workflow specification defines sets of steps and users. An authorization policy determines for each user a subset of steps the user is allowed to perform. Other security requirements, such as separation-of-duty, impose constraints on which subsets of users may perform certain subsets of steps. The workflow satisfiability problem (WSP) is the problem of determining whether there exists an assi...

The key parameters of Cerenkov Correlated Timing (CCT) detectors are discussed. Measurements of radiator geometry, optical properties of radiator and coupling materials, and photon detector timing performance are presented.

The capability calculus is a framework for statically reasoning about program resources such as deallocatable memory regions. Fractional capabilities, originally proposed by Boyland for checking the determinism of parallel reads in multi-thread programs, extend the capability calculus by extending the capabilities to range over the rational numbers. Fractional capabilities have since found nume...

Disuniication is the problem of deciding satissability of a system of equations and dise-quations with respect to a given equational theory. In this paper we study the disuniication problem in the context of ACI1 equational theories. This problem is of great importance, for instance, for the development of constraint solvers over sets. Its solution opens new possibilities for developing automat...

The Process Hitting is a recently introduced framework designed for the modelling of concurrent systems. Its originality lies in a compact representation of both components of the model and its corresponding actions: each action can modify the status of a component, and is conditioned by the status of at most one other component. This allowed to define very efficient static analysis based on lo...