Sciweavers

884 search results - page 142 / 177
» A Proof Theory for DL-Lite
Sort
View
SCESM
2006
ACM
269views Algorithms» more  SCESM 2006»
15 years 5 months ago
Inferring operational requirements from scenarios and goal models using inductive learning
Goal orientation is an increasingly recognised Requirements Engineering paradigm. However, integration of goal modelling with operational models remains an open area for which the...
Dalal Alrajeh, Alessandra Russo, Sebastián ...
FOSSACS
2005
Springer
15 years 5 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
ASIACRYPT
2004
Springer
15 years 5 months ago
Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
Ron Steinfeld, Huaxiong Wang, Josef Pieprzyk
ICALP
2010
Springer
15 years 4 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
15 years 4 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham