1,100 research outputs found
Satisfiability of General Intruder Constraints with and without a Set Constructor
Many decision problems on security protocols can be reduced to solving
so-called intruder constraints in Dolev Yao model. Most constraint solving
procedures for protocol security rely on two properties of constraint systems
called monotonicity and variable origination. In this work we relax these
restrictions by giving a decision procedure for solving general intruder
constraints (that do not have these properties) that stays in NP. Our result
extends a first work by L. Mazar\'e in several directions: we allow non-atomic
keys, and an associative, commutative and idempotent symbol (for modeling
sets). We also discuss several new applications of the results.Comment: Submitted to the Special issue of Information and Computation on
Security and Rewriting Techniques (SecReT), 2011. 59 page
Metamodel Instance Generation: A systematic literature review
Modelling and thus metamodelling have become increasingly important in
Software Engineering through the use of Model Driven Engineering. In this paper
we present a systematic literature review of instance generation techniques for
metamodels, i.e. the process of automatically generating models from a given
metamodel. We start by presenting a set of research questions that our review
is intended to answer. We then identify the main topics that are related to
metamodel instance generation techniques, and use these to initiate our
literature search. This search resulted in the identification of 34 key papers
in the area, and each of these is reviewed here and discussed in detail. The
outcome is that we are able to identify a knowledge gap in this field, and we
offer suggestions as to some potential directions for future research.Comment: 25 page
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
Applying Formal Methods to Networking: Theory, Techniques and Applications
Despite its great importance, modern network infrastructure is remarkable for
the lack of rigor in its engineering. The Internet which began as a research
experiment was never designed to handle the users and applications it hosts
today. The lack of formalization of the Internet architecture meant limited
abstractions and modularity, especially for the control and management planes,
thus requiring for every new need a new protocol built from scratch. This led
to an unwieldy ossified Internet architecture resistant to any attempts at
formal verification, and an Internet culture where expediency and pragmatism
are favored over formal correctness. Fortunately, recent work in the space of
clean slate Internet design---especially, the software defined networking (SDN)
paradigm---offers the Internet community another chance to develop the right
kind of architecture and abstractions. This has also led to a great resurgence
in interest of applying formal methods to specification, verification, and
synthesis of networking protocols and applications. In this paper, we present a
self-contained tutorial of the formidable amount of work that has been done in
formal methods, and present a survey of its applications to networking.Comment: 30 pages, submitted to IEEE Communications Surveys and Tutorial
The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Verification of Hardware and Software Systems
Since its inception as a student project in 2001, initially just for the
handling (as the name implies) of convex polyhedra, the Parma Polyhedra Library
has been continuously improved and extended by joining scrupulous research on
the theoretical foundations of (possibly non-convex) numerical abstractions to
a total adherence to the best available practices in software development. Even
though it is still not fully mature and functionally complete, the Parma
Polyhedra Library already offers a combination of functionality, reliability,
usability and performance that is not matched by similar, freely available
libraries. In this paper, we present the main features of the current version
of the library, emphasizing those that distinguish it from other similar
libraries and those that are important for applications in the field of
analysis and verification of hardware and software systems.Comment: 38 pages, 2 figures, 3 listings, 3 table
Automated synthesis of local time requirement for service composition
National Research Foundation (NRF) Singapore ANR-NRF French-Singaporean research program ProMi
- …