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

Manos Kapritsosمشاهده پروفایل

دانشیار

• Distributed Systems
• Formal Verification
• Fault-Tolerant Replication
• +۳ مورد دیگر

Manos Kapritsos is an Associate Professor in the Department of Computer Science & Engineering at the University of Michigan, Ann Arbor. His research focuses on increasing the reliability of distributed systems through formal verification, fault-tolerant replication, and automated proof techniques. He has contributed to projects such as Aegean (replication beyond client-server models), I4 (automated inductive invariant inference), and Armada (concurrent code verification). His work emphasizes practical applications of formal methods to ensure system correctness and performance. Education details are not explicitly provided in the text, but his career trajectory suggests advanced academic training in computer science. His research interests include distributed systems, formal verification of protocols, and high-performance systems. Notable awards include the NSF CAREER Award (2021), Google Faculty Award (2017), and Distinguished Paper Awards at PLDI 2020 and USENIX Security 2017. Teaching includes courses on formal verification, operating systems, and distributed systems, reflecting his expertise in systems software. He has advised students through his GLaDOS research group, though specific advisee names are not listed. Key grants include NSF FMitF and Large grants to advance verification techniques for distributed systems. Recent articles focus on automating proofs for undecidable protocols (Basilisk), efficient replication communication (Scrooge), and formal latency analysis (Performal). His work bridges theory and practice, aiming to simplify end-to-end verification of complex systems.

I-Ting Angelina Leeمشاهده پروفایل

دانشیار

• Parallel Computing
• Software Technologies
• Programming Models
• +۴ مورد دیگر

I-Ting Angelina Lee is an Associate Professor in the Department of Computer Science & Engineering at Washington University in St. Louis, affiliated with the McKelvey School of Engineering. She joined the university in 2014 after postdoctoral work at MIT's Supertech group under Charles Leiserson. Her research focuses on advancing software technologies for parallel computing, including programming models, runtime systems, and debugging tools for multithreaded applications. Education: PhD, Massachusetts Institute of Technology, 2012 SM, Massachusetts Institute of Technology, 2012 BS, University of California, San Diego, 2003 Research Interests: Parallel computing, programming models, runtime systems optimization, and software tools for performance engineering. Her work bridges theoretical and applied aspects to simplify parallel programming challenges. Awards: Best Paper Award (2012 SPAA) NSF CAREER Award (2020) Grants & Projects: Led an NSF-funded project on cloud platform application optimization (2020) and collaborated in a multi-institutional study on interactive parallel computing applications (2021). Labs & Teams: Directs a research lab exploring parallel computing infrastructure, with work accessible via her lab website and Google Scholar profile .

• Software Verification
• Formal Methods
• Program Synthesis
• +۴ مورد دیگر

Madhusudan Parthasarathy is a Professor in the Department of Computer Science at the University of Illinois at Urbana-Champaign, College of Engineering. His research focuses on software verification, formal methods, and logic in computer science, with significant contributions to trustworthy AI systems, program synthesis, and security. Ph.D. in Theoretical Computer Science (2002), Institute of Mathematical Sciences, University of Madras Research interests include automating software verification, building correct-by-design systems, and exploring synergies between machine learning and program synthesis. He pioneered visibly pushdown languages , impacting XML processing and program verification. His tools like VEX and Strand advanced security and heap reasoning. Recent articles focus on blockchain verification, timed automata, and learning logics from data. His work has been widely cited, with the visibly pushdown language paper alone generating over 940 scholarly entries. Best Paper Award, 19th USENIX Security Symposium (2010) He has advised numerous students and postdocs, with former advisees now at institutions like Purdue University and Google. His outreach initiatives include the ConTraIL privacy-preserving contact tracing project and the MASSIVELY EMPOWERED CLASSROOMS MOOC platform for Indian undergraduates. He teaches courses like CS 521: Advanced Topics in Programming Systems and CS 474: Logic in Computer Science , while actively serving on program committees for top-tier conferences such as POPL and PLDI.

• High-performance Computing
• Energy-efficient Computing
• Machine Learning
• +۳ مورد دیگر

Dr. Ngoc Nha Vi Tran is an Associate Professor of Computer Science at UiT The Arctic University of Norway. She holds a PhD from UiT and was a visiting scholar at Rutgers University, USA. Her research focuses on high-performance and energy-efficient computing, machine learning, and bioinformatics. She is a member of the NORA.startup Steering Group and leads the Arctic Green Computing Group. Education: PhD in Computer Science (UiT), M.Sc. in Software Engineering via Erasmus Mundus (Blekinge Institute of Technology, Sweden & Technical University of Kaiserslautern, Germany). Research interests include energy-efficient algorithms, bioinformatics tools (e.g., vCOMBAT), and applications of machine learning in healthcare and robotics. She teaches courses such as INF-2200 Computer Architecture, INF-2900 Software Engineering, and INF-2202 Concurrent Programming. Her work spans computational models for antibiotic target-binding, runtime energy optimization (REOH framework), and power models for embedded systems (RTHpower/ICE). She contributed to the EXCESS project on energy-efficient computing systems. Labs/Teams: Arctic Green Computing Group, EXCESS consortium.

Nikolaos Papaspyrouمشاهده پروفایل

استاد

• Programming Languages
• Software Engineering
• Formal Verification
• +۴ مورد دیگر

Nikolaos Papaspyrou is a Professor at the School of Electrical and Computer Engineering of the National Technical University of Athens (NTUA) and a member of the Software Engineering Laboratory . His research focuses on the theory and implementation of programming languages, including semantics, type systems, compilers, static analysis, and formal verification. Since October 2021, he has been on leave from NTUA, working as a Software Engineer for Google in the memory management team for the V8 JavaScript and WebAssembly engine. He previously served as Director of the Division of Computer Science (2017-2019) and was on sabbatical with Google's compiler group in Munich (2015-2016). His work includes the RELEASE project (EU FP7 STREP) for reliable large-scale server software and uncertainty handling in distributed databases (European Social Fund). Ph.D. and Diploma in Electrical and Computer Engineering from NTUA M.Sc. in Computer Science from Cornell University His research interests span programming languages , software engineering , and formal verification , with recent publications on coinductive proofs in Liquid Haskell, concurrency semantics, and quantum compilation. He has supervised over 50 diploma projects and mentored numerous students now at institutions like MIT, Princeton, and UC Berkeley. Awards include conference organizing and program committee roles, though no formal scientific prizes are listed.

• High performance computing
• Computational Science and Engineering
• Scientific computing
• +۷ مورد دیگر

Olaf Schenk is a Professor at the Institute of Computing within the Faculty of Informatics at Università della Svizzera italiana (USI), Switzerland. He serves as Director of the Institute of Computing and Co-Director of the Master in Computational Science. He is also an adjunct member of the Computer Systems Institute at USI. PhD in Information Technology and Electrical Engineering, ETH Zurich (2001) Venia Legendi in Mathematics and Computer Science, University of Basel (2009) Applied Mathematics, Karlsruhe Institute of Technology (KIT), Germany His research focuses on high-performance computing , computational science and engineering , and applied algorithms for extreme-scale simulations. He bridges computer science with scientific computing needs, particularly in parallel algorithms , sparse solvers , graph analytics , and manycore architectures . His work emphasizes scalable software tools and programming models for emerging HPC systems. The 15 most recent publications reflect a consistent focus on sparse matrix computations , parallel and task-based algorithms , graph partitioning , and performance optimization for heterogeneous and manycore systems. Keywords span high-performance computing, numerical linear algebra, and large-scale data analysis, showing strong integration of theoretical algorithm design with practical implementation. Olaf Schenk has received several prestigious honors: Elected Fellow, Society for Industrial and Applied Mathematics (SIAM) Senior Member, IEEE and ACM SIAM Supercomputing Prize 2023 IBM Faculty Award Two Leadership Computing Awards from the U.S. Department of Energy He has held leadership roles as Chair, Vice Chair, and Program Director of the SIAM Activity Group on Supercomputing. He serves as Associate Editor for ACM Transactions on Mathematical Software and on the editorial board of SIAM Journal on Scientific Computing . He has participated in over 60 international program committees, including top-tier conferences such as SC, IPDPS, and IEEE CSE. He advises PhD and Master’s students in computational science and leads research projects funded by national and international agencies. He is also the Founder & Director of Panua Technologies Sagl, focusing on high-end software for simulation and optimization. His research group at USI works on next-generation computing tools for extreme-scale scientific simulations, with ongoing work in adaptive algorithms, resilience, and hybrid CPU-GPU computing. He leads collaborative projects with institutions in Europe and the U.S., aiming to develop scalable, robust, and efficient software for future exascale systems.

• Optimization under uncertainty
• Robust optimization
• Scenario generation
• +۸ مورد دیگر

Christina Busing is a Full Professor for Combinatorial Optimization at RWTH Aachen University, a position she has held since 2021. Previously, from 2016 to 2021, she served as a Junior Professor for Robust Planning in Medical Care at the same institution. She leads the Teaching and Research Group on Combinatorial Optimization, contributing significantly to the academic community through her research and teaching activities. Her educational background includes Mathematics studies at WWU Münster, Universidad Comlutense de Madrid, and the Technical University of Berlin. Her doctoral work was completed under the supervision of Prof. Möhring, focusing on Recoverable Robustness in Combinatorial Optimization. She has also held postdoctoral positions at institutions in Aachen, Lancaster, and Vienna. Professor Busing's research spans multiple areas of optimization theory and application. Her work focuses on optimization under uncertainty, robust optimization, scenario generation, combinatorial optimization, complexity theory, optimality criteria, and both exact and heuristic algorithms. She has made significant contributions to applying these theoretical frameworks to practical problems in healthcare, energy systems, and transportation networks. Her interdisciplinary approach bridges theoretical computer science with real-world operational challenges. Her extensive publication record demonstrates a consistent focus on robust combinatorial optimization, with recent work emphasizing applications in healthcare systems, particularly in patient-to-room assignment, primary care scheduling, and pharmacy services. She has developed novel methodologies for handling uncertainty in optimization problems, including recycling valid inequalities and designing consistent decision frameworks for two-stage optimization problems. RWTH Aachen Brigitte Gilles Award for contributions to the advancement of women in science (2022) RWTH Aachen FAMOS Award for excellent family-friendly leadership (2019) RWTH Aachen university-wide Best Teaching Award (2018) TU Berlin Best Diploma Excellence Award in Mathematics (2008) German National Scholarship (Cusanuswerk) (2003-2007) Professor Busing serves on multiple program committees including EURO (2019), INOC (2018), and ESA (2017). She is also involved with the UnRAVeL Graduate College since 2018. Her teaching portfolio includes courses on Graph and Network Optimization, Mathematical Heuristics for Discrete Optimization Problems, and Combinatorial Optimization. She has developed problem-based learning approaches for heuristic methods in decision problems across mathematics, computer science, and industrial engineering. Her research group actively collaborates on interdisciplinary projects addressing operational issues in healthcare, energy systems, and transportation networks, developing mathematically optimized solutions for complex real-world challenges.

Francois Trahayمشاهده پروفایل

دانشیار

• High Performance Computing
• Storage Systems
• Parallel and Distributed Systems
• +۲ مورد دیگر

François Trahay is an Associate Professor at Telecom SudParis, affiliated with the SAMOVAR research laboratory. His research focuses on high-performance computing systems, storage optimization, and performance analysis tools for parallel and distributed environments. He completed his PhD at Université Bordeaux I (2009) and Habilitation (HDR) at Institut Polytechnique de Paris (2021). Research Interests: Trahay specializes in optimizing storage systems (SSDs, RAID configurations), developing performance analysis frameworks (e.g., EZTrace, NumaMMA), and enhancing energy efficiency in HPC. Key areas include I/O performance, parallel runtime systems, and adaptive computing for machine learning workloads. Publication Trends: His recent work (2018–2025) demonstrates strong focus on: (1) SSD/RAID management techniques for modern storage hardware, (2) HPC performance tools for tracing and analysis, and (3) optimization strategies for distributed deep learning systems. Laboratory Affiliation: Member of SAMOVAR Laboratory (UMR CNRS), conducting research in distributed systems, networks, and computational efficiency.

Bengt Jonssonمشاهده پروفایل

استاد

• Formal Methods
• Real-Time Systems
• Distributed Systems
• +۶ مورد دیگر

Bengt Jonsson is a Professor at the Division of Computer Systems, Department of Information Technology, Uppsala University. His research focuses on formal methods, real-time and distributed systems, semantics and verification of concurrent systems, and IoT security. Current Projects: UPMARC (Software Technology for Multicore Programming), aSSIsT (Secure Software for IoT), and Designed for UPDATE (Safe Embedded Software Updates) Past Projects: CoDeR-MP (Multicore Real-Time Applications), ProFun (Wireless Sensor Networks), CONNECT (Networked Component Synthesis) His work includes automated verification, model checking, and symbolic execution for concurrent systems. Recent publications address dynamic partial order reduction, IoT protocol testing, and lock-free data structures. Scientific Awards : CAV Award 2017 He advises PhD students and teaches courses like Model-Based Development of Embedded Systems and graduate-level symbolic execution. Personal interests include piano playing and orienteering.

Ali José Mashtizadehمشاهده پروفایل

دانشیار

• Operating Systems
• Distributed Systems
• Storage Systems

Ali José Mashtizadeh is an Associate Professor at the Cheriton School of Computer Science, University of Waterloo. His research focuses on operating systems, distributed systems, and storage, with expertise in system reliability, network optimization, and concurrent programming. Education: Ph.D., Computer Science, Stanford University (2017) M.S., Computer Science, Stanford University (2017) M.Eng., Electrical Engineering and Computer Science, MIT (2007) B.S., Electrical Engineering, MIT (2006) His research centers on designing scalable and reliable systems, with recent publications exploring TCP network frameworks, in-memory data persistence, and microsecond-scale scheduling. Key themes include optimizing tail latency, neutralization-based memory reclamation, and fault-tolerant distributed services. His articles consistently demonstrate innovations in low-latency networking, operating system architecture, and cloud infrastructure, with recent emphasis on serverless benchmarks and processor customization. No scientific awards or advising relationships are detailed in the provided materials.

Stephen Siegelمشاهده پروفایل

دانشیار

• Formal methods for software verification
• Verification of parallel and scientific software
• Concurrency in software systems
• +۳ مورد دیگر

Stephen Siegel is an Associate Professor at the University of Delaware with a joint appointment in the Department of Computer and Information Sciences and the Department of Mathematical Sciences . Holding a PhD in Mathematics from the University of Chicago (1993), he transitioned from finite group theory research to formal methods in computer science, focusing on verification of parallel and scientific software. His research centers on the Verified Software Laboratory (VSL) and the CIVL Model Checker for HPC program verification. Recent work includes formal verification of PETSc components at CAV 2025 and collective contract frameworks for message-passing programs. Research Interests Formal methods for software verification Parallel and HPC software reliability Model checking techniques Application of mathematical logic to computing Academic Service Highlights Program Committee & Publication Chair, CAV 2025 Co-organizer, International Workshop on Verification of Scientific Software (VSS 2025) Chair, VerifyThis competition (2023) Editorial service at IEEE Transactions on Software Engineering (2015-2019) Teaching Portfolio CISC 404/604: Logic in Computer Science CISC 414/614: Formal Methods in Software Engineering CISC 372: Parallel Computing (MPI/OpenMP/CUDA instruction) Advanced Topics courses: Model Checking, Abstract Interpretation

David Bundeمشاهده پروفایل

استاد

• Parallel and Distributed Computing
• Scheduling Algorithms
• Resource Management in Supercomputers
• +۳ مورد دیگر

David Bunde , the William & Marilyn Ingersoll Professor at Knox College's Department of Computer Science, is a leading expert in parallel computing education and resource management for supercomputers. His work bridges theoretical scheduling algorithms with practical implementations in high-performance systems. University: Knox College Department: Computer Science Rank: Professor Education: Ph.D., University of Illinois-Champaign (2006) B.S., Harvey Mudd College (1998) Research Interests focus on: Supercomputer resource management and scheduling Parallel programming education using high-level languages Theoretical guarantees in online scheduling Task mapping strategies for emerging topologies Article Trends reveal expertise in: Chapel as a pedagogical tool GPU computing integration Geometric partitioning for performance Non-contiguous allocation strategies Scientific Awards & Grants: NSF grants for parallel education initiatives R&D 100 Award for 'Compute Process Allocator' Quad City Engineering and Science Council Junior Scientist of the Year Advising & Collaborations include: Co-authoring papers with 12+ students Collaborations with Sandia National Labs and DOE Maintaining 'Peachy Parallel Assignments' repository

Nima Honarmandمشاهده پروفایل

استادیار

• Computer Architecture
• Parallel Computing
• Operating Systems
• +۳ مورد دیگر

Nima Honarmand is an Assistant Professor in the Department of Computer Science at Stony Brook University, where he co-directs the Computer Architecture Stony Brook (COMPAS) Lab . His research focuses on computer system design , particularly parallel computer architecture and operating systems . Education : Ph.D. in Computer Science from University of Illinois at Urbana-Champaign under Josep Torrellas. His work addresses challenges in deterministic replay of parallel programs to simplify debugging on multi-processor systems. Current research explores memory fencing, consistency models, and architectural extensions for reproducibility. Recent publications span conferences like ASPLOS, ISCA, PACT, and POPL, with emphasis on parallelism constraints , memory hierarchy optimization , and fault-tolerant systems . Awards include Best Paper at PACT 2011 and Best Paper Candidate at VTS 2007 . Teaching : Courses include Computer Architecture (CSE 502) and Operating Systems (CSE 306/CSE 506). Email : nhonarmand@cs.stonybrook.edu

Changhee Jungمشاهده پروفایل

دانشیار

• Compilers
• Computer Architecture
• Performance Optimization
• +۷ مورد دیگر

Changhee Jung is the Samuel D. Conte Associate Professor of Computer Science at Purdue University, Department of Computer Science. His research focuses on compilers and computer architecture with an emphasis on performance, reliability, and security. He joined Purdue in Fall 2019 after serving as an Assistant Professor at Virginia Tech (2013–2019). Prior academic roles include a post at ETRI (2005–2008) and internships at Google (2010–2012). Education: PhD in Computer Science from Georgia Institute of Technology (2013) under Prof. Santosh Pande. His work spans compiler-architecture co-design for intermittent computing, nonvolatile memory systems, and security frameworks like PeX for Linux kernel permission checks. Notable recognitions include the NSF CAREER Award (2018) and induction into the MICRO Hall of Fame (2021). Research interests include energy-efficient computing, fault resilience, and compiler-driven hardware optimizations. His lab, CompArch, emphasizes cross-layer solutions for performance, reliability, and security challenges. Recent projects include IPEX (ISCA 2025), Write-Light Cache (ISCA 2023), and DevFuzz (Oakland 2023). Awards: NSF CAREER, MICRO Hall of Fame, Memorable Paper Finalist (NVMW 2024), Best Student Paper Finalist (SC 2016), and multiple industry awards. Active in service roles, including program chair for LCTES 2020 and editorial roles for ACM journals. Teaching: Courses include CS 352 (Compilers), CS 502 (Compiling Systems), and advanced special topics. Supervised over 15 graduate students and postdocs, with alumni in academia and industry (e.g., Samsung, Intel, Xilinx).

• Programming Languages
• Semantics
• Type Systems
• +۵ مورد دیگر

Nikolaos S. Papaspyrou is a Professor at the School of Electrical and Computer Engineering of the National Technical University of Athens (NTUA), affiliated with the Software Engineering Laboratory and the Division of Computer Science. His research focuses on programming languages, compilers, formal verification, and concurrency. Since October 2021, he has been on leave from NTUA while working as a Software Engineer at Google's V8 JavaScript and WebAssembly engine team. Previously, he served as Director of the Division of Computer Science (2017–2019) and held a sabbatical at Google's Munich compiler group (2015–2016). His academic contributions include pioneering work on Erlang/OTP scalability, concolic testing for functional languages, and static analysis techniques. He has authored numerous publications in top venues like ACM Transactions on Programming Languages and Systems and IEEE conferences. Papaspyrou has supervised over 50 diploma students and multiple PhD candidates, contributing to the education of future researchers and engineers. He actively participates in programming competitions, coaching Greek Olympiad teams, and volunteers in the Hellenic Informatics Society. He teaches advanced courses on programming languages, compilers, and software engineering at NTUA, emphasizing practical applications of theoretical concepts. His educational philosophy integrates problem-solving through programming, as highlighted in his FedCSIS 2013 paper on teaching methodologies.