-
to advance knowledge in the following domains: Formal verification and interactive theorem proving (Rocq, Lean) Secure and high-performance computer systems, including ML infrastructure We seek outstanding
-
extensions, and scalable verification via symbolic automata and related decision procedures Routing algebras: composable, algebraic representations of distributed routing protocols, as a principled basis for
-
and in computer architecture domains, our ability to analyze data still falls behind the unstoppable data collection rates. Data-intensive applications are increasingly more demanding in sophisticated
-
. Scalable AI training: distributed training, efficient fine-tuning, evaluation, and deployment on large-scale compute. Multimodal learning: representation learning and generative modeling across heterogeneous