Sciweavers

ICCSA
2010
Springer
14 years 7 months ago
String Matching with Mismatches by Real-Valued FFT
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
Kensuke Baba
ICCSA
2010
Springer
14 years 7 months ago
Authentication - Based Medium Access Control to Prevent Protocol Jamming: A-MAC
Abstract. Recently, Wireless Local Area Network (WLAN) is used by enterprises, government, and the military, as well as small office and home offices. Although it is convenient, it...
Jaemin Jeung, Seungmyeong Jeong, Jaesung Lim
FOSSACS
2010
Springer
14 years 7 months ago
Toward a Compositional Theory of Leftist Grammars and Transformations
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...
Pierre Chambart, Ph. Schnoebelen
FOSSACS
2010
Springer
14 years 7 months ago
Forward Analysis of Depth-Bounded Processes
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
Thomas Wies, Damien Zufferey, Thomas A. Henzinger
FOSSACS
2010
Springer
14 years 7 months ago
Monads Need Not Be Endofunctors
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
Thorsten Altenkirch, James Chapman, Tarmo Uustalu
FOSSACS
2010
Springer
14 years 7 months ago
A Semantic Foundation for Hidden State
Abstract. We present the first complete soundness proof of the antiframe rule, a recently proposed proof rule for capturing information hiding in the presence of higher-order stor...
Jan Schwinghammer, Hongseok Yang, Lars Birkedal, F...
FOSSACS
2010
Springer
14 years 7 months ago
Parameterised Multiparty Session Types
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
Nobuko Yoshida, Pierre-Malo Deniélou, Andi ...
FOSSACS
2010
Springer
14 years 7 months ago
Counting CTL
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
François Laroussinie, Antoine Meyer, Eudes ...
FOSSACS
2010
Springer
14 years 7 months ago
The Complexity of Synchronous Notions of Information Flow Security
The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one i...
Franck Cassez, Ron van der Meyden, Chenyi Zhang
FOSSACS
2010
Springer
14 years 7 months ago
Solvability in Resource Lambda-Calculus
Abstract. The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a finite multiset of resourc...
Michele Pagani, Simona Ronchi Della Rocca