جست‌وجوی استاد و پژوهشگر

Nir Pitermanمشاهده پروفایل

استاد

• formal verification
• automata theory
• model checking
• +۴ مورد دیگر

Nir Piterman is a Professor in Computer Science at the University of Gothenburg's Department of Computer Science and Engineering. Previously, he was a Lecturer and later Reader (Associate Professor) at the University of Leicester (2010-2019), following postdoctoral research at EPFL (2005-2007) and a Research Fellowship at Imperial College London (2007-2010). PhD from Weizmann Institute of Science (2005), supervised by Amir Pnueli Postdoc at EPFL with Tom Henzinger (2005-2007) Research Fellow at Imperial College London (2007-2010) Lecturer at University of Leicester (2010-2019), promoted to Reader in 2012 Universitets Lektor (Associate Professor) at University of Gothenburg (2019-2021), promoted to Professor in 2021 His research focuses on formal verification, automata theory, and synthesis from temporal specifications. Current work under the ERC Consolidator Project dSynMA extends reactive synthesis to multi-agent systems, exploring frameworks combining message passing and variable sharing, algorithmic analysis of games with partial information, and logic extensions for agent interaction. He has supervised eight PhD students, including Prabhat Kumar Jha (path planning in game solving), David Lidell (automata constructions for LTL with past), and Claudia Cauli (cloud infrastructure security reasoning, 2022), with theses covering program verification, temporal logic, and game algorithms. ERC Consolidator Grant (2021-?, dSynMA) Editor-in-Chief, Formal Methods in System Design Editor, Acta Informatica Nir has taught courses such as Principles of Concurrent Programming (Chalmers, 2019-2025), Advanced C++ Programming (University of Leicester, 2012-2017), and Synthesis from Temporal Specifications (University of Buenos Aires, 2010). He actively recruits PhD candidates and has hosted postdoctoral researchers at multiple institutions.

• Distributed Algorithms
• Programmable Matter
• Bio-inspired Algorithms
• +۵ مورد دیگر

Andrea W. Richa is a President's Professor at Arizona State University (ASU), holding positions in the School of Computing and Augmented Intelligence (SCAI), Barrett Honors College, and multiple research centers including the Biodesign Institute's Center for Biocomputing, Security, and Society. She specializes in distributed algorithms, programmable matter, and bio-inspired computing. Richa has led major research initiatives, including a DoD MURI award and an NSF CAREER Award, and has delivered keynote speeches at top conferences like DISC and LATIN. Her work focuses on self-organizing particle systems, wireless networks, and algorithmic foundations of active matter. Educations: PhD (Computer Science, Carnegie Mellon University, 1998), M.S. (Computer Science, Carnegie Mellon University, 1995), B.S. (Computer Science, Federal University of Rio de Janeiro, Brazil, 1989). Research Interests: Distributed algorithms, programmable matter, bio-inspired systems, wireless communication models, graph algorithms, combinatorial optimization, and resource allocation. She leads the Self-Organizing Particle Systems Lab and is part of SCAI's Theory and Algorithms group. Awards: 2024 ASU Mentorship Award, 2021 Mentor of the Year, 2017 SCAI Research Excellence Award, NSF CAREER Award (1999), and multiple grants including DoD MURI. Her research spans theoretical and applied domains, with over 150 publications in top venues. Grants: Current DoD MURI funding (2019-25), NSF awards on Markov chain algorithms and active matter (2021-25), and prior funding on programmable matter (2014-2017). Labs/Teams: SOPS Lab (sops.engineering.asu.edu), contributing to interdisciplinary research in algorithmic matter and bio-inspired systems.

Zoran Budimlićمشاهده پروفایل

دانشیار

• High Performance Computing
• Parallel Computing
• Compiler Optimizations
• +۳ مورد دیگر

Zoran Budimlić is an Instructional Associate Professor in the Department of Computer Science and Engineering at Texas A&M University. He also serves as Director of Undergraduate Studies for Galveston. His roles include teaching and academic leadership in computer science education and high-performance computing. He holds a Ph.D. in Computer Science from Rice University (2001) and a B.S. in Computer Science and Engineering from the University of Belgrade (1994). His research interests focus on high-performance and parallel computing, compiler optimizations, programming languages, runtime systems, and high-level programming models. He emphasizes improving educational practices in computer science through innovative methods and curricula. His recent publications span parallel algorithms, task parallelism integration with MPI, and compiler optimizations for performance. Earlier work includes contributions to Java runtime optimization and static analysis techniques. Zoran Budimlić has no explicitly listed scientific awards or grants in the provided text, but his contributions to parallel computing and compiler design are notable. He advises students in these areas but no names are provided in the text.

Petr Kuznetsovمشاهده پروفایل

استاد

• Distributed Systems
• Algorithms
• Synchronization
• +۳ مورد دیگر

Petr Kuznetsov is a Professor at Telecom Paris (Institut Polytechnique de Paris), affiliated with the Department of Computer Science and Networks (INFRES). He leads the Autonomous Critical Embedded Systems (ACES) research team at the Information Processing and Communication Laboratory (LTCI). His work bridges theoretical foundations and practical applications in distributed systems. Research Focus: Kuznetsov specializes in distributed algorithms, synchronization protocols, failure detection mechanisms, and the application of algebraic topology to distributed computing. His recent work explores Byzantine fault tolerance, blockchain consensus, and concurrency in networking infrastructures. Recent Publication Trends (2015-2025): His articles predominantly focus on scalability and resilience in distributed systems, with emerging themes in blockchain technologies, Byzantine fault tolerance, and concurrency optimization. Theoretical contributions include computability theorems and complexity bounds, while applied work targets payment systems and distributed ledgers. Awards & Honors: Best Paper Award at DISC 2019 for Scalable Byzantine Reliable Broadcast Best Student Paper Award at PODC 2018 for An Asynchronous Computability Theorem for Fair Adversaries Projects & Advising: He directs the TrustShare Innovation Chair (large-scale data synchronization) and DISCMAT (mathematical foundations of distributed computing). Actively seeks PhD candidates for projects on distributed algorithms and concurrency. Laboratory & Teams: Heads the ACES team at LTCI, focusing on critical embedded systems and fault-tolerant distributed architectures. Collaborates internationally through workshops like SPTDC.

Daniel Fruminمشاهده پروفایل

استادیار

• Logic
• Type Theory
• Program Verification
• +۵ مورد دیگر

Daniel Frumin is an Assistant Professor in the Department of Fundamental Computing Science at the University of Groningen, affiliated with the Bernoulli Institute. His research focuses on Logic, Type Theory, and Program Verification, with a particular emphasis on formal methods for concurrency, type systems, and homotopy type theory. He has contributed to foundational work in denotational semantics, modular programming language design, and mechanized verification of concurrent systems. His expertise includes the application of logical frameworks to concurrency models, such as ReLoC (Relational Logic for Concurrent Programming) and the integration of type theories with operational semantics. Recent work explores guarded interaction trees, interval domains in homotopy type theory, and compositional security properties for fine-grained systems. Frumin has published extensively in top-tier venues like ESOP, CONCUR, and ACM POPL, with peer-reviewed contributions on topics ranging from bunched implications in session-based concurrency to formal verification of data structures like concurrent queues. His research often bridges theoretical computer science and practical formal verification, leveraging tools like Coq for mechanized proofs. Collaborations include projects with institutions such as Aarhus University (Denmark) and the University of Bologna, focusing on univalent foundations, categorical semantics, and security verification. His work is supported by grants from the Dutch Research Council (NWO) and industry partnerships like Meta's Folly Library verification efforts. Labs/Teams: Active contributor to the Bernoulli Institute's Formal Methods Group and the Univalent Foundations initiative. His research group specializes in applying type-theoretic and categorical methods to concurrency and verification challenges.

Vijay K Gargمشاهده پروفایل

استاد

• Distributed Algorithms
• Fault Tolerance
• Multicore Computing
• +۷ مورد دیگر

Vijay K Garg is a Professor at the University of Texas at Austin , holding positions in both the Department of Electrical and Computer Engineering and the Department of Computer Sciences . He serves as the Director of the Parallel and Distributed Systems Laboratory and has made significant contributions to distributed computing. Ph.D. in Electrical Engineering and Computer Science from University of California at Berkeley (1988) M.S. in Electrical Engineering and Computer Science from University of California at Berkeley (1985) B.Tech. in Computer Science & Engineering from Indian Institute of Technology, Kanpur (1984) His research focuses on Distributed Algorithms , Fault Tolerance , Multicore Computing , and Lattice Theory applied to computing problems. He has also contributed to areas like Distributed Debugging , Simulation , and Supervisory Control of Discrete Event Systems . His publications show a consistent focus on applying Lattice Theory to Distributed Systems , with recent work on Predicate Detection algorithms, Lattice Agreement , and applications to problems like Stable Marriage and Matching . His work bridges theoretical computer science with practical implementations in distributed systems. Among his scientific awards are: IEEE Fellow (2004) UT Outstanding Inventor (2011) Best Paper Award at 17th International Conference on Runtime Verification (RV'2017) Best Paper Award at 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems (2010) Dean’s Fellowship at UT Austin (2002) Faculty Research Award at UT Austin (2000) Vijay has served on numerous program committees including ICDCS 2022 , SRDS 2021 , ICDCN 2020 , and DISC 2019 . He has also delivered keynote and invited talks at major conferences.

• Programming Languages
• Formal Verification
• Concurrent and Parallel Systems
• +۱۰ مورد دیگر

Professor Sophia Drossopoulou is a Professor of Programming Languages in the Department of Computing at Imperial College London, part of the Faculty of Engineering. Her affiliations include the Centre for Cryptocurrency Research and Engineering and the Sound Programming Languages research group. She holds a visiting researcher position at Microsoft Research (UK) from May 2019 to May 2020. Her research focuses on foundational programming language design and formal methods, emphasizing concurrency, type systems, and program verification. Key areas include concurrent program reasoning (e.g., TaDA framework), memory management (reference capabilities, garbage collection), and secure systems (smart contracts, cyber-physical systems). She explores practical language extensions for performance optimization (e.g., cache locality) while maintaining safety guarantees through formal verification techniques. Her work spans theoretical contributions (formal semantics, logical frameworks) and applied systems (compilers, runtime verification tools like Zeno). Recent trends show strong engagement with actor-based models (Pony language), digital twins, and cybersecurity challenges in modern software systems. Awards and recognitions are not explicitly listed in the provided text, but her extensive publication record in top venues (ECOOP, POPL, TOPLAS) indicates academic impact. Her advising focuses on graduate students in systems programming and formal methods, though specific student names are not mentioned here. Labs and collaborations involve the Sound Programming Languages group at Imperial College, emphasizing interdisciplinary work between formal methods and practical language implementation. Current projects include improving concurrency semantics and verifying complex systems through compositional reasoning techniques.

• Runtime Verification
• Formal Methods
• Concurrency Theory
• +۷ مورد دیگر

Adrian Francalanza is a Professor in the Department of Computer Science at the Faculty of Information and Communication Technology, University of Malta. His research is centered on formal methods, runtime verification, and concurrency, with a focus on monitorability and distributed systems. His research interests include: Runtime Verification and Monitor Synthesis Session Types and Protocol Safety Concurrency and Actor-Based Systems Branching and Linear-Time Temporal Logics Probabilistic and Decentralized Monitoring Formal Tools for Cyber-Physical and Distributed Systems The recent publications highlight a strong trend in theoretical and practical advances in monitorability, especially for branching-time and probabilistic systems. His work bridges theory with implementation, often resulting in tools like STMonitor and DetectEr. There is a clear emphasis on session types, runtime enforcement, and the verification of communication protocols in real-world systems such as REST APIs and SMTP. Scientific awards include: Distinguished Paper Award at ECOOP 2025 Best Paper Award at DisCoTec 2022 He has been actively involved in advising and organizing major academic events. He served as Program Chair for GandALF 2024 and 2025, FORTE 2024, and VORTEX workshops. He led a three-year project funded by Rannis on Theoretical Foundations for Monitorability in collaboration with Reykjavik University. He has received grants and recognition for developing practical tools such as DetectEr and STMonitor, which support runtime monitoring of Erlang and session-typed systems. He is associated with several research teams and labs, including: Runtime Verification and Monitorability Research Group at University of Malta Collaborators on the DetectEr project Developers of STMonitor and polyLarva tools International collaborators at Reykjavik University and beyond

• Parallel Programming
• Dependently Typed Languages
• Concurrent Systems
• +۳ مورد دیگر

Dr Adam Barwell is a Lecturer and Researcher at the School of Computer Science, University of St Andrews. His research focuses on parallel programming, dependently typed languages, and formal methods in concurrent systems. He advises PhD student Leonid Nosovitskiy and has contributed to projects involving session types, distributed systems, and type-safe refactoring techniques. His educational background includes a PhD (not explicitly detailed here), and he actively engages in academic activities such as organizing events like Doors Open @ Computer Science 2025. Key research themes include concurrency control, functional programming paradigms, and improving code security through dependent types. Recent publications emphasize advancements in parallel language design, fault-tolerant protocols, and type-driven development. Collaborations span international conferences and institutions, reflecting his contributions to both theoretical and applied computer science domains.

Alexey Gotsmanمشاهده پروفایل

استاد پژوهشی

• Distributed Systems
• Software Verification
• Consensus Algorithms
• +۵ مورد دیگر

Alexey Gotsman is a tenured Research Professor at the IMDEA Software Institute in Madrid, Spain, where he leads research at the intersection of software verification and distributed computing. He also works part-time as a visiting academic at Amazon Web Services. His educational background includes a Ph.D. from the University of Cambridge, where he was previously a postdoctoral fellow. His research spans theoretical foundations and practical implementations of distributed systems, with particular emphasis on fault tolerance, consensus algorithms, and consistency models. His research interests focus on the theoretical and practical aspects of distributed systems, including Byzantine fault tolerance, state machine replication, distributed transactions, and consistency models. His work bridges the gap between formal verification techniques and real-world distributed systems implementations, with numerous publications in top-tier venues like PODC, DISC, and NSDI. His recent publications show a clear progression from theoretical foundations to practical implementations, with increasing focus on real-world applications, performance considerations, and fault tolerance in large-scale distributed systems. The research demonstrates strong connections between formal methods and practical system design, particularly in the areas of consensus protocols, replication strategies, and transaction processing. Best paper award at OPODIS'23 Best paper award at DISC'18 Best paper award at CONCUR'12 EAPLS Best Dissertation Award Runner-up prize in the BCS Distinguished Dissertation Competition ERC Starting Grant 'RACCOON: A Rigorous Approach to Consistency in Cloud Databases' (2017-2022) Ramón y Cajal Fellowship (2017-2022) Alexey actively mentors PhD students including Alejandro Naser Pastoriza, Fedor Ryabinin, and Antonio José Fernández Pinto, while his alumni have gone on to faculty positions at institutions like University of Paris 7 and University of Colorado Boulder, as well as industry roles at companies like ARM and Informal Systems. He has received significant funding including an ERC Starting Grant and served on program committees for numerous top conferences including POPL, DISC, and PODC. He currently co-organizes the International Symposium on Distributed Computing (DISC) and has been instrumental in organizing workshops focused on consistency in distributed systems. His research group at IMDEA Software Institute focuses on developing rigorous approaches to consistency in cloud databases and distributed systems, with active projects spanning theoretical analysis, protocol design, and practical implementation of fault-tolerant distributed systems.

• Distributed Systems
• Fault-Tolerant Computing
• Asynchronous Algorithms
• +۳ مورد دیگر

Prof. Ulrich Schmid is a full professor at TU Wien, affiliated with the Forschungsbereich Embedded Computing Systems. His research focuses on distributed systems, fault-tolerant computing, and asynchronous algorithms. He leads projects like 'Asynchronous Distributed Algorithms in the Theta-Model' and 'Gracefully Degrading Agreement in Directed Dynamic Networks.' Prof. Schmid has received honors at TU Wien and actively supervises numerous students in PhD and Master's programs. His academic work spans theoretical foundations (e.g., epistemic logic in Byzantine systems) and practical applications (e.g., digital circuit delay modeling). Key contributions include hybrid delay models for integrated circuits and formal verification frameworks for timed circuits. Collaborations involve institutions like the Institut für Technische Informatik and the E191-02 research group. Notable research areas: Byzantine fault tolerance, consensus protocols, and embedded systems Leadership in 4 major projects addressing distributed computing challenges Recipient of TU Wien honors (2021) Prof. Schmid's lab emphasizes bridging theoretical computer science with hardware-software co-design, producing over 220 publications and 10+ supervised theses since 2000.

• High-Performance Computing
• Parallel Programming
• Computer Architecture
• +۳ مورد دیگر

Prof. Dr. rer. nat. Matthias S. Müller is a Universitätsprofessor and Director of the IT Center at RWTH Aachen University. His research focuses on High-Performance Computing (HPC), parallel programming models, correctness verification, energy-aware computing, and tools for distributed systems. He leads the High-Performance Computing group, contributing to advancements in HPC resource management, runtime systems, and sustainable computing practices. Key areas of expertise include MPI and OpenMP correctness checking, static and dynamic analysis techniques, performance optimization for heterogeneous architectures, and energy footprint modeling. Müller has extensively collaborated on projects like MUST (MPI correctness tool), OMPT tools, and frameworks for analyzing hybrid parallel applications. His work bridges theoretical computer science with practical implementation challenges in large-scale computing environments. Notable contributions include developing methods for data race detection in Remote Memory Access (RMA) programs, latency-aware power management models, and educational frameworks for HPC lab courses. His research often emphasizes tool development, runtime systems, and interdisciplinary applications of HPC across engineering domains. Müller's lab is part of RWTH Aachen's IT Center, which provides infrastructure and expertise for computational research. He actively publishes in top-tier conferences and journals, addressing challenges in parallel programming, energy efficiency, and distributed computing systems.

• Programming Languages
• Refactoring
• Parallel Programming
• +۵ مورد دیگر

Dr. Christopher Mark Brown is a Lecturer in the School of Computer Science at the University of St Andrews. He holds a PhD in Computer Science from the University of Kent. His research focuses on programming languages, parallelism, and energy-efficient software development, with a particular emphasis on refactoring techniques and their application to embedded systems. **Education**: Doctor of Philosophy (2010), University of Kent, specializing in Tool Support for Refactoring Haskell Programs. **Research Interests**: Parallel programming, refactoring tools (e.g., ParaFormance), energy-aware applications, and compiler optimizations. He leads EPSRC-funded projects like Energise (2021–2024) and EU-funded TeamPlay (2018–2021), developing energy-efficient parallel programming frameworks. His work contributes to Sustainable Development Goals related to energy efficiency and innovation. **Teaching**: Undergraduate courses include CS3050 Logic and Reasoning, CS4201 Programming Language Design, and CS4204 Concurrency. Postgraduate modules include CS5031 Software Engineering Practice. **Grants & Projects**: Principal Investigator on EPSRC Energise (refactorings for energy optimization) and EU TeamPlay (non-functional properties in parallel software). Developed open-source tools like Skel (Erlang parallel patterns) and ParaFormance (C/C++ refactoring). **Labs/Teams**: Member of the Programming Languages Group at St Andrews. Collaborates on commercializing refactoring tools through spin-out ventures.

• Concurrency
• Real-Time Systems
• Distributed Systems
• +۳ مورد دیگر

Lukasz Ziarek is an Associate Professor in the Department of Computer Science and Engineering at the University at Buffalo, and serves as the Associate Dean for Academic Affairs in the School of Engineering and Applied Sciences. His research focuses on concurrency, real-time systems, distributed systems, and formal verification. He holds a PhD from Purdue University (2011) and a BS from the University of Chicago (2003). His research explores topics such as real-time Java implementations, session types for distributed protocols, and visual debugging techniques. Recent work includes formal models for secure multiparty computation, IoT device validation, and optimizing visual SLAM systems for robotics applications. He has contributed to frameworks like Juav (a Java-based UAV autopilot) and RTDroid (a real-time Android extension). Ziarek has received notable awards including the 2023 IEEE Technological Innovation Award, 2022 Meyerson Teaching Award, and 2018 NSF CAREER Award. His grants include collaborative research on UAV software infrastructure and real-time communication protocols. He actively develops tools like PTDETECTOR for JavaScript library analysis and Anodize for mixed-criticality systems. His work integrates formal methods with practical systems, addressing challenges in embedded systems security, compiler optimization, and real-time programming language design. He maintains a lab focused on advancing reliable software for autonomous systems and distributed computing environments.

• Parallel Programming
• Distributed Systems
• Functional Programming
• +۳ مورد دیگر

Professor Phil Trinder is a Professor of Computing Science at the University of Glasgow's School of Computing Science. He leads the Glasgow Parallelism Group (GPG) and is a member of the Glasgow Systems Section (GLASS) and the Scottish Programming Languages Seminar (SPLS). His research focuses on parallel and distributed programming models, functional programming, and applications in computational algebra. Trinder holds a DPhil from Oxford University and has over 100 publications. He has led 12 major research projects as Principal Investigator and coordinated EU projects. Collaborations include Ericsson, Maplesoft, Microsoft, and Motorola. His work emphasizes scalable distributed systems, actor-based platforms, and reliable computation. Notable contributions include the SymGridPar framework for computational algebra and research on Erlang scalability. He also explores IoT architectures and tierless programming languages. Key projects include improving Erlang's network scalability and developing frameworks for exact combinatorial search (YewPar). He has supervised numerous researchers and contributed to high-performance systems like HPC-GAP.