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

Andrea Coladangeloمشاهده پروفایل

استادیار

• Quantum Computation
• Quantum Cryptography
• Quantum Learning Theory
• +۳ مورد دیگر

Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering , University of Washington , co-leading the Quantum group and contributing to the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program , fostering undergraduate research in quantum information. Previously, he was a postdoctoral researcher at UC Berkeley and the Simons Institute , advised by Umesh Vazirani , following a PhD in Computer Science at Caltech under Thomas Vidick . His academic journey began with a B.A. in Mathematics from Oxford and a Master in Mathematics from Cambridge . He co-founded qBraid , a platform for quantum computing education. Research Interests : Andrea explores the intersection of quantum computation and cryptography , focusing on foundational questions in entanglement , quantum correlations , and quantum learning theory . His work investigates quantum pseudorandomness , device-independent security , quantum algorithms , and quantum copy-protection , often leveraging computational assumptions to bridge quantum information theory with cryptographic applications. Scientific Awards : 2025 Google Research Scholar Program Award in Quantum Computing 2023 CSE Undergraduate Teaching Award for his course on quantum computation 2019 Best Student Paper Award at QIP Teaching & Outreach : Andrea designed and taught CSE 434: Intro to Quantum Computation (Spring 2023, 2024, 2025), CSE 534: Quantum Information and Computation (Autumn 2023), and CSE 599C: Quantum Learning Theory (Winter 2025). He also delivered lectures at the 22nd Bellairs Crypto Workshop (2024) and led a quantum programming tutorial using qBraid . Labs & Teams : As co-leader of the Quantum group at the Allen School, he collaborates with researchers in Theory and Crypto , advancing quantum computing through interdisciplinary projects and educational initiatives.

Nate Fosterمشاهده پروفایل

استاد

• Programming Languages
• Networking
• Databases
• +۵ مورد دیگر

Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.

Cezary Kaliszykمشاهده پروفایل

استاد

• Automated Reasoning
• Formal Methods
• Formalized Mathematics
• +۷ مورد دیگر

Cezary Kaliszyk is a Professor in Theoretical Computer Science at the University of Melbourne, previously affiliated with the University of Innsbruck. He is actively involved in research and leadership in formal methods, automated reasoning, and machine learning for theorem proving. Research Interests: Automated Reasoning and Interactive Theorem Proving Formalized Mathematics and Proof Automation Machine Learning for Logic and Theorem Proving Integration of AI with Proof Assistants (Coq, Isabelle) Dependent Type Theory and Higher-Order Logic His recent publications (2023–2025) span topics in dependently-typed logic, learning for proof guidance, formalization of surreal numbers, and blockchain-based formal methods. The works consistently bridge formal logic with machine learning, emphasizing automation, explainability, and cross-system integration. Scientific Leadership and Projects: Principal Investigator, ERC project FormalWeb3 Lead Developer, CoqHammer , Tactician , ProofWeb WG5 Leader, COST Action EuroProofNet (until 2024) Contributor to HOL(y)Hammer , Isabelle Enigma He supervises multiple PhD students and has mentored several graduates in formal methods and AI. He teaches courses in theoretical computer science, logic, and machine learning. There are no listed awards in the provided data, but his extensive publication record and project leadership indicate significant recognition in the field. Labs and Research Groups: He leads a research group focused on formal methods and learning-based reasoning, collaborating internationally on projects involving proof automation, formal libraries, and semantic technologies.

Mingsheng Yingمشاهده پروفایل

استاد

• Quantum Computation
• Quantum Programming
• Model-checking Quantum Systems
• +۵ مورد دیگر

Mingsheng Ying is a Distinguished Professor and Research Director of the Centre for Quantum Computation and Intelligent Systems (QCIS) at the Faculty of Engineering and Information Technology, University of Technology Sydney, Australia. He also holds the position of Cheung Kong Professor at the State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing, China. Professor Ying graduated from the Department of Mathematics, Fuzhou Teachers College, Jiangxi, China, in 1981. His primary research interests span quantum computation (particularly quantum programming and model-checking quantum systems), programming theory and formal methods, and the foundations of artificial intelligence (focusing on logic and uncertainty). As an author of the books "Foundations of Quantum Programming" (Elsevier - Morgan Kaufmann 2016) and "Topology in Process Calculus: Approximate Correctness and Infinite Evolution of Concurrent Programs" (Springer-Verlag, 2001), he has published over 100 papers in top international journals and conferences. His recent research publications demonstrate a strong focus on quantum programming languages, verification techniques for quantum systems, and the theoretical foundations of quantum computation. The trend in his work shows increasing emphasis on formal verification methods for quantum systems, particularly model-checking techniques for quantum Markov chains and quantum processes. His research bridges theoretical computer science with quantum information theory, creating frameworks for reliable quantum software development. Editorial Board, Artificial Intelligence, Elsevier, Amsterdam Editorial Board, Fuzzy Sets and Systems, Elsevier, Amsterdam Vice President, International Fuzzy Systems Association (elected in 2005) Program Chair, IFSA 2005, World Congress of International Fuzzy Systems Association Chairman, Chinese Association of Fuzzy Systems and Mathematics Professor Ying has secured significant research funding including multiple Australian Research Council Discovery Projects such as "Model-checking quantum Markov chains: towards verification techniques for quantum cryptographic systems" (2013-2015) and "Process algebra approach to distributed quantum computation and secure quantum communication" (2011-2013). His work has also received funding from the National Natural Science Foundation of China and Tsinghua University. At QCIS, he leads research in quantum software theory and methodology, with applications in quantum cryptography and secure communication.

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

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

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

استاد

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

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

Gerardo Schneiderمشاهده پروفایل

استاد

• Formal Specification and Analysis of Contracts
• Formalization of Privacy Policies
• Model Checking
• +۵ مورد دیگر

Gerardo Schneider is a Full Professor in Computer Science at the University of Gothenburg, Sweden, and holds a joint appointment at Chalmers University of Technology. He serves as Head of the Data Science and Artificial Intelligence (DSAI) Division and has previously led the Formal Methods Division and acted as Director of Graduate Studies. University of Gothenburg: 2009–present Chalmers University of Technology: 2009–present Uppsala University: 2002–2003 University of Oslo: 2005–2009 His research focuses on formal methods for software engineering, including contract specification and analysis , privacy policy formalization , model checking , and runtime verification . He works on verification of real-time systems, embedded systems (e.g., smart Java cards), and blockchain-based smart contracts. Key projects include: X-LEGAL (2020–2023): Smart Legal Contracts (Swedish Research Council) PolUser (2016–2019): User-Controlled Privacy Policies (Swedish Research Council) ARVI (2014–2018): Runtime Verification Beyond Monitoring (ICT COST Action) ReMU (2013–2017): Reliable Multilingual Digital Communication (Swedish Research Council) He has supervised numerous PhD and Master’s students in formal methods, blockchain security, and privacy compliance. His tools include SPeeDI (Polygonal Hybrid Systems Verification), CLAN (Contract Normative Conflict Detection), and AnaCon (Controlled Natural Language Analysis).

• Quantum Physics
• Quantum Information Theory
• Quantum Cryptography
• +۵ مورد دیگر

Professor Adrian Kent is a leading academic in quantum physics at the University of Cambridge , affiliated with the Department of Applied Mathematics and Theoretical Physics (DAMTP) and the Centre for Quantum Information and Foundations . He holds a Fellowship at Wolfson College , serves as Director of Studies in Mathematics at Darwin College , and has visiting positions at the Perimeter Institute for Theoretical Physics and Institute for Quantum Computing in Waterloo, Ontario. Research Focus: Quantum foundations, quantum information theory, quantum cryptography, quantum reality problem, decoherence, and postquantum theories. Key Contributions: Barrett-Hardy-Kent protocol, no-summoning theorem, critiques of many-worlds interpretations, and experimental implementations of relativistic quantum bit commitment. His recent publications emphasize quantum gravity , relativistic quantum protocols , quantum non-locality , and tests of quantum theory . The 15 most recent articles explore topics like postquantum theories of gravity, quantum reality via decoherence, quantum tokens, and symmetry breaking in quantum systems. Despite his interdisciplinary work, no specific scientific awards are highlighted in the provided texts. Former Students: Matthias Doerrzapf (St. John's College), Jim McElwaine (Durham University), Jonathan Barrett (University of Oxford), Roger Colbeck (University of York), Damian Pitalua-Garcia (Brussels/Paris), Emily Adlam (2018 graduate). Patents: 4 U.S. patents related to quantum cryptography and tagging systems.

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

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

Anne Remkeمشاهده پروفایل

استاد

• Dependability
• Security
• Critical Infrastructures
• +۵ مورد دیگر

Professor Anne Remke leads the safety-critical systems group at the Faculty of Mathematics and Computer Science at Westfälische Wilhelms-Universität Münster since October 2014. She is also affiliated with the Design and Analysis of Communication Systems group at the University of Twente, where she served as assistant professor from June 2010 and became associate professor in March 2016. Her research focuses on dependability and security in critical infrastructures, particularly electrical power systems and telecommunication networks. Her educational background includes a PhD (2008) and MSc (2004) in Computer Science from the University of Twente and RWTH Aachen respectively. Her doctoral research focused on 'Model Checking Structured Infinite Markov Chains,' for which she publicly defended her thesis in June 2008. Professor Remke's research interests center on cyber-physical systems, with particular focus on evaluation of charging strategies for local energy storage in smart homes and security of control networks (SCADA) in smart grids. Her work bridges theoretical model checking techniques with practical applications in critical infrastructure protection. She has made significant contributions to the analysis of hybrid Petri nets, stochastic models, and the development of tools for dependability evaluation. Her recent publications demonstrate a strong trend toward integrating machine learning with formal verification methods for cyber-physical systems. The research spans stochastic hybrid systems, reachability analysis, and security evaluation of smart grid infrastructures, showing consistent growth in both theoretical foundations and practical applications of dependability analysis. Veni award from Dutch Science foundation (NWO) for 'Counting on a reliable water supply' GI/ITG MMB prize for best diploma thesis in computer and communication systems Best Paper Award at Valuetools 2023 conference Best Repeatability and Artifact Evaluation Award at QEST21 Teaching award from Fachschaft FB10 (2019) Professor Remke has successfully secured multiple research grants including the DFG project 'RealyST: Reachability Analysis for Stochastic Hybrid Systems' in collaboration with RWTH Aachen. She has supervised numerous students including Katharina Sichma, Pauline Blohm, Joanna Delicaris, Verena Menzel, Mathis Niehage, Jonas Stübbe, and Lisa Willemsen. Her research group actively participates in international collaborations and standardization efforts in critical infrastructure security. The safety-critical systems group maintains several research tools including HYPEG (for simulation and analysis of hybrid Petri nets), TimeNET (a GUI for modeling hybrid Petri nets), and a Smart Neighbourhood Simulation Tool for community energy storage and trading. These tools support their research in modeling and evaluating complex critical infrastructures through both analytical methods and simulation techniques.

Jürgen Gieslمشاهده پروفایل

استاد

• Program Verification
• Automated Deduction
• Termination Analysis
• +۱۲ مورد دیگر

Jürgen Giesl is a Professor at the Teaching and Research Area Computer Science 2 within the Department of Computer Science at RWTH Aachen University , Germany. He leads research in programming languages, formal verification, automated deduction, and term rewriting systems. Research Interests: Automated Termination and Complexity Analysis of Programs Dependency Pairs and Term Rewriting Systems Verification of Probabilistic and Integer Programs Static Analysis and Symbolic Execution Model Checking and Constrained Horn Clauses Development of Automated Tools (AProVE, LoAT) His recent research, reflected in the latest publications, focuses on termination and complexity analysis for probabilistic programs, polynomial loops, and integer programs, using advanced techniques such as dependency pairs, loop acceleration, and semiring semantics. He also contributes to SMT solving and transitive relation learning for infinite-state model checking. Scientific Awards: Best Tool Paper Award at iFM 2017 Silver Medal (Second Best Paper) at SEFM '16 Best Paper Honourable Mention at IJCAR 2024 Best Student Paper Honourable Mention at IJCAR 2024 Advising and Grants: Giesl has supervised numerous PhD and Master’s students, including prominent researchers such as Fabian Frohn, Jens Hensel, Nils Lommen, and Marcel Hark. He leads a large research group focused on automated verification and has contributed extensively to international verification competitions. His work is supported by ongoing research grants and collaborations with leading institutions in formal methods. Labs and Teams: He leads the Programming Languages and Verification research group at RWTH Aachen, which develops and maintains the AProVE and LoAT tools. These tools are central to automated termination and complexity analysis and are regularly submitted to international competitions such as TERMCOMP and VBS.

Tanushree Royمشاهده پروفایل

استادیار

• Cybersecurity
• Fault diagnostics
• Socio-technical systems
• +۴ مورد دیگر

Dr. Tanushree Roy serves as an Assistant Professor in the Department of Mechanical Engineering at Texas Tech University's Whitacre College of Engineering and is an Affiliate Faculty member at the National Wind Institute. Her research pioneers resilient human-centric smart city infrastructures through the integration of control theory, mathematical modeling, and machine learning to address critical challenges in safety, security, and resource optimization for urban systems. Her academic foundation includes: Ph.D. in Mechanical Engineering from The Pennsylvania State University (2022) M.S. in Mathematics from University of Central Florida (2015) M.E. in Electrical Engineering from Indian Institutes of Engineering Science and Technology, India (2011) B.Tech in Applied Electronics and Instrumentation from Maulana Abul Kalam Azad University of Technology, India (2009) Dr. Roy's research centers on cybersecurity , fault diagnostics , and socio-technical systems with specialized applications in smart transportation networks and battery energy storage systems. She develops innovative frameworks that merge human-centric sensing with technical measurements to combat cyberattacks and physical faults in cyber-physical-social systems, emphasizing safety-critical resilience for urban citizens. Her methodology uniquely combines model-based control with data-driven machine learning to address challenges like social data integrity, human behavior modeling, and multi-scale anomaly characterization. Analysis of her 15 most recent publications (2021-2025) reveals dominant trends in cyberattack detection for connected vehicles, thermal fault tolerance in battery systems, and socio-technical traffic modeling. Key technical approaches include Koopman operator theory for secure estimation, control barrier functions for safety certification, and redundancy-based data fusion techniques. These works consistently bridge theoretical control systems with practical smart city implementation, demonstrating strong interdisciplinary connections between transportation engineering, energy systems, and cybersecurity. No scientific awards are documented in the provided information. Dr. Roy actively mentors three PhD students—Sanchita Ghosh (since 2022), Faysal Ahamed, and Soumyoraj Mallick (both since 2024)—alongside undergraduate researcher Mercedes Hernandez. Her research is executed through the Smart Human-centric Automation Resilience (SHARE) Lab, which has secured projects including the secure autonomous mobility testbed and participates in workforce development via Texas Tech's Engineering Research Internship Experience (ERIE) program for high school students. The SHARE Lab operates at the intersection of transportation and energy systems, maintaining two primary research thrusts: resilient human-centric transportation networks and safeguarding battery energy storage infrastructure. Current projects include SUMO-based cyberattack validation for connected vehicle platoons, self-learning voltage estimation under sensor attacks, and thermal fault-tolerant battery management. The lab maintains active collaborations with national conferences (ACC, CCTA) and industry partners to advance real-world implementation of resilient smart city technologies.

Victor Vianuمشاهده پروفایل

استاد

• Database Systems
• Database Theory
• Computer-Aided Verification
• +۴ مورد دیگر

Victor Vianu is a Professor in the Department of Computer Science and Engineering at University of California, San Diego. His work bridges database systems, computational logic, and verification of data-driven workflows. Co-author of the influential book Foundations of Databases (1995) PI of NSF grant III 1815247: Views of Data-Driven Business Processes: Foundations and Applications Research Focus He studies verification of database-driven systems, workflow views, and query language theory. His NSF-funded project explores view-based abstraction mechanisms for business processes, integrating logic, automata theory, and infinite-state system analysis. Teaching Victor teaches courses in database systems, logic for computer science, and database theory, including CSE 132A, CSE 205A, and CSE 233. Labs & Collaborations Active member of the UCSD Database Laboratory , collaborating with institutions like INRIA, ENS-Paris, and University of Lille. Leads research seminars in database theory.

Rayna Dimitrovaمشاهده پروفایل

استادیار

• Verification
• Reactive Systems Synthesis
• Control and Robotics
• +۳ مورد دیگر

Rayna Dimitrova is a Tenure-track faculty member at the CISPA Helmholtz Center for Information Security in Saarbrücken, Germany. Previously, she held positions as Lecturer (Assistant Professor) at the University of Sheffield and University of Leicester, and postdoctoral roles at the University of Texas at Austin and the Max Planck Institute for Software Systems. She earned her PhD from Saarland University. Her research focuses on formal methods, including verification and synthesis of reactive systems, applications to control and robotics, quantitative analysis of probabilistic systems, and information-flow security. Key interests include strategic synthesis under partial observability, probabilistic uncertainty, and continuous dynamics, with applications to autonomous systems. She has served in numerous prestigious roles, including PC co-chair for VMCAI 2024, HYPER 2023, and SMT 2018. Her awards include the RS3 Best Paper Award (VMCAI 2012) and nominations for ETAPS (TACAS 2015) and EMSOFT (2014) Best Paper Awards. Her research group includes PhD students Rafael Dewes, Philippe Heim, and Saleh Soudijani. She has taught courses on reactive synthesis, program analysis, and decision procedures at multiple institutions, including the University of Sheffield and TU Kaiserslautern.

Orna Kupfermanمشاهده پروفایل

استاد

• Formal verification
• Reactive systems
• Automata theory
• +۱۱ مورد دیگر

Orna Kupferman is a Professor at the Hebrew University of Jerusalem, where she has been a faculty member since 1998 and a full professor since 2008. She currently serves as the Vice Rector of the Hebrew University (since 2012) and has previously held leadership positions including Chair of the School of Engineering (2008-2011) and Head of the Computer Science Department (2005-2007). Her educational background includes a Ph.D. from The Technion, Israel (1995). She has held visiting positions at prestigious institutions including Rice University, UC Berkeley, and Microsoft Research. Professor Kupferman's research focuses on the theoretical foundations of formal verification and synthesis of computer systems. She is renowned for her work on the automata-theoretic approach to branching-time model checking and synthesis, as well as her influential work on safraless decision procedures for automata on infinite words. Her research spans several key areas: Formal verification and synthesis of reactive systems Automata theory and temporal logic Model-checking and game-based verification approaches Sanity checks in formal methods (vacuity, coverage, query checking) Formal measures of quality for reactive systems Professor Kupferman has published extensively with over 40 journal papers and 140 conference papers. She chaired the IEEE Symposium on Logic in Computer Science (LICS) in 2013 and has been a keynote speaker at major conferences including LICS, CONCUR, ICALP, and TACAS. She serves as Editor-in-Chief of the ACM Transactions on Computational Logic and is on the Editorial Board of Formal Methods in System Design and Logical Methods in Computer Science. Her notable awards include: ERC starting grant (2012-2017) for "From Correct to High-Quality Reactive systems" Michael Milken Prize for long-standing Excellence in Teaching Professor Kupferman has advised 5 PhD students and has secured numerous competitive grants, including those promoting international research cooperation between Israel and the United States, and Israel and Germany. Beyond her academic work, she volunteers by giving encouraging talks at high schools and drug-addiction centers.