Showing papers in "Electronic Notes in Theoretical Computer Science in 2008"

TL;DR: The underlying supporting technology of three state-of-the-art static analysis tools is surveyed, which includes the types of defects checked for (such as memory management, arithmetics, security vulnerabilities), soundness, value and aliasing analyses, incrementality and IDE integration.

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: 2 operators on relations over natural numbers such that they generalize the operators '+' and '*' are defined and it is shown that the membership and emptiness problem of relations constructed from finite relations with these operators and @?

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: This paper addresses the problem of tracing implicit information flow, which had not been resolved by previous run-time systems and the additional intricacies added on by the Java architecture, and argues that the security benefits offered by Trishul are substantial enough to counter-weigh the performance overhead.

TL;DR: Silver is described, an extensible attribute grammar specification language, and it is shown how it can be extended with general purpose features such as pattern matching and domain specific featuressuch as collection attributes and constructs for supporting data-flow analysis of imperative programs.

TL;DR: This work addresses the problem of component reuse by describing a quotient operation that computes the residual specification characteristic of the systems that, when composed with the given component, satisfy the overall specification.

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: This paper explores the emerging paradigm of business-driven development, which presupposes a methodology for developing IT solutions that directly satisfy business requirements and needs and describes selected solutions that have been developed by the research team of the IBM Zurich Research Laboratory.

TL;DR: It is argued that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of tree relabelling as in attribute evaluation.

TL;DR: This work examines ways to measure expressiveness of process algebras, and recapitulates and compares some related results from the literature.

TL;DR: A combination method that incrementally reconciles models maintained by each theory is introduced that evaluates the practicality and efficiency of this approach.

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: 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: The design and the present state of the verification tool Augur 2 which is currently being developed is described, a tool which can analyze graph transformation systems by approximating them by Petri nets.

TL;DR: It is shown that there is another view of classical types, namely as splittings of self-adjoint idempotents on quantum types, that all the objects of CPM(C)^@?

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: The formalism's use and generality is discussed with respect to the modeling of molecular biological processes like diffusion, active transportation in cell signaling, and spatial structures.

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: The paper presents a careful motivation and justification of the applicability of generalized sketches for formalizing practical modeling notations, and extends the sketch formalism by dependencies between predicate symbols and develop new semantic notions based on the Instances-as-typed-structures idea.

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: 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: 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: This work recast Selinger's CPM-construction of mixed states completely positive maps as an axiomatization of maximally mixed states, and admits a physical interpretation in terms of purification of Mixed states and CPMs.

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: This paper explores a unification of the ideas of Concurrent Separation Logic with those of Communicating Sequential Processes by an operator for separation in time as well as separation in space.

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: This paper studies the linear fragment of the programing language for quantum computation with classical control described in, and sketches the language, and describes a fully abstract denotational semantics based on completely positive maps.

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: 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.