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

TL;DR: It is shown that a combination of rippling and the use of meta-variables as a least-commitment device can provide novelty in induction rule construction techniques that can introduce novel recursive structures.

TL;DR: The main characteristics of a good quality process are discussed, the key testing phases are surveyed and modern functional and model-based testing approaches are presented.

TL;DR: Experimental results indicate that the AVISPA Tool is a state-of-the-art tool for Internet security protocol analysis as, to the authors' knowledge, no other tool exhibits the same level of scope and robustness while enjoying the same performance and scalability.

TL;DR: In this article, the authors present a runtime verification framework for Java programs, where properties can be specified in Linear-time Temporal Logic (LTL) over AspectJ pointcuts.

TL;DR: This paper provides a non-technical introduction to the basic concepts of typed graph transformation systems, completed by a survey of more advanced concepts, and explains some of its history and motivations.

TL;DR: A rewrite-based specification language for modelling probabilistic concurrent and distributed systems based on PMaude, which has both a rigorous formal basis and the characteristics of a high-level rule-based programming language, and introduces a query language called Quantitative Temporal Expressions (or QuaTEx in short), to query various quantitative aspects of a Probabilistic model.

TL;DR: This article presents a rule-based approach that allows for the declarative specification of data integration rules and is based on the formalism of triple graph grammars and uses directed graphs to represent MOF-compliant (meta) models.

TL;DR: A map of the main characteristics that MANETs simulation tools should feature and the current support of these is provided, including a description for each simulator, including an explanation of what make them appealing solutions.

TL;DR: This paper introduces relational structures called conditional doxastic models (CDM's), and shows how the standard semantics for these types of updates can be appropriately modified in order to apply it to CDM's, thus incorporating belief revision into the notion of update.

TL;DR: The usefulness of probabilistic model checking techniques in detecting flaws and unusual trends is demonstrated, focusing mainly on the quantitative analysis of a range of best, worst and average-case system characteristics.

TL;DR: The current state of the art of organization-oriented multiagent system methods, placing emphasis on their organizational features, are discussed, and several guidelines for implementing agent organizations by means of Organization Theory are proposed.

TL;DR: This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis and proves that any single state-metric corresponds to a bisimulation and that the greatest state- Metrics corresponds to bisimilarity.

TL;DR: The semantics of BPEL4WS language, which is a de facto standard for specifying and execution workflow specification for web service composition and orchestration, is discussed, and it is proved that the mapping from @m-BPEL to TA is a simulation, which means that the TA network simulates correctly the corresponding @m -BPEL specification.

TL;DR: An operational semantics for a calculus of wireless systems is developed and a Reduction Semantics and a Labelled Transition Semantics are presented and a correspondence result is proved between them.

TL;DR: A method to extract the behavioral specification from a BPEL appliation program and to analyze it by using the SPIN model checker is proposed and can analyze all the four example cases in the BPEL standard document.

TL;DR: Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics and SOS in a novel way, avoiding their respective limitations and allowing very succinct semantic definitions.

TL;DR: This paper presents an architecture for context-aware service discovery and presents the system evaluation as a tradeoff between a) the increase of the quality of service discovery when context-awareness is taken into account and b) the extra cost/burden imposed by context management.

TL;DR: This work extends the pattern system for property specification by patterns related to time, which allows the specification of real-time requirements.

TL;DR: A metamodel-independent solution to this problem that uses ATL (Atlas Transformation Language) that has been implemented as an Eclipse-based plugin.

TL;DR: This seminal paper introduces the notion of Agens Faber, conveying the idea that agent intelligence should not be considered as separated by the agent ability to perceive and affect the environment-and so, thatAgent intelligence is strictly related to the artefacts that enable, mediate and govern any agent (intelligent) activity.

TL;DR: Separation logic gives a complete formal treatment of critical sections (for the first time, so far as I is aware) in Hoare logic and allows a resource treatment of variables.

TL;DR: In this paper, the state graphs are contracted by collecting nodes that are sufficiently similar (resulting in smaller states and a finite state space) and the application of the graph production rules is lifted to this abstract level.

TL;DR: A program transformation is introduced that uses transaction mechanisms to prevent timing leaks in sequential object-oriented programs and preserves the semantics of programs and yields for every termination-sensitive noninterfering program a time-sensitive termination- sensitive non-interfered program.

TL;DR: This paper presents a typical example requiring services composition, gives a definition of an automated services composition approach and outlines its main requirements, and presents a proposal for web services composition based on autonomous services interactions.

TL;DR: An adaptive approach for graph pattern matching is presented, where the optimal search plan can be selected from previously generated search plans at run-time based on statistical data collected from the current instance model under transformation.

TL;DR: Beta-binders, a language of processes with typed interaction sites which has been recently introduced to accurately represent biological entities, is enriched to achieve a stochastic version of it, in order to obtain quantitative measures on biological phenomena.

TL;DR: A derived rule in HOL-Light is defined, CVC_PROVE, which calls CVC Lite and translates the resulting proof object back tohol-Light, which obtains a highly trusted proof-checker for CVClite, while also fundamentally expanding the capabilities of HOL- light.

TL;DR: The state logic is used to provide a sound Hoare-style calculus for quantum imperative programs and the calculus is illustrated by proving the correctness of the Deutsch algorithm.

TL;DR: A specific protocol for bit exchange among card-playing agents in three different state-of-the-art epistemic model checkers is implemented and the results are compared.

TL;DR: This paper presents a method using heuristic-driven simulation to generate test cases for dynamic real-time systems to determine the execution orders that need to be verified to increase confidence in timeliness.