pinecone/core-2020-05-10-deduplication huggingface dataset:
A Model Checking Approach for Verifying COWS Specifications

We introduce a logical verification framework for checking functional properties of service-oriented applications formally specified using the service specification language COWS. The properties are described by means of SocL, a logic specifically designed to capture peculiar aspects of services. Service behaviours are abstracted in terms of Doubly Labelled Transition Systems, which are used as the interpretation domain for SocL formulae. We also illustrate the SocL model checker at work on a bank service scenario specified in COWS
An automatic verifier for Java-like programs based on dynamic frames

Data abstraction is crucial in the construction of modular programs, since it ensures that internal changes in one module do not propagate to other modules. In object-oriented programs, classes typically enforce data abstraction by providing access to their internal state only through methods. By using method calls in method contracts, data abstraction can be extended to specifications. In this paper, methods used for this purpose must be side-effect free, and are called pure methods. 
We present an approach to the automatic verification of object- oriented programs that use pure methods for data abstraction. The cornerstone of our approach is the solution to the framing problem, i.e. client code must be able to determine whether state changes affect the return values of pure methods. More specifically, we extend each method contract with a method footprint, an upper bound on the memory locations read or written by the corresponding method. Footprints are specified using dynamic frames, special pure methods that return sets of memory locations. Thanks to this abstraction, implementations can evolve independently from specifications, loosely coupled only by pure functions. 
We implemented this approach in a custom build of the Spec# program verifier, and used it to automatically verify several challenging programs, including the iterator and observer patterns. The verifier itself and the examples shown in this paper can be downloaded from the authors’ homepage [1].status: publishe
A Domain Analysis to Specify Design Defects and Generate Detection Algorithms

International audienceQuality experts often need to identify in software systems design defects, which are recurring design problems, that hinder development and maintenance. Consequently, several defect detection approaches and tools have been proposed in the literature. However, we are not aware of any approach that defines and reifies the process of generating detection algorithms from the existing textual descriptions of defects. In this paper, we introduce an approach to automate the generation of detection algorithms from specifications written using a domain-specific language. The domain-specific is defined from a thorough domain analysis. We specify several design defects, generate automatically detection algorithms using templates, and validate the generated detection algorithms in terms of precision and recall on Xerces v2.7.0, an open-source object-oriented system
An Algebraic Semantics for MOF

This is the author’s final draft of the paper published as Lecture Notes in Computer Science, 2008, 4961, pp. 377-391.  The final published version is available at http://www.springerlink.com, Doi: 10.1007/978-3-540-78743-3_28.Model-driven development is a field within software engineering in which software artifacts are represented as models in order\ud
to improve productivity, quality, and cost effectiveness. In this field, the Meta-Object Facility (MOF) standard plays a crucial role by providing a generic framework where the abstract syntax of different modeling languages can be defined. In this work, we present a formal, algebraic semantics of the MOF standard in membership equational logic (mel). By using the Maude language, which directly supports mel specifications, this formal semantics is furthermore executable, and can be used to perform useful formal analyses. The executable algebraic framework for MOF obtained this way has been integrated within the Eclipse Modeling Framework as a plugin. In this way, formal analyses, such as semantic consistency checks, become available within Eclipse to provide formal support for model-driven development processes
Correctness-Preserving Configuration of Business Process Models

Reference process models capture recurrent business operations in a given domain such as procurement or logistics. These models are intended to be configured to fit the requirements of specific organizations or projects, leading to individualized process models that are subsequently used for domain analysis or solution design. Although the\ud
advantages of reusing reference process models compared to designing process models from scratch are widely accepted, the methods employed to configure reference process models are manual and error-prone. In particular, analysts are left with the burden of ensuring the correctness of the individualized process models and to manually fix errors. This paper proposes a foundation for configuring reference process models incrementally\ud
and in a way that ensures the correctness of the individualized process models, both with respect to syntax and behavioral semantics. Specifically, assuming the reference process model is behaviorally sound, the individualized process models are guaranteed to be sound
Translating model simulators to analysis models

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-78743-3_6Proceedings of 11th International Conference, FASE 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008.We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language by means of graph transformation rules. The approach is geared to the generation of transformations from Domain-Specific Visual Languages (DSVLs) into semantic domains with an explicit notion of transition, like for example Petri nets. The generated transformation is expressed in the form of operational triple graph grammar rules that transform the static information (initial model) and the dynamics (source rules and their execution control structure). We illustrate these techniques with a DSVL in the domain of production systems, for which we generate a transformation into Petri nets.Work sponsored by the Spanish Ministry of Science and Education, project MOSAIC (TSI2005-08225-C07-06
Memory based on abstraction for dynamic fitness functions

Copyright @ Springer-Verlag Berlin Heidelberg 2008.This paper proposes a memory scheme based on abstraction for evolutionary algorithms to address dynamic optimization problems. In this memory scheme, the memory does not store good solutions as themselves but as their abstraction, i.e., their approximate location in the search space. When the environment changes, the stored abstraction information is extracted to generate new individuals into the population. Experiments are carried out to validate the abstraction based memory scheme. The results show the efficiency of the abstraction based memory scheme for evolutionary algorithms in dynamic environments.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant No. EP/E060722/1
Compound particle swarm optimization in dynamic environments

Copyright @ Springer-Verlag Berlin Heidelberg 2008.Adaptation to dynamic optimization problems is currently receiving a growing interest as one of the most important applications of evolutionary algorithms. In this paper, a compound particle swarm optimization (CPSO) is proposed as a new variant of particle swarm optimization to enhance its performance in dynamic environments. Within CPSO, compound particles are constructed as a novel type of particles in the search space and their motions are integrated into the swarm. A special reflection scheme is introduced in order to explore the search space more comprehensively. Furthermore, some information preserving and anti-convergence strategies are also developed to improve the performance of CPSO in a new environment. An experimental study shows the efficiency of CPSO in dynamic environments.This work was supported by the Key Program\ud
of the National Natural Science Foundation (NNSF) of China under Grant No. 70431003 and Grant No. 70671020, the Science Fund for Creative Research Group of NNSF of China under Grant No. 60521003, the National Science and Technology Support Plan of China under Grant No. 2006BAH02A09 and the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant No. EP/E060722/1
Kinetic Theory for Binary Granular Mixtures at Low-Density

Many features of granular media can be modelled as a fluid of hard spheres
with {\em inelastic} collisions. Under rapid flow conditions, the macroscopic
behavior of grains can be described through hydrodynamic equations. At
low-density, a fundamental basis for the derivation of the hydrodynamic
equations and explicit expressions for the transport coefficients appearing in
them is provided by the Boltzmann kinetic theory conveniently modified to
account for inelastic binary collisions. The goal of this chapter is to give an
overview of the recent advances made for binary granular gases by using kinetic
theory tools. Some of the results presented here cover aspects such as
transport properties, energy nonequipartition, instabilities, segregation or
mixing, non-Newtonian behavior, .... In addition, comparison of the analytical
results with those obtained from Monte Carlo and molecular dynamics simulations
is also carried out, showing the reliability of kinetic theory to describe
granular flows even for strong dissipation.Comment: 49 pages, 13 figures, to appear in Playing with Marbles: Theory and
  Simulation of Hard-Sphere Fluids and Related Systems, edited by A. Mulero
  (Springer, to be published
Alternative Approaches to the Equilibrium Properties of Hard-Sphere
  Liquids

An overview of some analytical approaches to the computation of the
structural and thermodynamic properties of single component and multicomponent
hard-sphere fluids is provided. For the structural properties, they yield a
thermodynamically consistent formulation, thus improving and extending the
known analytical results of the Percus-Yevick theory. Approximate expressions
for the contact values of the radial distribution functions and the
corresponding analytical equations of state are also discussed. Extensions of
this methodology to related systems, such as sticky hard spheres and
square-well fluids, as well as its use in connection with the perturbation
theory of fluids are briefly addressed.Comment: 64 pages; 13 figures; to appear in "Playing with Marbles: Theory and
  Simulation of Hard-Sphere Fluids and Related Systems", edited by A. Mulero
  (Springer, to be published
Aggregates for CHR through program transformation

acceptance rate = 43.3%We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expressiveness of the language. In this paper, we describe an implementation based on source-to-source transformations to CHR (extended with some low-level compiler directives). We allow user-defined aggregates and nested aggregate expressions over arbitrary guarded conjunctions of constraints. Both an on-demand and an incremental aggregate computation strategy are supported.status: publishe
Orthogonality measures and applications in systems theory in one and more variables

The representation or order reduction of a rational transfer function by a linear combination of orthogonal rational functions offers several advantages, among which the possibility to work with prescribed poles and hence the guarantee of system stability. Also for multidimensional linear shift-invariant systems with infinite-extent impulse response, stability can be guaranteed a priori by the use of a multivariate Padé-type approximation technique, which is again a rational approximation technique. In both the one- and multidimensional case the choice of the moment functional with respect to which the orthogonality of the functions in use is imposed, plays a crucial role.status: publishe
Semi-Dynamic Demand in a Non-Permutation Flowshop with Constrained Resequencing Buffers.

This work presents the performance comparison of two conceptually different approaches for a mixed model non-permutation flowshop production line. The demand is a semi-dynamic demand with a fixed job sequence for the first station. Resequencing is permitted where stations have access to intermediate or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. An exact approach, using Constraint Logic Programming (CLP), and a heuristic approach, a Genetic Algorithm (GA), were applied.Peer Reviewe
On the complexity of restricted k-anonymity problem

One of the emerging concepts in microdata protection is k-anonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect private individual information and is gaining increasing popularity. k-anonymity requires that every tuple(record) in the microdata table released be indistinguishably related to no fewer than k respondents. In this paper, we introduce two new variants of the k-anonymity problem, namely, the Restricted k-anonymity problem and Restricted k-anonymity problem on attribute (where suppressing the entire attribute is allowed). We prove that both problems are NP-hard for k ≥ 3. The results imply the main results obtained by Meyerson and Williams. On the positive side, we develop a polynomial time algorithm for the Restricted 2-anonymity problem by giving a graphical representation of the microdata table
A metric of compactness of urban change illustrated to 22 European countries

Most metrics of urban spatial structure are snapshots, summarizing spatial structure at one particular moment in time. They are therefore not ideal for the analysis of urban change patterns. This paper presents a new spatio-temporal analytical method for raster maps that explicitly registers changesin patterns. The main contribution is a transition matrix which cross-tabulates the distance to the nearest urbanized location at the beginning and end of the analyzed period. The transition matrix by itself offers a powerful description of urban change patterns from which further metrics can be derived. In particular, a metric that is an indicator of the compactness of urban change is derived. The new metric is applied first to a synthetic dataset demonstrating consistency with existing classifications of urban change patterns. Next, the metric is applied country by country on the European CORINE land cover dataset. The results indicate a striking contrast in change patterns between Western and Eastern European counties. The method can be further elaborated in many different ways and can therefore be the first in a family of spatio-temporal descriptive statistics
Assessing the interestingness of temporal rules with Sequential Implication Intensity

In this article, we study the assessment of the interestingness of sequential rules (generally temporal rules). This is a crucial problem in sequence analysis since the frequent pattern mining algorithms are unsupervised and can produce huge amounts of rules. While association rule interestingness has been widely studied in the literature, there are few measures dedicated to sequential rules. Continuing with our work on the adaptation of implication intensity to sequential rules, we propose an original statistical measure for assessing sequential rule interestingness. More precisely, this measure named Sequential Implication Intensity (SII) evaluates the statistical significance of the rules in comparison with a probabilistic model. Numerical simulations show that SII has unique features for a sequential rule interestingness measure
Privacy of recent RFID authentication protocols

The original publication is available at www.springerlink.comPrivacy is a major concern in RFID systems, especially with\ud
widespread deployment of wireless-enabled interconnected personal de-\ud
vices e.g. PDAs and mobile phones, credit cards, e-passports, even cloth-\ud
ing and tires. An RFID authentication protocol should not only allow\ud
a legitimate reader to authenticate a tag but it should also protect the\ud
privacy of the tag against unauthorized tracing: an adversary should not\ud
be able to get any useful information about the tag for tracking or dis-\ud
covering the tag's identity. In this paper, we analyze the privacy of some\ud
recently proposed RFID authentication protocols (2006 and 2007) and\ud
show attacks on them that compromise their privacy. Our attacks con-\ud
sider the simplest adversaries that do not corrupt nor open the tags. We\ud
describe our attacks against a general untraceability model; from expe-\ud
rience we view this endeavour as a good practice to keep in mind when\ud
designing and analyzing security protocols
Enhanced transport protocols

The book presents mechanisms, protocols, and system architectures to achieve end-to-end Quality-of-Service (QoS) over heterogeneous wired/wireless networks in the Internet. Particular focus is on measurement techniques, traffic engineering mechanisms and protocols, signalling protocols as well as transport protocol extensions to support fairness and QoS. It shows how those mechanisms and protocols can be combined into a comprehensive end-to-end QoS architecture to support QoS in the Internet over heterogeneous wired/wireless access networks. Finally, techniques for evaluation of QoS mechanisms such as simulation and emulation are presented. The book is aimed at graduate and post-graduate students in Computer Science or Electrical Engineering with focus in data communications and networking as well as for professionals working in this area
Insertion and Expansion Operations for n -Dimensional Generalized Maps

International audienceHierarchical representations, as irregular pyramids, are the bases of several applications in the field of discrete imagery. So, n-dimensional "bottom-up" irregular pyramids can be defined as stacks of successively reduced n-dimensional generalized maps (n-G-maps) [13], each n-G-map being defined from the previous level by using removal and contraction operations defined in [18]. Our goal is to build a theoretical framework for the definition and handling of n-dimensional "top-down" irregular pyramids. To do that, we propose in this paper to study the definition of insertion and expansion operations that allows to conceive this kind of pyramids
Medial Axis LUT Computation for Chamfer Norms Using H-Polytopes

International audienceChamfer distances are discrete distances based on the propagation of local distances, or weights defined in a mask. The medial axis, i.e. the centers of the maximal disks (disks which are not contained in any other disk), is a powerful tool for shape representation and analysis. The extraction of maximal disks is performed in the general case with comparison tests involving look-up tables representing the covering relation of disks in a local neighborhood. Although look-up table values can be computed efficiently, the computation of the look-up table neighborhood tend to be very time-consuming. By using polytope descriptions of the chamfer disks, the necessary operations to extract the look-up tables are greatly reduced
Normals and Curvature Estimation for Digital Surfaces Based on Convolutions

International audienceIn this paper, we present a method that we call on-surface convolution which extends the classical notion of a 2D digital filter to the case of digital surfaces (following the cuberille model). We also define an averaging mask with local support which, when applied with the iterated convolution operator, behaves like an averaging with large support. The interesting property of the latter averaging is the way the resulting weights are distributed: they tend to decrease following a “continuous” geodesic distance within the surface. We eventually use the iterated averaging followed by convolutions with differentiation masks to estimate partial derivatives and then normal vectors over a surface. We provide an heuristics based on [14] for an optimal mask size and show results
Robust estimation of curvature along digital contours with global optimization

International audienceIn this paper we introduce a new curvature estimator based on global optimisation. This method called Global Min-Curvature ex- ploits the geometric properties of digital contours by using local bounds on tangent directions deﬁned by the maximal digital straight segments. The estimator is adapted to noisy contours by replacing maximal seg- ments with maximal blurred digital straight segments. Experimentations on perfect and damaged digital contours are performed and in both cases, comparisons with other existing methods are presented
First Results for 3D Image Segmentation with Topological Map

International audienceThis paper presents the first segmentation operation defined within the 3D topological map framework. Firstly we show how a traditional segmentation algorithm, found in the literature, can be transposed on a 3D image represented by a topological map. We show the consistency of the results despite of the modifications made to the segmentation algorithm and we study the complexity of the operation. Lastly, we present some experimental results made on 3D medical images. These results show the process duration of this method and validate the interest to use 3D topological map in the context of image processing
Unary automatic graphs: an algorithmic perspective

This paper studies inﬁnite graphs produced from a natural
unfolding operation applied to ﬁnite graphs. Graphs produced via such
operations are of ﬁnite degree and can be described by ﬁnite automata
over the unary alphabet. We investigate algorithmic properties of such
unfolded graphs given their ﬁnite presentations. In particular, we ask
whether a given node belongs to an inﬁnite component, whether two
given nodes in the graph are reachable from one another, and whether
the graph is connected. We give polynomial time algorithms for each
of these questions. Hence, we improve on previous work, in which nonelementary or non-uniform algorithms were foun
Extending model checking to data-aware temporal properties of web services

A “data-aware” web service property is a constraint on the\ud
pattern of message exchanges of a workflow where the order of messages and their data content are interdependent. The logic CTL-FO+ expresses these properties by allowing temporal operators and first-order quantification over message content to be freely mixed. A “naïve” translation of CTL-FO+ into CTL leads to a serious exponential blow-up of the problem that prevents existing validation tools to be used. In this paper, we provide an alternate translation of CTL-FO+ into CTL where the construction of the workflow model depends on the property to validate. We show experimentally how this translation is significantly more efficient and makes model checking of data-aware temporal properties on real-world web service workflows tractable using off-the-shelf tools