5699 search results - page 82 / 1140 » Alternating model trees |
146
click to vote
CHES
2007
Springer
15 years 10 months ago
2007
Springer
Replay attacks are often the most costly attacks to thwart when dealing with off-chip memory integrity. With a trusted System-on-Chip, the existing countermeasures against replay r...
166
click to vote
PLANX
2007
15 years 5 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
138
click to vote
CPC
2004
15 years 4 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
120
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
122
click to vote
FMOODS
2007
15 years 5 months ago
2007
We present the first tool that offers dynamic verification of extended traints on UML models. It translates a UML model into an Abstract State (ASM) which is transformed by an AS...