TL;DR: A reduction and a labelled stochastic semantics for bigraphs are defined and it is proved that the two semantics are consistent with each other.

TL;DR: The paper presents ConSpec, an automata based policy specification language that trades off clean semantics to language expressiveness; a formal semantics for the language is provided as security automata.

TL;DR: Bio-PEPA is a modification of PEPA to deal with some features of biological models, such as stoichiometry and the use of generic kinetic laws, and is seen as an intermediate, formal, compositional representation of biological systems, on which different kinds of analysis can be carried out.

TL;DR: The paper provides a motivating introduction to bigraphs, a framework in which both existing process calculi and new models of behaviour can be formulated, yielding theory that is shared among these models.

TL;DR: This paper discusses an approach to verify this semantic equivalence for each transformation to check whether a particular transformation resulted in an output model that preserves the semantics of the input model with respect to a particular property.

TL;DR: This paper gives the first comparison of SAODV and TAODV, two MANET routing protocols, which address routing security through cryptographic and trust-based means respectively, and provides performance comparisons on actual resource-limited hardware.

TL;DR: This work presents a restricted form of OCL constraints that can be translated to graph constraints which can be checked during the instance generation process in a meta model.

TL;DR: The experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language @Wmega, which is intended as both a practical programming language and a logic to allow programmers to describe and reason about semantic properties of programs from within the programming Language itself, mainly by using a powerful type system.

TL;DR: A UML profile for the PIM-level service-oriented architectural modelling, as well as its corresponding metamodel is presented and chosen because it does not reflect constraints about any specific platform or implementation technology.

TL;DR: A Controlled Natural Language, use case specification templates, and a strategy and tool support to generate process algebraic formal models (in CSP notation) from use cases specified using the templates and CNL are proposed.

TL;DR: It is shown how to systematically generate test sequences for security properties based on the model that can be used to test the implementation for vulnerabilities to systematic specification-based testing of security-critical systems based on UMLsec models.

TL;DR: In this paper, the authors explore techniques for designing nonblocking algorithms that do not require advance knowledge of the number of processes that participate, whose time complexity and space consumption both adapt to various measures, rather than being based on predefined worst-case scenarios, and that cannot be prevented from future memory reclamation by process failures.

TL;DR: The new concept of essential critical pairs allowing a more efficient conflict detection is introduced based on a new conflict characterization, which determines for each conflict occuring between the rules of the system the exact conflict reason.

TL;DR: The past and future work of the MathLang project, an approach for computerizing mathematical texts and knowledge which is flexible enough to connect the different approaches to computerization, is surveyed.

TL;DR: This work sets out a simple framework for classifying wireless sensor networks in terms of those properties that directly influence key distribution requirements, and fits a number of existing schemes within this framework.

TL;DR: An approach which supports verification and model-based adaptation of software components and services implemented using Windows Workflow Foundation and formalises the extraction of Labelled Transition Systems from these workflows is presented.

TL;DR: The compiler correctness proof meets the special requirements of pervasive system verification and allows to transfer correctness properties from the C0 layer to the assembler and hardware layers, allowing to prove pervasively the correctness of compiled C0 programs in the real system.

TL;DR: The approach transforms AGG specifications into Bogor models and supports both attributed typed graphs and layered transformations, and is amenable to check interesting properties expressed as combinations of LTL and graph transformation rules.

TL;DR: This paper describes an effort to develop tool support enabling the use of task models as oracles for model-based testing of user interfaces.

TL;DR: In this article, the authors provide a definition of POVM in terms of abstract tensor structure and prove Naimark's theorem on an extended system, and this proof is moreover purely graphical.

TL;DR: An algorithm to determine the Worst Case Reaction Time (WCRT) of a program written in the synchronous language Esterel gives an upper bound for the execution time when the program is executed on a reactive processor.

TL;DR: The new version of the Hybrid system is described, implemented on top of Isabelle/HOL (as well as Coq), in which a de Bruijn representation of @l-terms provides a definitional layer that allows the user to represent object languages in HOAS style, while offering tools for reasoning about them at the higher level.

TL;DR: This paper focuses on the compatibility analysis of Web services regarding their supported sequences of messages, the exchanged data flow, constraints related to the exchangedData flow and the temporal requirements, and studies three compatibility classes.

TL;DR: Two novel, efficient algorithms for solving the E-matching problem are presented and compared to a well-known algorithm described in the literature.

TL;DR: The presented algorithm is used as basis for the implementation of an extension of the stochastic @p-Calculus, called [email protected]@, which allows an intuitive and concise formalisation of biological systems.

TL;DR: An extensible fault model for the implementation of transformations based on common programmer faults and the technicalities of graph transformations is proposed and integrated into traditional hardware testing and software testing techniques for generating test cases.

TL;DR: Hedaquin is presented, a system that provides health care professionals with an indication of the quality of health data in a PHR based on the reputation of the supplier and on metadata provided by measurement devices.

TL;DR: This paper proposes two slicing techniques for Petri nets that can be useful to reduce the size of the considered net, thereby simplifying subsequent analysis and debugging tasks by standard Petri net techniques.

TL;DR: The goal of this paper is the generalization of parallelism and concurrency results for adhesive High-Level Replacement (HLR) systems to adhesive HLR systems with negative application conditions, which will support the development of formal analysis techniques for adhesive H LR systems withnegative application conditions.