Sciweavers

1357 search results - page 71 / 272
» Compositionality in Graph Transformation
Sort
View
119
Voted
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
15 years 9 months ago
On the Necessity of Rewinding in Secure Multiparty Computation
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
Michael Backes, Jörn Müller-Quade, Domin...
GG
2004
Springer
15 years 8 months ago
Constraints and Application Conditions: From Graphs to High-Level Structures
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
Hartmut Ehrig, Karsten Ehrig, Annegret Habel, Karl...
SAC
2006
ACM
15 years 9 months ago
Evaluation of rule-based modularization in model transformation languages illustrated with ATL
This paper studies ways for modularizing transformation definitions in current rule-based model transformation languages. Two scenarios are shown in which the modular units are id...
Ivan Kurtev, Klaas van den Berg, Fréd&eacut...
153
Voted
CCS
2008
ACM
15 years 5 months ago
Assessing query privileges via safe and efficient permission composition
We propose an approach for the selective enforcement of access control restrictions in, possibly distributed, large data collections based on two basic concepts: i) flexible autho...
Sabrina De Capitani di Vimercati, Sara Foresti, Su...
127
Voted
LOPSTR
2001
Springer
15 years 7 months ago
On Deforesting Parameters of Accumulating Maps
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
Kazuhiko Kakehi, Robert Glück, Yoshihiko Futa...