Sciweavers

3552 search results - page 381 / 711
» Proof theory in the abstract
Sort
View
211
Voted
PLDI
2006
ACM
16 years 22 days ago
Specifying distributed trust management in LolliMon
We propose the monadic linear logic programming language LolliMon as a new foundation for the specification of distributed trust management systems, particularly the RT framework...
Jeff Polakow, Christian Skalka
230
Voted
SCESM
2006
ACM
269views Algorithms» more  SCESM 2006»
16 years 22 days 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
16 years 9 days 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
189
Voted
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
15 years 11 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
ECAI
2000
Springer
15 years 11 months ago
Towards Real-Time Search with Inadmissible Heuristics
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
Masashi Shimbo, Toru Ishida