Sciweavers

18209 search results - page 207 / 3642
» Some Remarks on the Paper
Sort
View
FP
1992
87views Formal Methods» more  FP 1992»
15 years 10 months ago
On Program Transformation in the Glasgow Haskell Compiler
In this paper we describe a series of program transformations that are currently being implemented in the Glasgow Haskell Compiler. They are semantics preserving program transform...
André Santos, Simon L. Peyton Jones
FUN
2007
Springer
85views Algorithms» more  FUN 2007»
15 years 10 months ago
Efficient Algorithms for the Spoonerism Problem
A spoonerism is a sentence in some natural language where the swapping of two letters results in a new sentence with a different meaning. In this paper, we give some efficient algo...
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ri...
ICAIL
2007
ACM
15 years 10 months ago
Variants of temporal defeasible logics for modelling norm modifications
This paper proposes some variants of Temporal Defeasible Logic (TDL) to reason about normative modifications. These variants make it possible to differentiate cases in which, for ...
Guido Governatori, Antonino Rotolo, Régis R...
ASIACRYPT
2006
Springer
15 years 10 months ago
Analysis of One Popular Group Signature Scheme
The group signature scheme [1], ACJT for short, is popular. In this paper we show that it is not secure. It does not satisfy exculpability. The group manager can sign on behalf of ...
Zhengjun Cao
FMCO
2006
Springer
107views Formal Methods» more  FMCO 2006»
15 years 10 months ago
Learning Meets Verification
In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann's and Angluin's algorithms, we describe some of the extensions caterin...
Martin Leucker