1722 search results - page 300 / 345 » Ontology Formalism Transformation |
RE
2006
Springer
13 years 9 months ago
2006
Springer
Aspect-oriented concepts are currently introduced in all phases of the software development life cycle. However, the complexity of interactions among different aspects and between...
IACR
2011
12 years 8 months ago
2011
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
STOC
2010
ACM
14 years 6 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...