49 citations
- Saarland UniversityDE10 papers
- Max Planck Institute for InformaticsDE5 papers
- KU LeuvenBE2 papers
- Leibniz University HannoverDE2 papers
- Max Planck Institute for Software SystemsDE2 papers
- Max Planck SocietyDE2 papers
- Monash UniversityAU2 papers
- Ruhr University BochumDE2 papers
- Stanford UniversityUS2 papers
- Technical University of MunichDE2 papers
- University of StuttgartDE2 papers
- Zhejiang UniversityCN2 papers
6 papers · 1 filter
Microarchitectural Leakage Templates and Their Application to Cache-Based Side Channels
Ahmad Ibrahim, Hamed Nemati, Till Schlüter +2
The complexity of modern processor architectures has given rise to sophisticated interactions among their components. Such interactions may result in potential attack vectors in te…
Realizable and Context-Free Hyperlanguages
Hadar Frenkel, Sarai Sheinvald
Hyperproperties lift conventional trace-based languages from a set of execution traces to a set of sets of executions. From a formal-language perspective, these are sets of sets of…
On the Privacy Risks of Cell-Based NAS Architectures
Hai Huang, Zhikun Zhang, Yun Shen +3
Existing studies on neural architecture search (NAS) mainly focus on efficiently and effectively searching for network architectures with better performance. Little progress has be…
Deciding Hyperproperties Combined with Functional Specifications
Raven Beutner, David Carral, Bernd Finkbeiner +2
We study satisfiability for HyperLTL with a quantifier prefix, known to be highly undecidable in general. HyperLTL can express system properties that relate mu…
FairSR: Fairness-aware Sequential Recommendation through Multi-Task Learning with Preference Graph Embeddings
Cheng-Te Li, Cheng Hsu, Yang Zhang
Sequential recommendation (SR) learns from the temporal dynamics of user-item interactions to predict the next ones. Fairness-aware recommendation mitigates a variety of algorithmi…
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction
Dániel Marx
Conditional lower bounds based on , the Exponential-Time Hypothesis (ETH), or similar complexity assumptions can provide very useful information about what type of algori…