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

Kemafor Anyanwu Oganمشاهده پروفایل

دانشیار

• Semantic Web
• Big Data Management and Analytics
• Internet of Things
• +۸ مورد دیگر

Kemafor Anyanwu Ogan serves as Associate Professor in the Department of Computer Science at North Carolina State University's College of Engineering, where he directs the Semantic Computing Lab. His research bridges theoretical foundations with practical applications in data-intensive systems, supported by continuous funding from major agencies since 2012. His educational foundation includes: Ph.D. in Big Data and Knowledge Management, Semantic Web, and Internet of Things from the University of Georgia (2007) Dr. Ogan's research program centers on scalable semantic technologies, with evolving focus from foundational Semantic Web and knowledge graph processing (2014-2019) to blockchain-integrated systems (2021-2024). His work develops novel frameworks for RDF query optimization, knowledge graph analytics, and blockchain transaction primitives that address critical challenges in distributed data management. Current efforts emphasize agricultural supply chain transparency and smart manufacturing applications. Publication trends reveal strategic progression from MapReduce-based RDF processing to blockchain-enhanced architectures, reflecting adaptation to emerging computational paradigms while maintaining core expertise in semantic data management. Recent work demonstrates increasing industry relevance through manufacturing and agricultural applications. His scientific recognition includes: Three IBM Faculty Awards (2008, 2009, 2016) Best Paper Award at JIST 2012 Best Student Paper Award Nominee at ISWC 2014 Dr. Ogan has secured $2.3M+ in competitive funding across 10 major grants, with current projects focused on blockchain for agricultural resilience (USDA), declarative blockchain transactions (Cisco), and crop productivity analytics (GRIP4PSI). His Semantic Computing Lab actively collaborates with RENCI, IBM, and agricultural industry partners to translate research into real-world impact, particularly in food supply chain optimization and smart contract reliability. The Semantic Computing Lab drives innovation through NSF-funded projects like SmartChainDB and SERPENT, developing semantically-enhanced blockchain platforms that enable trustless smart marketplaces while addressing critical performance limitations in existing systems.

• Database Systems
• Query Optimization
• Cardinality Estimation
• +۳ مورد دیگر

Dan Suciu is a Professor at the University of Washington, specializing in database systems and theoretical computer science. His research focuses on query optimization, cardinality estimation, information theory, and the intersection of databases with programming languages and fairness concerns. He has collaborated extensively with researchers like Magdalena Balazinska, Mahmoud Abo Khamis, and Christopher Ré. His work spans foundational database theory, algorithm design, and practical systems. Key areas include worst-case optimal joins, equality saturation for query optimization, and applying information theory to cardinality estimation. Recent projects explore causal reasoning in databases and algorithmic fairness through database repair techniques. Publications highlight advancements in join algorithms, estimation frameworks (e.g., SafeBound, LpBound), and theoretical results in semiring-based query evaluation. His work bridges theory and practice, influencing both academic research and industrial systems. Notable contributions include the Seattle and Cambridge reports on database research, outlining field priorities. His systems like Mosaic and Themis address open-world data and approximate query processing.

Matthieu Perrinمشاهده پروفایل

دانشیار

• Distributed Computing
• Message-Passing Systems
• Weakly Consistent Data Structures
• +۳ مورد دیگر

Matthieu Perrin is an Associate Professor at the University of Nantes, affiliated with the GDD team at LS2N (Laboratoire des Sciences du Numérique de Nantes). He holds a PhD from the University of Nantes (2016), advised by Claude Jard and Achour Mostéfaoui. His research focuses on distributed computing, particularly message-passing systems, weak consistency models, and distributed algorithms. He has co-advised PhD students including Grégoire Bonin and supervised undergraduate projects like Damien Maussion's work on weak consistency enforcement. Key contributions include seminal work on differentiated consistency for gossip protocols, causal broadcast algorithms, and extensions of the Herlihy wait-free hierarchy to multi-threaded systems. His publications span journals like IEEE TPDS and conferences such as EuroSys and PODC. Perrin's work bridges theoretical foundations (e.g., consistency models) with practical implementations (e.g., state-machine replication for large-scale systems). He collaborates widely, including postdoctoral work at Technion and IMDEA Software Institute.

Irek Ulidowskiمشاهده پروفایل

دانشیار

• Reversible Computation
• Process Calculi
• Operational Semantics
• +۵ مورد دیگر

Irek Ulidowski is an Associate Professor in Computer Science at the University of Leicester, affiliated with the School of Computing and Mathematical Sciences within the College of Science and Engineering. He holds a BSc in Mathematics with Computer Science from Queen Mary College, University of London (1987), an MSc in Foundations of Advanced Information Technology from Imperial College, University of London (1988), and a PhD (1994) from Imperial College for his thesis on 'Local Testing and Implementable Concurrent Processes'. His research focuses on Reversible Computation, including models of reversible processes, semantics of concurrency, process calculi, and structured operational semantics. He has contributed to areas such as reversible debugging of concurrent programs, biochemical systems modeling, and term rewriting with priorities. His work also explores applications in ubiquitous computing and formal methods. Prof. Ulidowski has organized major conferences like CONCUR 2012 and the Reversible Computation series, and chairs the Steering Committee of Reversible Computation conferences. He is a founding member of IFIP WG 1.8 on Concurrency Theory and an editor of Electronic Proceedings in Theoretical Computer Science. He has supervised PhD students including James Hoey, Stefan Kuhn, Daniel Morrison, and Nosheen Gul. His teaching includes courses like CO1108: Foundations of Computation and CO7210: Personal and Group Skills. He currently serves as Director of Part-time Teaching. His research has been supported by grants such as the EPSRC grant for the Reversible Computation 2009 workshop. His publications span journals like New Generation Computing, Journal of Logical and Algebraic Methods in Programming, and conferences like CONCUR and RC.

• Membrane Computing
• Theoretical Computer Science
• Formal Languages
• +۳ مورد دیگر

Marion Oswald is an External Lecturer at the Technische Universität Wien (TU Wien), affiliated with the Institute of Logic and Computation under the Faculty of Informatics. Her research focuses on membrane computing, P systems, spiking neural P systems, formal languages, and computational models. She has contributed to projects such as the Austrian Science Fund (FWF)-funded initiative on the theoretical foundations of membrane systems (2004–2007). Oswald holds a Diplom-Ingenieur (2001) and a Dr.techn. (2003) from TU Wien. She has supervised theses including work on tissue P systems and applications of membrane systems in distributed systems. Her educational background includes advanced studies in molecular computations and formal languages. Research interests extend to computational complexity, neural networks, and discrete mathematics. Oswald has taught courses such as 'Theoretical Computer Science' and 'Fundamentals of Computer Science for Geodesy and Geomatics Engineering.' Key contributions include advancing computational models like spiking neural P systems, exploring control mechanisms in P systems, and investigating undecidability in array-based computational frameworks. Her work bridges theoretical computer science with practical applications in neuroscience and distributed systems modeling.

Giles Regerمشاهده پروفایل

مدرس ارشد

• Automated Theorem Proving
• Runtime Verification
• Formal Methods
• +۳ مورد دیگر

Giles Reger is a Senior Lecturer in the School of Computer Science at the University of Manchester, where he leads research in the Formal Methods Group. His academic background includes a BA in Computer Science from the University of Cambridge (2009), an MSc in Advanced Computer Science from the University of Manchester (2010, Highest Achiever Award), and a PhD from Manchester (2014) on Automata-based monitoring and mining of execution traces . Research interests focus on: Theorem Proving : Core developer of the Vampire first-order ATP system, working on performance extensions and collaborative proving techniques Runtime Verification : Creator of the MarQ monitoring tool and organizer of the International Runtime Verification Competition Formal Methods : Applications in program verification, specification mining, and temporal logic Publications emphasize automated reasoning, verification tools, and temporal specification languages, with recent work exploring neural-guided theorem proving and higher-order unification. His group consistently publishes at top venues like CADE, TACAS, and RV. Awards include: Multiple division wins in SMTCOMP/CASC theorem proving competitions (2016-2020) FLoC Olympic Games medals for Vampire contributions (2018) Advises PhD students including Michael Rawson (neural-guided proving) and Joshua Dawes (runtime verification). Leads the £1.3M EPSRC-funded SCorCH project (Secure Code for Capability Hardware) with Oxford/ARM/AWS. Coordinates the COST Action on Runtime Verification Beyond Monitoring.

Johannes Lenfersمشاهده پروفایل

پژوهشگر

• Auto-Tuning
• Auto-Scheduling
• Compilation
• +۳ مورد دیگر

Johannes Lenfers is a Researcher at the University of Münster since 2019. His research focuses on Auto-Tuning, Auto-Scheduling, and Compilation techniques, emphasizing high-performance computing and functional programming approaches. He holds a research position in the Department of Computer Science, contributing to projects like SkelCL and PACXX. Professional Background: 07.2022–09.2022: Research Visit at the University of Edinburgh 02.2020–04.2020: Research Stay at the University of Glasgow Since 2019: Research Associate at the University of Münster Research Interests: Development of compiler optimization frameworks Functional programming paradigms for high-performance systems Auto-tuning and Bayesian methods in compiler design Publications Highlight: His work on the BaCO framework (ASPLOS '23) demonstrates portable Bayesian compiler optimizations, while his 2023 Communications of the ACM article explores rewrite strategies for performance optimization. Contact: Located at Einsteinstr. 62, Room 707, Münster. Email: j.lenfers@uni-muenster.de . Active on LinkedIn and ORCID.

Adam Chlipalaمشاهده پروفایل

استاد

• Programming Languages
• Formal Methods
• Computer Systems
• +۱۲ مورد دیگر

Adam Chlipala is the Arthur J. Conner (1888) Professor of Computer Science at the Massachusetts Institute of Technology (MIT), where he is a faculty member in the Department of Electrical Engineering and Computer Science (EECS), the Computer Science and Artificial Intelligence Laboratory (CSAIL), and leads the Programming Languages & Verification Group. He has been a faculty member at MIT since 2011, following a postdoctoral position at Harvard University. PhD in Computer Science, UC Berkeley (2007) BS in Computer Science, Carnegie Mellon University (2003) His research lies at the intersection of programming languages and formal methods, with a strong emphasis on using the Coq proof assistant to build verified compilers, cryptographic systems, and hardware-software stacks. His work spans from high-level language design to gate-level hardware verification, aiming for end-to-end correctness proofs. Recent efforts focus on high-performance parallel computing systems with full formal assurance. The 15 most recent publications highlight a consistent trend in verified compilation, cryptographic security, hardware verification, and tensor/ML program optimization. His work increasingly integrates software and hardware verification, emphasizing modular, extensible frameworks and end-to-end correctness. Key themes include side-channel resistance, automated proof techniques, and practical deployment of formally verified systems. Advisory Board Member, BlueRock Systems (formerly BedRock Systems) Member, DARPA Information Science and Technology (ISAT) Study Group (2018–2022) Advisory Board Member, SiFive Former Advisor, krypt.co (acquired by Akamai) Chlipala has advised numerous PhD and Master’s students and regularly teaches core MIT courses such as 6.009 (Fundamentals of Programming), 6.042 (Mathematics for Computer Science), and 6.822/6.5120 (Formal Reasoning About Programs). He is the author of the widely used textbook Certified Programming with Dependent Types and co-developer of the FRAP (Formal Reasoning About Programs) educational materials. He is also the founder of Nectry, a startup based on Ur/Web and UPO, aiming to democratize enterprise application development through AI-assisted, type-safe programming. His research group develops tools and frameworks for modular verification, verified compilation, and formal analysis of complex digital systems. The work is deeply collaborative, involving students, industry partners, and open-source contributions via GitHub. Projects like Fiat Cryptography have been deployed in major web browsers, demonstrating real-world impact.

Vikram Adveمشاهده پروفایل

استاد

• Compiler Infrastructure
• Computer Systems and Architecture
• Edge Computing
• +۶ مورد دیگر

Vikram Adve is the Donald B. Gillies Professor of Computer Science at the University of Illinois at Urbana-Champaign, with appointments in both the Computer Science Department and the Center for Digital Agriculture. He co-founded and co-leads the Center for Digital Agriculture and serves as the director of AIFARMS, a $20M National Artificial Intelligence Research Institute funded by USDA NIFA and NSF. Adve has been a professor at UIUC since August 2011 and previously served as Interim Head of the Computer Science Department from 2017 to 2019. Adve received his Ph.D. in Computer Science from the University of Wisconsin-Madison in 1993. His academic journey has been marked by significant contributions to compiler infrastructure and computer systems research, culminating in his current distinguished professorship at one of the world's leading computer science departments. Adve's research spans multiple cutting-edge domains in computer systems. His work on the LLVM Compiler Infrastructure has revolutionized how software is compiled and optimized across diverse hardware platforms. Currently, his research focuses on three primary thrusts: Digital Agriculture and AI : Through the Center for Digital Agriculture and AIFARMS Institute, he's developing AI solutions for agricultural challenges, including the CropWizard system for generative AI in farming Edge Computing : His HPVM, ApproxHPVM, and ApproxTuner projects address the programming challenges of heterogeneous computing at the network edge Compiler Innovation : His Hydride and MISAAL projects use program synthesis to automatically build compilers for complex hardware architectures His work bridges theoretical compiler research with practical applications in agriculture, autonomous systems, and distributed computing. Adve's publication record demonstrates a consistent trajectory from foundational compiler research to applied AI systems. Early work focused on memory safety (SAFECode), deterministic parallel programming (DPJ), and the LLVM infrastructure. More recently, his publications reflect a strategic pivot toward agricultural AI and edge computing, with significant contributions to generative AI applications, compiler techniques for heterogeneous systems, and multimodal data processing for precision agriculture. His work maintains strong theoretical foundations while addressing real-world challenges in resource-constrained environments. Adve's scientific recognition includes numerous prestigious awards: ACM Software System Award (2012) for LLVM ACM Fellowship (2014) NSF CAREER Award (2001) Multiple best paper awards at top conferences including PLDI 2005, SOSP 2007, and CGO 2004 (retrospective) University Scholar designation at UIUC (2015) Donald B. Gillies Professorship (2018) Distinguished Alumnus Award from IIT Bombay (2023) As an advisor, Adve has mentored numerous successful students, including Chris Lattner (co-creator of LLVM), Robert Bocchino (ACM SIGPLAN Outstanding Dissertation Award winner), and John Criswell (ACM Doctoral Dissertation Award Honorable Mention). His research group has secured significant funding from diverse sources including USDA NIFA, NSF, Intel Corporation, Amazon-Illinois AICE Center, and the state of Illinois through the Discovery Partners Institute. Current projects include the $20M AIFARMS institute and multiple edge computing initiatives focused on agricultural robotics and distributed AR/VR systems. Adve leads the Programming Languages, Systems, and Networking research group at UIUC, which maintains strong connections with industry partners. His group's work on LLVM has had widespread industry impact, with applications in Apple's iOS ecosystem, Android, NVIDIA GPUs, and numerous other commercial products. The group's current focus on agricultural AI through the Center for Digital Agriculture represents a strategic expansion into domain-specific applications of systems research.

Clark Barrettمشاهده پروفایل

استاد

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

Clark Barrett is a Professor in the Department of Computer Science at Stanford University, where he conducts research in formal methods, automated reasoning, and verification. He is affiliated with several research centers including the Stanford Center for Automated Reasoning, Stanford Center for AI Safety, Stanford Agile Hardware Project, and Stanford Center for Blockchain Research. His research focuses on developing formal methods and tools for verifying complex systems, with particular emphasis on satisfiability modulo theories (SMT), verification of neural networks, hardware design verification, and security. His work bridges theoretical foundations with practical applications across multiple domains. Over the past decade, Barrett's research has evolved from foundational work in SMT solving to increasingly diverse applications including neural network verification, hardware verification, and AI safety. His recent publications demonstrate a strong focus on practical verification techniques for real-world systems, particularly in the areas of hardware design, neural networks, and programming languages. The trend shows an expansion from core verification techniques to broader applications in AI safety and secure systems design. 2021 CAV (Computer Aided Verification) Award Barrett leads several major research initiatives and collaborates extensively with industry partners. His work on the Marabou neural network verification framework, SMT-LIB standard, and Symbolic QED verification methodology have had significant impact in both academic and industrial settings. He has supervised numerous PhD students and postdoctoral researchers who have gone on to successful careers in academia and industry. He is a key member of the Stanford Center for Automated Reasoning, which develops foundational technologies for automated reasoning, and the Stanford Center for AI Safety, where he focuses on formal methods for ensuring the safety and reliability of AI systems. His work on the Stanford Agile Hardware Project aims to revolutionize hardware design through formal methods and verification techniques.

Pascal Weisenburgerمشاهده پروفایل

پژوهشگر

• Programming Languages
• Multitier Programming
• Tierless Programming
• +۱۲ مورد دیگر

Pascal Weisenburger is a researcher at the School of Computer Science , University of St. Gallen. His work focuses on programming languages for distributed systems , emphasizing multitier programming, reactive paradigms, and type-driven placement reasoning. Research Themes : Multitier programming languages, CRDTs, dynamic placement type systems, reactive microservices, compiler correctness, and domain-specific scheduling. Recent Articles : Explored E-graphs for disequality reasoning (POPL 2025), array type duality in functional languages (ECOOP 2024), and formal verification of CRDTs (PLDI 2023). Committee Roles : Participated in program/steering committees for ECOOP, SPLASH, APLAS, and IEEE BigData conferences. Key Contributions : Developed the ScalaLoci language for multitier systems, proposed Propel for algebraic property verification, and introduced Dyno for static reasoning in dynamic placement scenarios.

Adam Chlipalaمشاهده پروفایل

استاد

• Programming Languages
• Formal Methods
• Computer Systems
• +۶ مورد دیگر

Adam Chlipala is the Arthur J. Conner Professor of Computer Science at the Massachusetts Institute of Technology (MIT). His work bridges programming languages, formal methods, computer systems, and security, with a focus on building practical systems verified end-to-end using the Coq proof assistant. He has advised numerous PhD and Master’s students and leads research into verified compilers, hardware-software stacks, and dependent types for real-world applications through his startup Nectry. Undergraduate: Carnegie Mellon University, 2003 PhD: University of California, Berkeley, 2007 Postdoc: Harvard University, through 2011 His research revolves around verified compilers , hardware-software co-verification , and dependent types for enterprise software . Recent work explores high-performance parallel computing stacks and end-to-end machine-checked proofs for cryptographic systems. His publications span conferences like PLDI, POPL, and ICFP, emphasizing formal verification, optimization, and security. Current research trends highlight verified cryptographic code , concurrent hardware verification , and DSLs with formal guarantees . His students work on topics from state machines to network switches and parallel computing frameworks. Coq Proof Assistant Verified Compilation Cryptographic Security Dependent Types Hardware Verification High-Performance Computing Chlipala has served on program committees for CoqPL, Dafny, CPP, and PLDI. He co-created the MIT course Formal Reasoning About Programs and authored two books: Certified Programming with Dependent Types and Formal Reasoning About Programs .

Jian Tangمشاهده پروفایل

استاد

• Database Systems
• Distributed Computing
• Data Mining
• +۳ مورد دیگر

Dr. Jian Tang is a Professor in the Department of Computer Science at Memorial University of Newfoundland. He holds a M.Sc. from the University of Iowa and a Ph.D. from Penn State University. His primary affiliation is within the Faculty of Science. His research focuses on database systems, distributed computing, data mining, and IoT security. Key projects include fault tolerance in distributed systems, workflow management, intrusion detection in IoT networks, and machine learning applications in healthcare and genomics. He has published extensively on topics like autonomous IoT security systems, feature selection methods for microarray data, and probabilistic resource scheduling in grid environments. Dr. Tang’s work bridges theoretical foundations with practical implementations, particularly in cybersecurity, bioinformatics workflows, and scalable distributed systems. His recent publications emphasize real-time autonomous IoT security solutions and machine learning-driven predictive models for healthcare outcomes.

• Theoretical Computer Science
• Formal Methods
• Rewriting Systems
• +۴ مورد دیگر

Kiraku Shintani is affiliated with the Japan Advanced Institute of Science and Technology (JAIST), a leading research institution in Japan focused on science and technology. He actively contributes to the field of theoretical computer science, particularly in formal methods and programming language theory, as evidenced by his participation in the POPL 2024 conference and contribution to the CPP workshop. His research centers on foundational aspects of computation, with a focus on confluence and commutation properties in rewriting systems. These are essential for ensuring the correctness and determinism of computational systems, especially in functional programming and proof assistants. His work applies logical frameworks to certify proofs mechanically, enhancing trust in automated reasoning tools. The recent publication demonstrates a method for certifying confluence and commutation using parallel critical pairs, indicating deep engagement with advanced topics in proof theory and automated verification. This reflects a strong trend in formal verification, aiming to increase the reliability of software and logical systems through machine-checked proofs. Certification of Confluence- and Commutation-Proofs via Parallel Critical Pairs (2024) Kiraku Shintani advises no publicly listed students and there is no mention of grants or funding sources in the available material. However, his research likely involves collaboration within formal methods groups at JAIST or through international academic networks associated with conferences like POPL and CPP. He is likely involved in research teams or labs focused on programming languages, formal verification, or logical frameworks at JAIST, though specific lab names or team structures are not mentioned in the provided texts.

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

Jedidiah McClurg is an Assistant Professor in the Department of Computer Science at Colorado State University, with prior faculty appointments at Colorado School of Mines and the University of New Mexico. He received his Ph.D. in Computer Science from the University of Colorado Boulder in 2018, where he was a member of the CUPLV research group under the supervision of Pavol Cerny. His research focuses on programming languages, program synthesis, verification, and their applications in networking, compilers, and distributed systems. His educational background includes an M.S. in Computer Science from Northwestern University (2013) and a B.S. in Electrical Engineering from the University of Iowa (2009). He has completed internships at Microsoft Research (RiSE Group, 2014) and Rockwell Collins (2011, 2013, 2004). McClurg’s research interests include programming languages, formal verification, software synthesis, software-defined networking, compilers, and system security. His work aims to develop tools and techniques that help programmers write more secure, reliable, and efficient code, especially in safety-critical domains. He has led multiple NSF-funded projects, including FMitF and CRII grants, totaling over $1 million in funding. His recent publications span high-impact venues such as PLDI, CAV, DISC, and SOSR, with topics ranging from neural network optimization and regular expression synthesis to network program verification and FEC code generation. These works reflect a consistent trend toward automating correctness, improving performance, and enabling scalable solutions in systems and networking. NSF CRII: SHF: Foundations for Stateful Network Programming ($175,000) NSF FMitF: Game Theoretic Updates for Network & Cloud Functions ($355,000 for him) NSF FMitF: Robust Enforcement of Customizable Resource Constraints ($250,000 for him) NSF GRFP (awarded to student Lauren Baker) He has advised multiple graduate and undergraduate students, many of whom have secured positions at leading tech companies such as Google, Apple, and Amazon. He is actively involved in academic service, having served on program committees for PLDI, SOSR, CAV, and others, and as a reviewer for journals like IEEE/ACM Transactions on Networking (ToN) and ACM Transactions on Software Engineering (TSE). He also contributes to open-source research via GitHub and maintains a strong online academic presence.