4,913 research outputs found
Diagnosis of the significance of inconsistencies in software designs: a framework and its experimental evaluation
This paper presents: (a) a framework for assessing the significance of inconsistencies which arise in object-oriented design models that describe software systems from multiple perspectives, and (b) the findings of a series of experiments conducted to evaluate it. The framework allows the definition of significance criteria and measures the significance of inconsistencies as beliefs for the satisfiability of these criteria. The experiments conducted to evaluate it indicate that criteria definable in the framework have the power to create elaborate rankings of inconsistencies in models
Taming a non-convex landscape with dynamical long-range order: memcomputing Ising benchmarks
Recent work on quantum annealing has emphasized the role of collective
behavior in solving optimization problems. By enabling transitions of clusters
of variables, such solvers are able to navigate their state space and locate
solutions more efficiently despite having only local connections between
elements. However, collective behavior is not exclusive to quantum annealers,
and classical solvers that display collective dynamics should also possess an
advantage in navigating a non-convex landscape. Here, we give evidence that a
benchmark derived from quantum annealing studies is solvable in polynomial time
using digital memcomputing machines, which utilize a collection of dynamical
components with memory to represent the structure of the underlying
optimization problem. To illustrate the role of memory and clarify the
structure of these solvers we propose a simple model of these machines that
demonstrates the emergence of long-range order. This model, when applied to
finding the ground state of the Ising frustrated-loop benchmarks, undergoes a
transient phase of avalanches which can span the entire lattice and
demonstrates a connection between long-range behavior and their probability of
success. These results establish the advantages of computational approaches
based on collective dynamics of continuous dynamical systems
Architectures in parametric component-based systems: Qualitative and quantitative modelling
One of the key aspects in component-based design is specifying the software
architecture that characterizes the topology and the permissible interactions
of the components of a system. To achieve well-founded design there is need to
address both the qualitative and non-functional aspects of architectures. In
this paper we study the qualitative and quantitative formal modelling of
architectures applied on parametric component-based systems, that consist of an
unknown number of instances of each component. Specifically, we introduce an
extended propositional interaction logic and investigate its first-order level
which serves as a formal language for the interactions of parametric systems.
Our logics achieve to encode the execution order of interactions, which is a
main feature in several important architectures, as well as to model recursive
interactions. Moreover, we prove the decidability of equivalence,
satisfiability, and validity of first-order extended interaction logic
formulas, and provide several examples of formulas describing well-known
architectures. We show the robustness of our theory by effectively extending
our results for parametric weighted architectures. For this, we study the
weighted counterparts of our logics over a commutative semiring, and we apply
them for modelling the quantitative aspects of concrete architectures. Finally,
we prove that the equivalence problem of weighted first-order extended
interaction logic formulas is decidable in a large class of semirings, namely
the class (of subsemirings) of skew fields.Comment: 53 pages, 11 figure
Amending Contracts for Choreographies
Distributed interactions can be suitably designed in terms of choreographies.
Such abstractions can be thought of as global descriptions of the coordination
of several distributed parties. Global assertions define contracts for
choreographies by annotating multiparty session types with logical formulae to
validate the content of the exchanged messages. The introduction of such
constraints is a critical design issue as it may be hard to specify contracts
that allow each party to be able to progress without violating the contract. In
this paper, we propose three methods that automatically correct inconsistent
global assertions. The methods are compared by discussing their applicability
and the relationships between the amended global assertions and the original
(inconsistent) ones.Comment: In Proceedings ICE 2011, arXiv:1108.014
Model Checking Dynamic-Epistemic Spatial Logic
In this paper we focus on Dynamic Spatial Logic, the extension of Hennessy-Milner logic with the parallel operator. We develop a sound complete Hilbert-style axiomatic system for it comprehending the behavior of spatial operators in relation with dynamic/temporal ones. Underpining on a new congruence we define over the class of processes - the structural bisimulation - we prove the finite model property for this logic that provides the decidability for satisfiability, validity and model checking against process semantics. Eventualy we propose algorithms for validity, satisfiability and model checking
- …