Sciweavers

360 search results - page 33 / 72
» Constraint Checking with Partial Information
Sort
View
APLAS
2009
ACM
14 years 2 months ago
On the Decidability of Subtyping with Bounded Existential Types
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
Stefan Wehr, Peter Thiemann
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 7 months ago
A constructive and unifying framework for zero-bit watermarking
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in a piece of content. The watermark detector checks ...
Teddy Furon
IFIP
2010
Springer
13 years 2 months ago
Modular Plans for Secure Service Composition
Service Oriented Computing (SOC) is a programming paradigm aiming at characterising Service Networks. Services are entities waiting for clients requests and they often result from ...
Gabriele Costa, Pierpaolo Degano, Fabio Martinelli
AIEDAM
1998
108views more  AIEDAM 1998»
13 years 7 months ago
Web-based configuration assistants
Configuration assistants are tools for guiding the final user in simple configuration tasks, such as product assembling and customisation or study plans generation. For their wide ...
Giuseppe Attardi, Antonio Cisternino, Maria Simi
LISP
2008
97views more  LISP 2008»
13 years 7 months ago
Efficient and flexible access control via Jones-optimal logic program specialisation
We describe the use of a flexible meta-interpreter for performing access control checks on deductive databases. The meta-program is implemented in Prolog and takes as input a datab...
Steve Barker, Michael Leuschel, Mauricio Varea