جستجوی استاد راهنمای دانشگاهی

Joseph Eremondiمشاهده پروفایل

استادیار

• Programming Languages
• Type Theory
• Dependent Types
• +۱۲ مورد دیگر

Joseph Eremondi is an Assistant Professor in the Department of Computer Science at the University of Regina, Faculty of Science, Canada. He began his tenure in 2024 after serving as a Royal Society Newton International Fellow at the University of Edinburgh, where he conducted postdoctoral research with Ohad Kammar in the Laboratory for Foundations of Computer Science. He earned his PhD from the University of British Columbia (UBC) under the supervision of Ron Garcia at the UBC Software Practices Laboratory. His research is centered on programming languages theory, with a strong focus on type systems that enhance software reliability and usability. He is particularly known for his work in dependent types, gradual typing, and the integration of both paradigms. His research interests include: Dependent pattern matching and its semantic foundations Gradual dependent types and approximate normalization Error message generation and usability in dependently typed languages Static analysis using set constraints and SMT solvers Theoretical properties of reversal-bounded counter automata and shuffle operations His recent publications, appearing in premier venues like POPL, ICFP, and CPP, reflect a consistent trajectory toward making advanced type systems more accessible and practical. Key themes include coverage semantics for dependent pattern matching, formal models of gradual dependent typing, and improving the developer experience through better tooling and error diagnostics. Notable scientific recognitions include the NSERC Discovery Grant (awarded in 2025) and the prestigious Royal Society Newton International Fellowship. These awards underscore the impact and promise of his research program on the usability of dependently typed programming languages. Joseph is actively mentoring and recruiting graduate students, particularly in areas such as dependently typed programming (Lean, Agda, Idris, Coq), gradual typing, live programming environments, and static analysis. He emphasizes close collaboration within a small, focused research group. He has also served on program committees, including for TyDe and POPL Artifact Evaluation, demonstrating active engagement in the programming languages community. His work bridges theoretical rigor with practical implementation, evident in his artifact releases on GitHub and integration with tools like Ott and DrRacket. He maintains a personal website and open-source repositories that support reproducibility and community involvement.

Jelle Hellingsمشاهده پروفایل

استادیار

• Resilient Systems
• High-Performance Data Management
• Database Theory
• +۱۰ مورد دیگر

Jelle Hellings is an Assistant Professor in the Department of Computing and Software at McMaster University , Canada. His research focuses on high-performance large-scale data management systems with a strong theoretical and algorithmic component, including resilient systems (blockchains) , graph databases , and external-memory algorithms . He previously worked as a Postdoc Scholar at the University of California, Davis and earned his PhD from Hasselt University in Belgium. Education: Doctor of Sciences in Computer Science (2018), Hasselt University Master of Science in Computer Science and Engineering (2011), Eindhoven University of Technology His research interests include scalable resilient systems with Byzantine fault tolerance, database theory, graph query languages, constraints on graph data, and external-memory algorithms for large graph datasets. He has authored numerous high-impact publications on blockchain-based resilient systems, query optimization in graph databases, and theoretical advancements in relation algebra expressiveness. Hellings actively contributes to academic service through program committee memberships and tutorial organization, and he currently teaches courses on future resilient databases and foundational computer science topics.

Sanjay Jainمشاهده پروفایل

استاد

• Inductive Inference
• Recursion Theory
• Complexity Theory
• +۳ مورد دیگر

Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.

Manfred Drosteمشاهده پروفایل

استاد

• Theoretical Computer Science
• Automata Theory
• Logic
• +۶ مورد دیگر

Manfred Droste is a Professor at the Institute of Computer Science of the University of Leipzig, where he leads the Research Group on Automata and Formal Languages. He serves as Director of the Graduate Centre Mathematics, Computer Science and Natural Sciences and is Vice-speaker of the DFG-Research Training Group Quantitative Logics and Automata. His academic career spans decades of research and leadership in theoretical computer science and algebra. Prof. Droste's research focuses on theoretical computer science, particularly automata theory, logic, algebraic models for concurrent systems, and domain theory. In algebra, his interests include model theory, automorphism groups, and ordered algebraic structures. His work bridges theoretical foundations with practical applications in formal language theory and quantitative systems. His extensive publication record demonstrates a consistent focus on weighted automata, formal languages, and their logical characterizations. Over the years, his research has evolved to address increasingly complex quantitative models, with recent work focusing on weighted complexity classes, weighted linear dynamic logic, and decidability boundaries for weighted automata. Prof. Droste has received significant recognition including election to Academia Europaea, an honorary doctorate from Immanuel Kant Baltic Federal University, and fellowship in the Asia-Pacific Artificial Intelligence Association. These honors reflect his substantial contributions to theoretical computer science. He has supervised numerous PhD students including Dietrich Kuske, Paolo Boldi, and Karin Quaas, many of whom have become prominent researchers. His extensive grant portfolio includes multiple DFG projects on weighted automata and international collaborations through DAAD funding. Prof. Droste leads a vibrant research team including Andrea Hesse, Karin Quaas, Erik Paul, and others. He has organized the international workshop series "Weighted Automata: Theory and Applications" since 2002, fostering global collaboration in this specialized field.

• Type Theory
• Dependent Types
• Functional Programming
• +۱۱ مورد دیگر

Andreas Abel is a Senior Lecturer in the Division of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology and the University of Gothenburg. He has previously served as an Assistant Professor at Ludwig-Maximilians-Universität (LMU) Munich and has been a visiting researcher at INRIA in Paris. His primary affiliations are with Chalmers and the University of Gothenburg, where he conducts research and teaches in programming languages and type theory. Chalmers University of Technology, Department of Computer Science and Engineering, Senior Lecturer University of Gothenburg, Division of Computing Science LMU Munich, Assistant Professor (former) INRIA Paris, Visiting Researcher Abel’s research lies at the intersection of type theory, functional programming, and formal verification. He is particularly known for his work on dependent types, normalization by evaluation, and the development of the Agda proof assistant. His interests include constructive logic, logical frameworks, modal and linear typing, program verification, and compiler construction. He leads the Modal Dependent Type Theory project funded by the Swedish Research Council (Vetenskapsrådet) and has contributed to several other major research initiatives in programming language theory. His recent publications reflect a strong focus on foundational aspects of type systems, including cubical type theory, decidability of conversion, and formalization of algebraic completeness. These works appear in top-tier venues such as ICFP, LICS, POPL, and TYPES, showcasing both theoretical depth and practical implementation in Agda. Distinguished Paper Award, ICFP 2019 Editor, Theoretical Pearls column, Journal of Functional Programming Member, IFIP WG 1.3 on Foundations of System Specification Abel actively supervises students and contributes to the research community through program committee memberships for major conferences including LICS, ICFP, and CPP. He is a senior developer of Agda and the maintainer of the BNFC (Backus-Naur Form Compiler) tool. His work bridges theoretical computer science with practical software development for formal methods. He is involved in several research groups and projects, including the Programming Logic Group at Chalmers and the international EUTYPES network. His role as principal investigator and core contributor in multiple funded projects highlights his leadership in the field of programming language foundations.

Lars Kristiansenمشاهده پروفایل

استاد

• Mathematical Logic
• Computability Theory
• Complexity Theory
• +۴ مورد دیگر

Lars Kristiansen is Professor II (part-time Professor) at the Department of Mathematics, University of Oslo . His research centres on the intersection of mathematical logic, computability theory, and computational complexity, with recent emphasis on computable analysis, weak first-order theories, subrecursive degree structures, and implicit computational complexity. Research Interests Computable Analysis: Representations and computational complexity of irrational and real numbers. Weak First-Order Theories: Decidability, interpretability and fragments of concatenation theories. Subrecursive Degree Theory: Fine structure of honest subrecursive degrees and the Grzegorczyk hierarchy. Implicit Computational Complexity: Reversible computing, type systems that capture complexity classes, and resource-bounded program analysis. Across more than 50 refereed publications since 1996, a clear trend emerges: an early focus on subrecursive hierarchies and honest degrees evolved into an intensive study of the computational content of real number representations and the logical strength of weak arithmetics. Recent work (2023-2025) deepens this agenda, analysing the complexity of converting between alternative representations of reals and the degree structures that these induce. Scientific Output While no named awards are listed, Kristiansen’s contributions are disseminated in top venues such as Bulletin of Symbolic Logic , Annals of Pure and Applied Logic , Archive for Mathematical Logic , Science of Computer Programming , and leading LNCS conferences. His work is frequently co-authored with Amir Ben-Amram, Jakob Grue Simonsen, Juvenal Murwanashyaka, Ivan Georgiev, and Neil D. Jones, indicating active collaborative networks in both logic and theoretical computer science. Research Groups & Collaborations Logic research group at the University of Oslo Data and Knowledge Management (DKM) group

• Cellular Automata
• Computational Dynamics
• Theoretical Computer Science
• +۴ مورد دیگر

Martin Delacourt is a Lecturer at the University of Orléans, affiliated with the LIFO (Laboratoire d'informatique fondamentale d'Orléans). He earned his PhD on December 5, 2011, under the joint supervision of Bruno Durand and Victor Poupet at LIF Marseille. His research focuses on cellular automata, including directional dynamics, limit sets, and decidability of computational problems. PhD: University of Montpellier 2 (2011) ENS Lyon: Bachelor (2006), Master (2008) His research explores cellular automata through computational complexity, symbolic dynamics, and formal verification. Key themes include limit set characterization, defect dynamics, and algorithmic properties of number systems. He has published in conferences like AUTOMATA, MFCS, and CiE. Teaching responsibilities include courses in network engineering, computability, complexity theory, operating systems, and algorithm analysis at the University of Orléans. He has supervised work-study students in the MIAGE program since 2018.

• Program Verification
• Program Synthesis
• Concurrency
• +۳ مورد دیگر

Roopsha Samanta serves as an Assistant Professor in the Department of Computer Science at Purdue University, where she leads the Purdue Formal Methods (PurForM) research group and participates in the Purdue Programming Languages (PurPL) initiative. Her academic foundation includes a PhD from the University of Texas, Austin (2013) and postdoctoral research at the Institute of Science and Technology Austria prior to joining Purdue in 2016. Education: PhD in Computer Science, University of Texas, Austin (2013) Postdoctoral Researcher, Institute of Science and Technology Austria Professor Samanta's research centers on bridging formal methods with programming languages to enhance software reliability, with core expertise in program verification, program synthesis, and concurrency. Her work uniquely targets both professional developers and non-programmers, developing techniques to ensure programs align with user intent through automated reasoning and synthesis. Recent efforts focus on distributed systems verification where traditional methods face scalability challenges. Analysis of her 2020-2024 publications reveals a dominant trajectory in distributed agreement systems, particularly advancing parameterized verification for unbounded process networks. Key innovations include bounded verification techniques for doubly-unbounded systems, explainable synthesis through specification localization, and secure multi-party computation frameworks like HACCLE. Her work consistently integrates theoretical formal methods with practical system implementation. Scientific Awards: NSF CAREER Award (2019) for “Robustness of Inductive Reasoning Engines” Amazon Research Award (2021) supporting secure computation research Her research is primarily funded through competitive grants including the NSF CAREER award and Amazon Research Award, enabling exploration of verification robustness and secure multi-party computation. While specific advising details aren't publicly documented, her leadership of the PurForM group indicates active mentorship of graduate researchers in formal methods. Current projects suggest expanding applications to privacy-preserving technologies and explainable AI-assisted programming. The PurForM research group, under her direction, develops foundational tools for program verification and synthesis with emphasis on distributed and concurrent systems. Collaborations within PurPL and industry partners like Amazon drive translational research from theoretical models to practical verification frameworks applicable to real-world distributed infrastructure.

• Formal Methods
• Verification
• Model Checking
• +۴ مورد دیگر

Nathalie Bertrand is an Inria Researcher and Head of the DEVINE team at Inria Centre Rennes and IRISA lab. She co-heads the working group on Verification of the GDR IFM of the CNRS with Pierre-Alain Reynier, and co-leads the gender equality commission of IRISA and Inria Rennes with Elisa Fromont. She is also an active member of the Inria committee on gender equality and equal opportunity. PhD from ENS Cachan (October 2006) 1-year post-doc at TU Dresden Hired as Inria researcher (October 2007) Habilitation (HDR) from University Rennes 1 (November 2015) Dr. Bertrand's research focuses on formal methods, verification, model checking, parameterized systems, quantitative models, automata, and games. Her work bridges theoretical computer science with practical applications in distributed systems, probabilistic verification, and game theory. She develops efficient model-based formal methods to verify and enforce functional and non-functional properties of dependable distributed systems that include quantitative aspects such as time, cost, or probabilities. Her recent publications demonstrate a strong trend toward parameterized verification of distributed algorithms, probabilistic systems, and game-theoretic approaches to verification problems. Her research has evolved from foundational work on timed automata and probabilistic systems to increasingly complex problems involving distributed algorithms with arbitrary numbers of participants, blockchain consensus, and randomized fault-tolerant systems. Dr. Bertrand serves on the editorial boards of JLAMP and TCS, and has been a program committee member for numerous prestigious conferences including STACS, TACAS, Concur, QEST, LICS, FoSSaCS, ICALP, MFCS, and many others. She has co-chaired program committees for Formats'20, QEST'17, QAPL'14, and QAPL'15. As an advisor, she has supervised numerous PhD students including Nicolas Waldburger, Bastien Thomas, Suman Sadhukhan, Anirban Majumdar, Engel Lefaucheux, Paulin Fournier, and Amélie Stainer. She currently supervises postdoc Gaëtan Staquet and PhD candidates Pranav Ghorpade, Luca Paparazzo, and Luc Lapointe. She leads the DEVINE project-team (created January 2024), which focuses on developing efficient model-based formal methods to verify and enforce properties of dependable distributed systems with quantitative aspects. Previously, she was part of the SUMO team. Her current projects include ANR MAVeriQ (2021-2025), ANR BISouS (2022-2025), and ANR PaVeDyS (2024-2028).

Sylvain Lombardyمشاهده پروفایل

استاد

• Automata Theory
• Formal Languages
• Theoretical Computer Science
• +۳ مورد دیگر

Sylvain Lombardy is a Professor at the University of Bordeaux, affiliated with the Laboratoire Bordelais de Recherche en Informatique (LaBRI) and the Enseirb-Matmeca engineering school within the Institut Polytechnique de Bordeaux. His research focuses on automata theory, formal languages, and theoretical computer science, particularly in weighted automata, formal methods, and algebraic properties of automata. He leads the Formal Methods research team at LaBRI and contributes to projects like the Awali and Vaucanson software platforms for automata manipulation. Education: PhD in Computer Science (2001, ENST Paris), Habilitation à Diriger des Recherches (2005, University of Paris Diderot). His work bridges theoretical foundations with practical tools, emphasizing algorithmic and algebraic aspects of automata. Notable contributions include studies on automata minimization, determinization, and the interplay between rational expressions and automata constructions. Research Interests: Automata Theory, Formal Power Series, Weighted Automata, Tropical Semirings, Algebraic Automata Theory, and Computational Models for Discrete Systems. His recent work explores two-way automata, Hadamard series, and applications in formal verification. Publications highlight contributions to the structure and properties of automata, with a focus on formal methods and algorithmic decidability. Key works address unambiguity, determinism, and the minimization of weighted automata across various semirings. Collaborations include projects on automata-based kernels for machine learning and XML formats for automata descriptions. He has developed influential software tools such as Awali (finite-state machine platform) and Vaucanson (automata manipulation framework), demonstrating practical applications of theoretical research. His work is supported by grants exploring automata in computational linguistics and discrete mathematics.

• Databases
• Web Data Management
• Logical Methods in Computer Science
• +۴ مورد دیگر

Michael Benedikt is a Professor of Computer Science at the University of Oxford and a Governing Body Fellow of University College. He holds the role of Director of the Advanced MSc in Computer Science program. His research focuses on databases, Web data management, logical methods in computer science, and theoretical computer science. Benedikt's work intersects with artificial intelligence, machine learning, and algorithms, with contributions to query languages, data integration, and formal methods. Education: Ph.D. in Mathematics, University of Wisconsin, 1993 Prior roles: Distinguished Member of Technical Staff at Bell Laboratories (1994–2006), visiting researcher at Yahoo! Labs Research Interests: Databases and information exchange Web and Web 2.0 data management Logical methods in computer science Formal verification and query optimization Applications in AI and machine learning Key Projects: FOX : Query-driven data acquisition from web-based sources PDQ : Proof-driven query answering over web-based data TRANCE : Transforming nested collections efficiently Awards: Best Paper Award at ICALP 2017 (Track B) EPSRC Established Career Fellowship (2015–2020) Advising & Grants: Directed the MSc in Advanced Computer Science program Supervised PhD students including Chia-Hsuan Lu and past advisees such as Luying Chen and Ben Spencer Received funding for projects like the ERC DIADEM initiative Labs & Teams: Active in the Department of Computer Science’s research groups, including the Algorithms At Large and Databases teams.

Jens Palsbergمشاهده پروفایل

استاد

• Programming Languages
• Quantum Computing
• Software Engineering
• +۳ مورد دیگر

Jens Palsberg is a Professor and former Department Chair of Computer Science at the University of California, Los Angeles (UCLA), where he currently serves as Director of the UCLA-Amazon Science Hub for Humanity and Artificial Intelligence and co-director of UCLA's quantum research center. He chairs ACM SIGPLAN and is a member of the ACM Council. His research spans programming languages, software engineering, quantum computing, compilers, embedded systems, and information security. Palsberg has authored over 80 technical papers, co-authored the book Object-Oriented Type Systems , and revised Appel's textbook on Modern Compiler Implementation in Java . His recent work shows a significant shift toward quantum computing, including compiler techniques and program analysis for quantum systems. Analysis of his recent publications reveals a clear transition from traditional programming language research to quantum computing, with nearly half of his 2022-2024 publications focusing on quantum topics while maintaining strong work in software engineering and programming languages. His quantum research particularly emphasizes compiler optimization, abstract interpretation, and circuit analysis. ACM SIGPLAN Distinguished Service Award (2012) UCLA teaching award for quantum computing courses (2023) National Science Foundation CAREER and ITR awards Purdue University Faculty Scholar award IBM Faculty Award Okawa Foundation research award Palsberg has served in numerous leadership roles including general chair of POPL, conference chair of LICS, and vice chair of ACM SIGBED. His research has been supported by DARPA, Intel, British Telecom, and the National Science Foundation. He was instrumental in establishing UCLA's Masters degree in quantum science and has mentored numerous students through his legendary proof sessions. He leads a research group of over 30 professors in UCLA's quantum research center and maintains active collaborations across academia and industry, particularly with Amazon through the UCLA-Amazon Science Hub.

Umang Mathurمشاهده پروفایل

استادیار

• Formal Methods
• Concurrency
• Programming Languages
• +۴ مورد دیگر

Umang Mathur is an Assistant Professor at the National University of Singapore's School of Computing, where he leads the FOCS Lab and is affiliated with PLSE@NUS. His research focuses on Formal Methods , Concurrency , and Decidability in Programming Languages and Software Engineering . PhD in Computer Science from the University of Illinois at Urbana-Champaign (advisor: Prof. Mahesh Viswanathan) Former Research Scientist at Facebook Inc. and Research Fellow at the Simons Institute Recipient of Google PhD Fellowship, 2024 CPP Distinguished Paper Award, 2023 ACM SIGPLAN Award, and ASPLOS 2022 Best Paper Award His recent work explores algorithmic techniques for detecting concurrency bugs , decidable program verification , and synthesis , with a focus on weak memory models, predictive monitoring, and automata-theoretic approaches. Articles span topics like causal concurrency, tree clock data structures, and probabilistic counting algorithms, reflecting interdisciplinary intersections of logic and systems research. Scientific Awards Google PhD Fellowship 2024 CPP Distinguished Paper 2023 ACM SIGPLAN Distinguished Paper 2022 ASPLOS Best Paper 2018 ESEC/FSE Distinguished Paper He advises PhD students in Formal Methods and supervises teams in the FOCS Lab. Teaching includes advanced modules on Automata Theory, Logic, and Verification at NUS.

• Discrete-event systems
• Control theory
• Petri net modeling
• +۶ مورد دیگر

Ramavarapu S Sreenivas is a Professor in the Industrial and Enterprise Systems Engineering department at the University of Illinois at Urbana-Champaign , with research appointments at the Coordinated Science Laboratory (CSL) and the Information Trust Institute (ITI ). He holds a joint affiliation with the Electrical and Computer Engineering department and serves as the Arthur Davis Faculty Scholar since 2016. Ph.D. , Electrical and Computer Engineering, Carnegie Mellon University (1990) M.S.E.E. , Carnegie Mellon University (1987) B.Tech , Electrical Engineering, Indian Institute of Technology Madras (1985) His research focuses on Discrete-Event/Discrete-State (DEDS) systems , applying Coding Theory, Machine Learning, and Information Theory to develop near-optimal supervisory policies for applications in wireless networks, automated manufacturing, and healthcare systems . He leads the Center for Autonomous Construction and Manufacturing at Scale (CACMS) , established in 2023. Recent publications highlight advancements in liveness enforcement in Petri nets , fault-tolerant control , and IoT-based load scheduling . His work bridges theoretical rigor with practical implementations in Distributed Control, Network Coding , and Reinforcement Learning . UIUC Campus Award for Excellence in Graduate and Professional Teaching (2023) Arthur Davis Faculty Scholar (2016) Senior Member, IEEE (2002) James Franklin Sharp Outstanding Teaching Award in Industrial Engineering (2017, 2012) Sreenivas has taught graduate and undergraduate courses in Control Systems, Integer Programming, and Financial Computing since 1992. He co-instructed courses in Health Technology and contributed to the Master of Science in Financial Engineering (MSFE) program, which ranks 4th nationally.

Bala Ayikudi Ramachandrakumarمشاهده پروفایل

پژوهشگر

• Parameterized Verification
• Automata Theory
• Formal Verification
• +۴ مورد دیگر

Bala Ayikudi Ramachandrakumar is a post-doctoral researcher at the Max Planck Institute for Software Systems (MPI-SWS), working under Rupak Majumdar. He holds a Ph.D. from the Technical University of Munich, advised by Prof. Javier Esparza. His research focuses on parameterized verification, automata theory, and formal methods applied to cyber-physical systems and distributed computing. Key interests include the analysis of threshold automata, VASS models, and well-quasi orders. Education: Ph.D. in Computer Science (2019–2024), Technical University of Munich; Prior academic background not explicitly detailed. Research Interests: Parameterized Verification, Automata Theory, Formal Verification, Theoretical Computer Science, Cyber-Physical Systems, and Distributed Systems. His work bridges foundational theory with practical verification challenges in concurrent and networked systems. Publications (2024–2018): Recent work includes decidability results for affine continuous VASS and complexity analyses of threshold automata. Over 15 peer-reviewed articles in top venues like LICS, POPL, and CONCUR. Grants and Awards: None explicitly listed in provided texts.