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

Mohamed Faouzi Atigمشاهده پروفایل

استاد

• Formal Verification
• Concurrency
• Model Checking
• +۷ مورد دیگر

Mohamed Faouzi Atig is a Professor in Computer Systems at the Department of Information Technology , Uppsala University since July 2021. Previously, he served as Senior Lecturer (Associate Professor) from June 2018 to June 2021 and as Associate Senior Lecturer (Assistant Professor) from June 2014 to May 2018. Current: Professor, Uppsala University (2021–present) Senior Lecturer, Uppsala University (2018–2021) Associate Senior Lecturer, Uppsala University (2014–2018) Researcher, Uppsala University (2012–2018) Post-doctoral Researcher, Uppsala University (2010–2012) Education : PhD in Computer Science from University of Paris Diderot-Paris 7 (2010) Docent (Habilitation) in Computer Systems from Uppsala University (2017) Research Interests : A multidisciplinary researcher in Formal Verification , focusing on Model Checking and Automata Theory for Concurrency and Weak Memory Models . His work spans Formal Methods , Software Verification , and Logics for system correctness. Publication Trends : His recent works (2015–2024) analyze Hardware Memory Models (Intel-x86, TSO), String Constraint Solving , and Stateless Model Checking under relaxed memory semantics. He applies Automata Theory to Persistent Memory verification and Concurrency problems. Committee Roles : Active in program committees for POPL (2020–2025), PLDI (2017–2024), and VMCAI (2017).

Örjan Sandredمشاهده پروفایل

استاد

• Computer-Assisted Composition
• Electro-Acoustic Music
• Rule-Based Composition
• +۳ مورد دیگر

Örjan Sandred is a Professor of Composition at the University of Manitoba's Desautels Faculty of Music, where he founded Studio FLAT for computer music research and production. He teaches composition, computer-assisted composition, and electro-acoustic music while maintaining an active international composition career. Diplomi i Komposition, Royal College of Music Stockholm MFA, Royal College of Music Stockholm Additional studies at McGill University and IRCAM (Paris) His research focuses on Computer-Assisted Composition with emphasis on rule-based systems, live electronics integration, and artificial intelligence applications. Sandred developed the Cluster Engine constraint-solving system for music composition, exploring how computers can process musical ideas through formalized rules. His work bridges acoustic instruments with digital technologies, creating innovative performance systems where musicians interact with responsive computer environments. His recent compositions demonstrate evolving trends in interactive performance systems (Tilting Points, Sketches of Shifting Landscapes), climate change expression (Footprints), and pandemic-era multimedia installations (Sonic Trails: Lockdown). These works consistently integrate live electronics with acoustic instruments through sophisticated Max/MSP patches. Scientific awards include: Guggenheim Fellowship (2022) Fellow of the Royal Society of Canada (2023) DAAD Visiting Professorship at Hochschule für Musik Detmold (2016) Manitoba Arts Council support for major commissions Sandred maintains significant international collaborations with performers and institutions worldwide. His compositions receive regular premieres across Europe, North America, and Asia through commissions from organizations like the Swedish Concert Institute and Théâtre du Châtelet in Paris. He directs Studio FLAT as a hub for computer music research while developing educational resources including his book The Musical Fundamentals of Computer Assisted Composition . Current projects include an installation collaboration with the Royal Winnipeg Ballet and conductors from Sweden/Canada, plus ongoing development of the Cluster Engine system within Max environment through MOZlib.

Marko Đukanovićمشاهده پروفایل

استادیار

• Combinatorial Optimization
• Graph Theory
• Bioinformatics
• +۴ مورد دیگر

Marko Đukanović serves as an Assistant Professor at the Department of Computer and Information Sciences within the Faculty of Natural Sciences and Mathematics at the University of Banja Luka. His academic career spans combinatorial optimization, graph theory, and bioinformatics applications, with significant contributions to algorithm design for complex computational problems. His research focuses on combinatorial optimization , particularly in graph domination problems and longest common subsequence variants . His work bridges theoretical computer science with practical applications in bioinformatics, social network analysis, and computational biology. Recent publications demonstrate expertise in developing advanced algorithms including biased random-key genetic algorithms, variable neighborhood search, and neural network-guided optimization techniques. Key publication trends show his specialization in solving constrained optimization problems on graphs, with growing emphasis on integrating machine learning components into traditional combinatorial algorithms. His 2024 publications in IEEE Transactions on Evolutionary Computation and Applied Mathematics and Computation represent significant contributions to the field. Best Paper Award at EvoStar Conference 2024 for 'A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem' Dr. Đukanović actively participates in international academic collaboration, including recent panel discussions on knowledge transfer between Bosnia and Herzegovina and global expert communities. His work demonstrates strong international collaboration, particularly with researchers from TU Wien and institutions across Europe.

Parosh Aziz Abdullaمشاهده پروفایل

استاد

• Concurrency
• Distributed Systems
• Program Verification
• +۷ مورد دیگر

Parosh Aziz Abdulla is a Chaired Professor at the Department of Information Technology, Uppsala University, Sweden. His research focuses on algorithmic program verification, concurrency, distributed systems, and model checking, with applications to weak memory models like x86-TSO and C11.

• Formal Verification
• Model Checking
• Concurrent Systems
• +۶ مورد دیگر

Parosh Abdulla is a Professor in the Division of Computer Systems within the Department of Information Technology at Uppsala University, Sweden. His research focuses on formal methods and program verification with emphasis on concurrent systems, memory models, and verification techniques. With an extensive publication record spanning over three decades, he has established himself as a leading researcher in his field. His primary research interests include formal verification, model checking, concurrent systems analysis, memory models (particularly TSO and PSO), string constraints, timed automata, parameterized verification, and program analysis. His work addresses fundamental challenges in verifying complex software systems, especially those involving concurrency and weak memory models. In recent years, he has expanded his research to include quantum systems verification and the application of machine learning techniques to formal methods. Analysis of his recent publications (2023-2025) reveals a continued focus on advancing verification techniques for concurrent systems, with growing interest in quantum computing verification and the integration of graph neural networks with traditional formal methods. His work demonstrates consistent innovation in reducing the state space explosion problem while maintaining verification completeness. Professor Abdulla has established significant collaborations with researchers including Mohamed Faouzi Atig, Bengt Jonsson, and others, resulting in numerous high-impact publications in top-tier venues. His research has practical implications for developing reliable concurrent software systems and advancing formal verification methodologies. While specific details about his advising activities and grants aren't explicitly mentioned in the available information, his extensive publication record suggests active supervision of graduate students and involvement in multiple research projects. His work likely contributes to formal methods research groups at Uppsala University, focusing on verification tools and theoretical foundations of program analysis.

Danny Bøgsted Poulsenمشاهده پروفایل

دانشیار

• Formal Methods
• Model Checking
• Cyber-Physical Systems
• +۳ مورد دیگر

Danny Bøgsted Poulsen is an Associate Professor at the Department of Computer Science, Aalborg University, affiliated with The Technical Faculty of IT and Design. His research focuses on formal methods, model checking, and cyber-physical systems with applications in security analysis and programming languages. He contributes to projects like BEO-COVID (2020–2020) and IDEA4CPS (2011–2015), which explore decision support tools and foundational cyber-physical systems. His academic background includes advanced work in formal verification and statistical model checking. Key research interests include: Formal methods for string constraints and SMT solvers Statistical analysis of security-critical systems Modelling protocols like DTLS and attack-defense scenarios Applications of formal methods in education and public health Recent work highlights include developing SMTQuery for benchmark analysis, statistical evaluation of bit-flip vulnerabilities, and leveraging large language models for educational feedback. His research outputs span over 36 publications across journals and conferences, with active contributions to UPPAAL tool development and open datasets for reproducibility. Poulsen collaborates internationally on projects involving formal verification of embedded systems and cybersecurity protocols. His work bridges theoretical computer science with practical applications in safety-critical systems.

Tobias Straußمشاهده پروفایل

مدرس

• Mathematics Education
• Historical Document Analysis
• Machine Learning
• +۵ مورد دیگر

Dr. Tobias Strauß is a Lecturer at the Institute of Mathematics, Faculty of Mathematics and Natural Sciences, University of Rostock. He teaches courses such as Elementary Algebra and Number Theory and Analytical Geometry, focusing on foundational mathematical concepts and their applications. His research interests span historical document analysis, machine learning, and neural networks, with a particular emphasis on handwritten text recognition (HTR) and computational solutions for cultural heritage digitization. He actively contributes to the Mathematics Society RHO eV, supporting students in mathematics competitions and enrichment programs. Dr. Strauß’s research combines computer vision and machine learning to address challenges in document analysis, including text line detection, cursive script recognition, and keyword search in historical manuscripts. His work also explores semi-supervised learning techniques and neural network architectures tailored for HTR tasks. Through RHO eV, he promotes mathematics education through weekend seminars, district clubs, and game-based learning activities, fostering student engagement and problem-solving skills. His publications highlight advancements in HTR systems, such as the CITlab Recognition & Retrieval Engine, and address topics like regular expression-based decoding and Arabic handwriting recognition. These contributions underscore his expertise in bridging theoretical mathematics with practical applications in digital humanities and education. Dr. Strauß can be contacted via tobias.strauss@uni-rostock.de or through the university’s chat platform. No formal awards or grants are noted in the provided materials, though his involvement in international competitions (e.g., ICFHR, ICDAR) reflects his scholarly engagement.

Tachio Terauchiمشاهده پروفایل

استاد

• Programming Languages
• Program Verification
• Program Synthesis
• +۶ مورد دیگر

Tachio Terauchi is a Professor in the Department of Computer Science and Engineering at Waseda University, Japan. Previously, he held academic positions at JAIST (Professor, 2014-2017), Nagoya University (Associate Professor, 2011-2014), and Tohoku University (Assistant Professor, 2007-2011). He actively participates in program committees for premier conferences including POPL, PLDI, and SPLASH, with current service for SPLASH 2025 and POPL 2025. His academic background: B.S. in Computer Science, Columbia University (2000) M.S. in Computer Science, University of California, Berkeley (2004) Ph.D. in Computer Science, University of California, Berkeley (2006) Terauchi's research centers on techniques for building reliable computational systems through programming languages and formal methods. His core contributions span program verification for higher-order functional programs, security analysis of timing channels and regex vulnerabilities, and refinement type systems. Recent work demonstrates particular expertise in regular expressions with backreferences and temporal logic verification. His publications from 2020-2025 reveal a dominant focus on regular expression security (ReDoS vulnerabilities and repair methods) and advanced program verification techniques. This work bridges theoretical foundations in automata theory and mathematical logic with practical security applications, showing increasing specialization in regex analysis since 2022 while maintaining contributions to verification frameworks. Scientific Awards: None explicitly mentioned in the provided text. He currently advises a substantial cohort of students across all academic levels at Waseda University, with his lab actively recruiting prospective students. The lab, located in room 209B of Building 62W, supports research in programming languages and security verification through regular appointments. PhD Students: Tianrui Chen (D2), Taisei Nogami (D1) Master's Students: Kazuma Kawahara (M2), Yuta Uchijo (M2), Naoya Anada (M2), Yuki Nakayama (M1), Taisei Iida (M1) Bachelor's Students: Riru Oda (B4), Riku Ito (B4), Haruto Ishiyama (B4), Rei Tomori (B3), Rio Onoda (B3) Visiting Scholar: Nariyoshi Chida

Yu-Fang Chenمشاهده پروفایل

استاد

• Formal Verification
• Quantum Programming
• Automata Theory
• +۳ مورد دیگر

Yu-Fang Chen is a Full Professor and Research Fellow at the Institute of Information Science, Academia Sinica, Taiwan, where he has been affiliated since 2018. His research group focuses on cutting-edge work in formal methods, quantum programming, and automata theory, with significant contributions to quantum circuit verification and constraint solving. His research centers on developing automata-based frameworks for quantum program verification (AutoQ Project), string constraint solving (Z3-Noodler), and symbolic execution techniques. Core interests include formal verification of quantum systems, satisfiability modulo theories, automata theory applications in quantum contexts, and developing practical verification tools. Chen's recent publications (2020-2025) demonstrate a strong focus on quantum circuit verification, automata theory adaptations for quantum systems, and string constraint solving. Work frequently combines theoretical foundations with practical tool development, showing consistent innovation in quantum program analysis techniques and symbolic execution methods. Awards & Honors: Academia Sinica Scholar Award (2025-2029) SIGLOG/CACM research highlights nomination (2025) Distinguished Paper Awards (OOPSLA 2023, PLDI 2023) Best Paper Awards (FM 2023, TACAS 2010) Young Scholar Creativity Award (2023) MOST Research Project for Excellent Junior Research Investigators (2020-2023) Chen actively advises PhD students and postdoctoral researchers, with open positions advertised for his quantum computing and formal methods research group. He leads significant projects including the AutoQ framework development and has secured multi-year funding through the Academia Sinica Scholar Award and MOST grants. He directs a research laboratory at Academia Sinica focused on automata theory and quantum verification, developing tools like AutoQ and Z3-Noodler. The team collaborates internationally and regularly contributes to top-tier conferences in formal methods and programming languages.

Ahmed Rezineمشاهده پروفایل

مدرس ارشد

• Computer Science
• Software Verification
• Machine Learning
• +۷ مورد دیگر

Ahmed Rezine is a Senior Lecturer and Associate Professor at the Department of Computer Science (IDA) , specifically within the Software and Systems (SAS) division at Linköping University . His research focuses on software verification , machine learning , and cybersecurity , particularly in the context of deep neural networks and embedded systems . Research Trends: His recent publications, such as VNN: Verification-Friendly Neural Networks (2024) and Trojans in Instruction Sets (2024), highlight his work at the intersection of AI robustness and hardware security . Earlier studies (2023-2017) emphasize formal verification of concurrent systems and GPU architectures , reflecting a consistent focus on parameterized systems and security analysis . Colleagues & Collaborations: Rezine collaborates with researchers in the Software and Systems group, part of the Wallenberg Autonomous Systems Program (WASP) . His work intersects with AI IDA and Embedded Systems (ESLAB) , focusing on autonomous systems and real-time processing .

Stephan Mescherمشاهده پروفایل

پژوهشگر

• Algebraic Topology
• Differential Geometry
• Robot Motion Planning
• +۵ مورد دیگر

Stephan Mescher is a Researcher at the Institute of Mathematics within the Faculty of Natural Sciences II at Martin Luther University Halle-Wittenberg. Based at the Georg Cantor House on Theodor-Lieser-Strasse in Halle (Saale), he conducts advanced research at the intersection of algebraic topology and differential geometry with applications in robotics. His research focuses on: Topological complexity and spherical complexities in motion planning Geodesic analysis in Riemannian and Finsler manifolds Morse theory and A-infinity algebra structures Closed geodesics and critical point theory Geometric properties of configuration spaces for robots Recent publications reveal a cohesive trajectory toward sequential topological complexity and fibered decompositions of cut loci, demonstrating how abstract topological invariants solve concrete problems in robot navigation. His work bridges pure mathematics with engineering applications through rigorous analysis of manifold structures. No scientific awards were documented in available sources. Information regarding student supervision, research grants, or collaborative teams was not provided in the source materials.

Soha Husseinمشاهده پروفایل

استادیار

• program analysis
• fuzzing
• symbolic execution
• +۴ مورد دیگر

Soha Hussein is an Assistant Professor at Ain Shams University in Egypt. She is actively involved in the software engineering research community, serving in various roles including Publication Co-chair for ASE 2025 and Posters/Tools/SRC Co-Chair for SPLASH/ISSTA 2026. Dr. Hussein received her Ph.D. and M.S. in Computer Science from the University of Minnesota. She also completed the Early Career Teaching and Learning program and the Prepare Future Faculty program at the University of Minnesota, demonstrating her commitment to both research and education. Her research focuses on enhancing software reliability and security through advanced program analysis techniques. Specifically, she specializes in symbolic execution, fuzzing, formal verification, and software testing. Her work addresses the critical challenge of path explosion in symbolic execution through innovative path-merging approaches. Dr. Hussein's research has practical applications in verifying Java programs and improving automated program verification techniques, with recent work extending to AWS Lambda applications. Her publications demonstrate a consistent trajectory of advancing verification techniques while maintaining strong theoretical foundations. Dr. Hussein has received multiple prestigious awards for her work on Java Ranger, including Gold Medals at SV-COMP 2020, 2021, and 2025, as well as a Bronze Medal at SV-COMP 2020. These awards recognize the effectiveness of her path-merging approach in reducing path explosion and improving verification efficiency. She is actively involved in mentoring students, particularly through the Google Summer of Code program where she serves as an organization admin and mentor for the Java Pathfinder (JPF) Organization. Dr. Hussein encourages excellent students to reach out for research opportunities in her lab, having successfully mentored students like Kunha Kim who accepted a Master scholarship at University of Colorado Boulder. Dr. Hussein leads research related to Java Ranger, an extension to Symbolic Pathfinder that implements path-merging techniques for Java verification. Her team continues to advance this work, with recent developments supporting string and array operations and applying the technology to AWS Lambda applications. She maintains active contributions to the SymbolicPathFinder/jpf-symbc repository on GitHub, demonstrating her commitment to open-source verification tools.

• Software Verification
• Side-channel Analysis
• Computer Security
• +۳ مورد دیگر

Tegan Brennan is an Assistant Professor at the Department of Computer Science within the Charles V. Schaefer, Jr. School of Engineering and Science at Stevens Institute of Technology. She holds a PhD in Computer Science from the University of California Santa Barbara (2020). Her research focuses on software verification, side-channel analysis, computer security, and program analysis. Prior to academia, she worked as an Applied Scientist at Amazon (2020). Her research interests emphasize securing computational systems through rigorous analysis of timing channels, adaptive neural networks, and compiler-induced vulnerabilities. She has contributed to methods like probabilistic reachability analysis and fuzzing techniques for identifying security flaws. Brennan has received accolades such as the UCSB Outstanding Dissertation Award (2020) and ICSE Student Research Competition Third Place (2020). She actively serves on program committees for IEEE Security and Privacy, CSF, and BAR conferences, reflecting her leadership in the cybersecurity community. Her grants include CRII: SaTC funding for studying timing channels in neural networks. Courses taught include CS284 (multiple semesters), CS516, CS396, and CS810-E, covering software engineering and advanced security topics.

Yu-Fang Chenمشاهده پروفایل

استاد پژوهشی

• Program verification
• Automata theory
• String constraint solving
• +۳ مورد دیگر

Yu-Fang Chen is a research professor at Academia Sinica, Taiwan, active across premier programming-languages venues such as PLDI, POPL, OOPSLA, SAS, APLAS and VMCAI. His work sits at the intersection of program verification , automata theory and constraint solving , with recent emphasis on quantum-circuit verification and string-number constraint solving . Research interests revolve around rigorous methods to ensure software reliability: developing novel automata models (level-synchronized tree automata, position-constrained string automata), building practical solvers that blend length, substring and numeric constraints, and extending automated reasoning to the quantum domain. His papers consistently introduce new decision procedures, learning algorithms and tool-chains that improve the scalability of static analysis and formal verification. Between 2017 and 2025 he (co-)authored more than a dozen peer-reviewed papers and served on over thirty program committees, including steering and organization chair roles for VMCAI 2026 and SAS 2023 . No doctoral students or funded-grant details are disclosed in the supplied sources.

• Web Services
• Formal Verification
• Software Security
• +۳ مورد دیگر

Xiang Fu is a researcher in the Department of Computer Science at Hofstra University, with affiliations to institutions including Georgia Southwestern State University, University of California, Santa Barbara, and Massachusetts Institute of Technology. His work spans formal verification of web services, software security, zero-knowledge proofs, and automated testing frameworks. His research interests include: Web Services Formal Verification Software Security Zero-Knowledge Proofs Automated Testing Software Engineering Recent publications focus on zero-knowledge auditing for financial systems, formal verification of web services, and secure software analysis. Notable tools developed include APOGEE for automated grading and WISEngineering for scalable online learning. No explicit scientific awards are documented in the provided data.