FLOPS
2004
Springer
14 years 3 months ago
2004
Springer
FLOPS
2004
Springer
14 years 3 months ago
2004
Springer
FLOPS
2004
Springer
14 years 3 months ago
2004
Springer
Sharing among program variables is vital information when analyzing logic programs. This information is often expressed either as sets or as pairs of program variables that (may) s...
FLOPS
2004
Springer
14 years 3 months ago
2004
Springer
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
FLOPS
2004
Springer
14 years 3 months ago
2004
Springer
This paper presents a backward sharing analysis for logic programs. The analysis computes pre-conditions for a query that guarantee a given post-condition is satisfied after the q...
CARDIS
2004
Springer
14 years 3 months ago
2004
Springer
CARDIS
2004
Springer
14 years 3 months ago
2004
Springer
Considering the typical amount of memory available on a smart card, it is essential to minimize the size of the runtime environment to leave as much memory as possible to applicati...
CARDIS
2004
Springer
14 years 3 months ago
2004
Springer
CMOS gates consume different amounts of power whether their output has a falling or a rising edge. Therefore the overall power consumption of a CMOS circuit leaks information about...
CARDIS
2004
Springer
14 years 3 months ago
2004
Springer
DeKaRT primitives are key-dependent reversible circuits presented at CHES 2003. According to the author, the circuits described are suitable for data scrambling but also as buildin...
CARDIS
2004
Springer
14 years 3 months ago
2004
Springer
Smart card applications often handle privacy-sensitive information, and therefore must obey certain security policies. Typically, such policies are described as high-level security...