Sciweavers

264 search results - page 26 / 53
» entcs 2008
Sort
View
ENTCS
2008
97views more  ENTCS 2008»
13 years 6 months ago
Termination of Lazy Rewriting Revisited
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
Felix Schernhammer, Bernhard Gramlich
ENTCS
2008
113views more  ENTCS 2008»
13 years 6 months ago
A Model-Based Approach to the Verification and Adaptation of WF/.NET Components
This paper presents an approach which supports verification and model-based adaptation of software compod services implemented using Windows Workflow Foundation (WF). First, we pr...
Javier Cubo, Gwen Salaün, Carlos Canal, Ernes...
ENTCS
2008
110views more  ENTCS 2008»
13 years 6 months ago
Chosen-name Attacks: An Overlooked Class of Type-flaw Attacks
In the context of Dolev-Yao style analysis of security protocols, we consider the capability of an intruder to dynamically choose and assign names to agents. This capability has b...
Pieter Ceelen, Sjouke Mauw, Sasa Radomirovic
ENTCS
2008
99views more  ENTCS 2008»
13 years 6 months ago
Specifying Properties of Concurrent Computations in CLF
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
Kevin Watkins, Iliano Cervesato, Frank Pfenning, D...
ENTCS
2008
118views more  ENTCS 2008»
13 years 6 months ago
Coinductive Characterisations Reveal Nice Relations Between Preorders and Equivalences
There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalenc...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...