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

• Static Analysis
• Abstract Interpretation
• Programming Languages
• +۳ مورد دیگر

Julian Erhard is a researcher and lecturer at the Technical University of Munich (TUM), affiliated with the Chair of Languages and Description Structures in Computer Science under Prof. Helmut Seidl. His research focuses on static analysis techniques, particularly leveraging abstract interpretation to enhance precision and performance in compiler optimization and concurrency analysis. He contributes to the Goblint static analyzer and is a member of the ConVeY research training group. Erhard has organized preparatory mathematics courses and served as an exercise instructor for core computer science courses such as Functional Programming and Verification, Compiler Construction, and Static Analysis. His teaching spans multiple semesters from 2019 to 2025, emphasizing practical programming concepts and theoretical foundations. In research, he addresses challenges in context-sensitivity management, concurrency validation, and pointer analysis. His work includes developing frameworks like the digest framework for concurrency-sensitivity and tools like C-2PO for weakly relational pointer domains. Recent publications explore correctness witnesses for concurrent programs and optimizing context sensitivity dynamically. Erhard has co-organized ConVeY retreats and contributed to projects such as the Goblint validator and the Clustered relational thread-modular analysis framework. His expertise bridges theoretical advancements in abstract interpretation with practical compiler tool development.

• Compiler Design
• Static Analysis
• Programming Languages
• +۵ مورد دیگر

Michael Petter is a faculty member at the Technische Universität München (TUM), affiliated with the School of Computer Science II (Informatik 2) and the Department of Languages and Description Structures in Computer Science. He specializes in compiler design, static analysis, and formal verification, with a focus on developing tools like the Goblint framework for multi-threaded C programs. His teaching spans courses such as Compiler Construction, Program Optimization, and Functional Programming, reflecting his expertise in programming languages and software engineering. His research interests include static analysis techniques, concurrency control, and abstract interpretation frameworks. He has contributed to advancements in flow-sensitive analysis, context-sensitivity management, and precision recovery in program analysis. Recent work emphasizes improving static analysis tools for industrial benchmarks and enhancing their usability through incremental methods. Petter’s publications highlight innovations in numerical abstract domains (e.g., octagons), non-local jump misuse detection, and thread-modular analysis for multi-threaded systems. His involvement in projects like the DFG Research Training Group ConVeY underscores his commitment to advancing continuous verification in cyber-physical systems. He advises thesis projects on topics like quantum computing at compile time and program synthesis, fostering interdisciplinary collaboration. While actively engaged in academic events and editorial roles, he maintains a lab focused on cutting-edge compiler and static analysis research.

Mark Uttingمشاهده پروفایل

دانشیار

• Software Verification
• Model-Based Testing
• Formal Methods
• +۵ مورد دیگر

Associate Professor Mark Utting is affiliated with the University of Queensland (UQ), specifically within the School of Electrical Engineering and Computer Science. He holds the rank of Associate Professor and focuses on software verification, model-based testing, and programming language design. His academic journey includes roles at multiple Queensland universities, Waikato University (NZ), and the University of Franche-Comte (France). He earned his PhD from UNSW on object-oriented language semantics. Utting has authored over 80 publications and the book 'Practical Model-Based Testing: A Tools Approach.' His current research emphasizes verifying compilers, blockchain smart contracts, ARM64 binaries, and AI-generated code. Key projects include the Algorand Centre for Sustainability Informatics and the BASIL project on secure information-flow logics. His research spans formal methods, theorem proving, and software engineering. Utting leads supervision in areas like compiler verification and smart contract analysis, with active involvement in grants such as the 'Directed and Incremental Analysis for DevSecOps' project. Utting collaborates on interdisciplinary projects, including energy grid simulations and cybersecurity strategies. His work bridges academia and industry, with past experience in genomics and manufacturing software development.

• Program Specification and Verification
• Concurrent Separation Logics
• Symbolic Execution
• +۵ مورد دیگر

Philippa Gardner is a Professor in the Department of Computing at Imperial College London, holding a UK Research and Innovation Established Fellowship (2018–2023). She specializes in program specification, verification, and concurrent separation logics. Her Gillian platform unifies symbolic execution, verification, and testing for C and JavaScript. She was elected a Fellow of the Royal Academy of Engineering (2020) and directed the Research Institute on Verified Trustworthy Software Systems (VeTSS, 2017–2023). Her work includes foundational contributions to separation logic, concurrent program reasoning, and mechanised language specifications. Education: PhD in Computer Science from Edinburgh (1992), supervised by Gordon Plotkin. Key roles: General Chair of POPL 2024, organiser of the Isaac Newton Institute's 'Verified Software' programme (2022). Research interests span formal methods, concurrency, and tool development. Notable grants include £1.5M EPSRC Established Career Fellowship (2018–2023) and £500K Facebook Research gift (2020). Awards include Imperial’s President and Rector’s Teaching Award (2013).

• Deep Neural Networks
• Compiler Design
• Program Verification
• +۵ مورد دیگر

Thirimadura Charith Yasendra Mendis serves as an Assistant Professor at the University of Illinois Urbana-Champaign with dual appointments in the Siebel School of Computing and Data Science and the Department of Electrical and Computer Engineering. He maintains a strong affiliation with the Coordinated Science Lab, where he conducts interdisciplinary research bridging computer architecture, compilers, and artificial intelligence systems. His research program centers on deep neural networks, compiler design, and program verification, with significant contributions to soundness verification of DNN certifiers, domain-specific language development for neural network certification, and hardware-aware compiler optimizations. His work in parallel computing and graph neural networks specifically targets efficiency bottlenecks in AI infrastructure through novel vectorization and level parallelism techniques. Recent 2025 publications reveal a cohesive research trajectory focused on enhancing AI system reliability through formal methods and compiler innovation. Key themes include automated verification frameworks for tensor operations, declarative approaches to neural network certification, and GPU-optimized code generation for sparse attention mechanisms in transformer architectures—collectively advancing trustworthy AI deployment. Dr. Mendis has earned two prestigious national awards: DARPA Young Faculty Award (2024) NSF CAREER Award (2024) These competitive grants fund his research program investigating foundational aspects of AI safety and compiler technology, likely supporting graduate student mentorship in systems and programming languages research. Within the Coordinated Science Lab ecosystem, Mendis collaborates with cross-disciplinary teams on projects spanning hardware acceleration, programming language design, and neural network verification—leveraging this environment to drive innovation in computing systems reliability and performance.

Timos Antonopoulosمشاهده پروفایل

مدرس

• Logic
• Verification
• Formal Languages
• +۳ مورد دیگر

Timos Antonopoulos is a Research Scientist and Lecturer in the Department of Computer Science at Yale University. He is a member of the Rigorous Software Engineering (ROSE) group, led by Ruzica Piskac. His office is located in Dunham Laboratory (Room 404) at 10 Hillhouse Avenue, New Haven, CT. Antonopoulos's research focuses on formal methods and their applications in security and reliability. Key areas include: Logic and Verification : Developing tools and algebras for relational verification, termination analysis, and program correctness. Cryptography & Privacy : Designing zero-knowledge protocols (e.g., ZKSMT, ppSAT) and privacy-preserving techniques for automated decision-making and model checking. Automated Reasoning : Creating frameworks for intentional behavior analysis, SMT-based oracles, and invariant inference to handle uncertainty and complexity. His recent publications (2020–2024) reflect a strong emphasis on cryptographic code security, zero-knowledge proofs, and formal accountability tools. Trends include scalable privacy protocols (e.g., parallelization of zero-knowledge systems), legal/ethical AI verification (e.g., soid for automated decisions), and novel graph/algebraic methods for secure computation. Antonopoulos collaborates extensively within the ROSE group, contributing to projects involving oblivious algorithms, timing-attack mitigation, and secure multi-party SAT solving. His work bridges theoretical foundations (e.g., automata theory, relational algebra) with practical systems security challenges.

• Semantic Web Technologies
• Distributed Systems
• E-Learning Systems
• +۳ مورد دیگر

Милорад Б. Тошић is a Full Professor at the Faculty of Electronic Engineering, University of Niš, specializing in Computer Science. He earned all his academic degrees (BSc 1989, MSc 1992, PhD 1998) from the same institution in Electrical Engineering and Computer Science. His research spans Semantic Web Technologies, Distributed Systems, and E-Learning Systems, with notable contributions in federated testbeds, trust-based peer assessment, and collaborative wiki tagging. His work bridges theoretical computer science with practical applications in education and embedded systems. His publication trends show consistent contributions from 1991 to 2014, with recent focus shifting from hardware design (1990s) to semantic technologies and e-learning systems (2000s-2010s), demonstrating adaptability across evolving technological domains. US Patent Application No. 09/636,552 for Internet-Enabled Embedded Device Technology validated by Motorola, Microchip, Philips, and Delphi As former Science and Technology Advisor to the Serbian Minister (2002-2003), he contributed to national science policy. His current research involves 4 national and 3 international projects totaling 7 impact-factor journal publications. His patented embedded device technology has achieved commercial validation through major global electronics firms.

Anton Burtsevمشاهده پروفایل

دانشیار

• Operating Systems
• Computer Security
• Formal Verification
• +۳ مورد دیگر

Anton Burtsev is an Associate Professor at the Kahlert School of Computing, University of Utah. His research focuses on redefining operating system architectures to address modern challenges like security attacks, data center workloads, and heterogeneous hardware. He leads the Mars Research Group, developing systems like the formally verified Atmosphere microkernel in Rust/Verus, and the high-performance DRAMHiT hash table. Key projects include Rust for Linux kernel integration, verified drivers (Veld), and isolation mechanisms like RedLeaf OS. Research interests include kernel isolation, formal verification, language safety (Rust), and overcoming the memory wall. Current work emphasizes clean-slate OS designs and retrofitted security solutions for existing kernels. Collaborative projects include Horizon (secure scientific cloud computing) and RedLeaf OS verification efforts. Advising undergraduate to PhD students interested in OS research. Notable grants include NSF CAREER (NgOS) and collaborative NSF grants on verified systems. Active in the MARS reading group and open-source contributions via repositories.

• Formal Verification
• Parallel and Distributed Systems
• GPU Programming
• +۴ مورد دیگر

GANESH GOPALAKRISHNAN is a Professor of Computer Science at the University of Utah's School of Computing. His work focuses on formal verification of parallel/distributed systems, GPU programming, and numerical error analysis. He has contributed to tools like ISP for MPI verification, ARCHER for OpenMP race detection, and FLiT for floating-point consistency testing. His research spans theoretical foundations (e.g., concurrency models) and practical applications (e.g., GPU error analysis). Recent work includes advancing formal methods for mixed-precision computing and resilience in exascale systems. Notable projects include rigorous error estimation for floating-point operations and compiler-assisted verification techniques. Research Interests: Formal Verification of Parallel Systems | GPU & HPC Correctness | Floating-Point Numerical Analysis | Concurrency Bugs | Tools for Distributed Systems. Current work emphasizes hybrid approaches combining formal methods with dynamic analysis to address emerging challenges in heterogeneous computing architectures. Articles Trends: Recent publications (2020–2025) emphasize GPU verification (data races, error analysis), mixed-precision computing (matrix operations, tensor cores), and resilience in HPC systems. Tools like FPDetect and BinFPE highlight practical contributions to error detection in production runs. Workshops (DOE/NSF) indicate leadership in defining correctness strategies for exascale computing. Labs/Teams: Leads research groups focused on formal methods for parallel computing and numerical system reliability. Collaborations include Argonne National Lab, NVIDIA, and LLNL on verification tools and HPC correctness frameworks.

• Compilers
• Software Testing
• Formal Verification
• +۳ مورد دیگر

John Regehr is a Professor in the School of Computing at the University of Utah. His research focuses on compilers, formal verification, software testing, and embedded systems. He has contributed to tools like Alive2, YARPGen, and ARMor, which address compiler correctness, fuzz testing, and secure isolation. His work emphasizes uncovering compiler bugs, optimizing low-level code, and ensuring system reliability. Key collaborations include Eric Eide, Yang Chen, and Nuno P. Lopes. His articles span compiler verification, fuzzing techniques, and embedded system safety, reflecting a strong commitment to both academic rigor and practical impact. Research interests include compiler optimization validation, undefined behavior analysis, and program synthesis. His work on peephole optimizations and formal methods has influenced LLVM and industry practices. He also explores scheduling algorithms for real-time systems and memory safety in constrained environments like TinyOS. Notable contributions include foundational papers on compiler bug detection (e.g., 'Finding and understanding bugs in C compilers') and tools like Minotaur for SIMD optimization. His lab's work often bridges theory and practice, with applications in security, performance, and embedded software reliability.

Juan Carlos Pichel Camposمشاهده پروفایل

استاد

• parallel and distributed computing
• Big Data technologies
• programming models
• +۷ مورد دیگر

Juan Carlos Pichel Campos is a Full Professor at the University of Santiago de Compostela (USC) specializing in high performance computing and language technologies. His research spans quantum computing, distributed systems, and Big Data technologies with a focus on practical applications in health informatics and computational physics. He received his B.Sc. and M.Sc. in Physics from University of Santiago de Compostela (Spain) and completed his Ph.D. there in 2006. He conducted postdoctoral research at University Carlos III de Madrid and University of Illinois at Urbana-Champaign, and worked as a researcher and project manager at Galicia Supercomputing Center. Professor Pichel's research interests include parallel and distributed computing, Big Data technologies, programming models, and software optimization techniques for emerging architectures. His recent work has focused on bridging quantum computing with classical high performance computing systems, developing efficient algorithms for processing massive biological datasets, and creating tools for health-related information retrieval and misinformation detection. His interdisciplinary approach combines techniques from computer science, physics, and biomedical informatics to solve complex computational problems. Analysis of his recent publications reveals a strong trend toward quantum computing applications and integration with classical HPC systems (accounting for approximately 40% of his recent work), followed by health informatics and natural language processing (about 30%), and bioinformatics and computational physics (about 30%). His research demonstrates a consistent focus on developing practical tools and frameworks that address real-world computational challenges across multiple domains. rePowerSiC: High-Efficiency High-Power Laser Beaming In-Space Systems Based On Sic (2024-2028) C3HS: Content curation for consumer health search - Search and misinformation detection (2023-2026) Big-eRisk: Early Prediction of Personal Risks on Massive Data (2021-2024) eRISK: Technologies for the early prediction of signs related with psychological disorders (2019-2021) BigNLP: Approaching High Performance Computing to Big Data Technologies: Natural Language Processing as Case Study (2015-2018) Professor Pichel has established strong collaborations with research groups across Europe and the United States, particularly in the fields of quantum computing and biomedical informatics. He is actively involved with CiTIUS (Centro singular de investigación en tecnoloxías da información e da comunicación de USC), contributing to its mission of advancing information and communication technologies through interdisciplinary research.

• Program Verification
• Compiler Design
• Programming Languages
• +۱ مورد دیگر

Lars Birkedal is a Professor at Aarhus University, Denmark, internationally recognized for pioneering contributions to the semantic and logical foundations of compilers and program verification systems. His work bridges theoretical computer science and practical software reliability, driving advancements in how programming languages are formally verified and optimized. His core research areas include: Program Verification (ensuring software correctness through mathematical proofs) Compiler Design (translating high-level code to efficient machine instructions) Programming Languages (type systems, semantics, and language theory) Theoretical Computer Science (formal methods and logic) In 2017, Birkedal was named an ACM Fellow—a distinction awarded to the top 1% of computing professionals—for transformative impacts that underpin modern verification tools and compiler technologies. This honor highlights work critical to secure, reliable software systems worldwide. No information on academic advising, grants, or laboratory leadership is provided in the source material.

• Process Mining
• Process Modelling
• Conceptual Modelling
• +۵ مورد دیگر

Jan Martijn van der Werf serves as Associate Professor in Process Science at Utrecht University's Faculty of Science, Department of Information and Computer Science. Since September 2022, he has held the position of Programme Director for the Bachelor Information Sciences, overseeing curriculum development and academic operations for both Business Informatics and Information Sciences programs. Education: Dual PhD in Computer Science from Eindhoven University of Technology and Humboldt Universität zu Berlin (Thesis: 'Compositional Design and Verification of Component-based Information Systems') Research Focus: Van der Werf's work centers on process mining and behavioral modeling in software architectures, with emphasis on the interplay between data and processes. His expertise spans Conceptual Modelling of Information Systems , Enterprise Architecture , and Service-Oriented Architecture , addressing challenges in process discovery, verification, and practical implementation within complex organizational contexts. Current research explores the human dimensions of process mining adoption and AI-driven event log extraction. Publication Trends: Recent work (2023-2024) reveals increasing focus on methodological rigor in process discovery, human factors in process mining initiatives, and formal verification techniques for Petri nets. His publications bridge theoretical foundations with practical applications, particularly in event log extraction using large language models and visualization of complex process chronologies from heterogeneous data sources. Academic Contributions: Van der Werf teaches core courses in Process Modelling and Software Architecture , actively participates in academic workshops (including the 2020 'Information System Modeling' workshop), and supervises graduate research. His Scopus profile indicates 77 research outputs and supervision of 3 students, reflecting sustained scholarly engagement in process science and information systems.

• Quantum Computing
• Quantum Foundations
• Diagrammatic Reasoning
• +۳ مورد دیگر

John van de Wetering is an Assistant Professor at the Theoretical Computer Science group of the Informatics Institute at the University of Amsterdam . He works with the QuSoft research center and co-develops the PyZX open-source quantum compiler. His research spans quantum computation, diagrammatic reasoning, and quantum foundations. Education: PhD in Computer Science (2022, Radboud University) Research: Focuses on ZX-calculus for quantum circuit optimization, verification, and simulation. Explores quantum foundations through algebraic and compositional methods. Recent work includes quantum circuit optimization with AlphaTensor, completeness proofs for ZH-calculus, and scalable spider nets for transversal non-Clifford gates. He directs the new Master's program in Quantum Computer Science at UvA and co-authored the book Picturing Quantum Software . Notable collaborations include PyZX development and EU Gender Equality Working Group participation. Supervision includes current PhD students Lia Yeh (Oxford), Sarah Li (UvA), and Marc Farreras (Leiden). Former students include Boldizsár Poór (Quantinuum), Julien Codsi (Princeton), and Yanbin Chen (TUM). Tools & Outreach: Maintains the ZX-calculus Wikipedia page, co-lectured courses like Quantum Processes and Computation , and develops the ZX-calculus educational website. Organized QPL2026 conference and contributed to open-access journal Quantum .

Marinela Buradaمشاهده پروفایل

استاد

• Linguistics
• Lexicography
• Academic Discourse
• +۵ مورد دیگر

Marinela Burada is a Professor at the Department of Theoretical and Applied Linguistics, Faculty of Letters, Transilvania University of Brașov, Romania. Her contact details include office T7 in Building T (Eroilor 25, Brașov), phone/fax +40 268 474 059, and email m.burada@unitbv.ro. Research Interests: Linguistics, Lexicography, Academic Discourse, Intercultural Communication Key Contributions: Publications on Romanian language dictionaries, contrastive L2 writing analysis, and interdisciplinary studies on social work practices during the pandemic. Her publications span two major domains: linguistics (historical linguistics, lexicography, academic discourse) and social work (volunteering dynamics, pandemic response, community service frameworks). Notable works include dictionary research projects and empirical studies on volunteer management, burnout in social work, and intergenerational volunteering impacts. Marinela has contributed to community service initiatives through academic leadership in organizing Romania’s first community service workshops and developing theoretical models for volunteer engagement. Her work intersects language studies with social sciences, emphasizing both lexical evolution and societal well-being.