Sciweavers

1419 search results - page 135 / 284
» Notes on Formalizing Context
Sort
View
ENTCS
2008
110views more  ENTCS 2008»
15 years 29 days 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
IJIQ
2008
58views more  IJIQ 2008»
15 years 27 days ago
Quality of service in e-government underlines the role of information usability
: Digital services can be thought as internet based applications that fulfil users' needs and their quality represents a basic element during the delivery process. In such a c...
Flavio Corradini, Alberto Polzonetti, Barbara Re, ...
IPL
2008
99views more  IPL 2008»
15 years 27 days ago
A CKY parser for picture grammars
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
Stefano Crespi-Reghizzi, Matteo Pradella
IPL
2007
78views more  IPL 2007»
15 years 24 days ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
JSYML
2007
79views more  JSYML 2007»
15 years 24 days ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg