World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
7538
World Ranking
7610
National Ranking
3297

Research.com Recognitions

  • 2016 - ACM Senior Member
  • 2016 - ACM Distinguished Member

Overview

Tevfik Bultan is affiliated with the University of California, Santa Barbara in the United States. Their research contributions span multiple areas within computer science, with a particular focus on software engineering, security, and systems analysis.

The recent research papers by Tevfik Bultan include:

  • "Quantifying permissiveness of access control policies," 2022, Proceedings of the 44th International Conference on Software Engineering
  • "PReach," 2022, Proceedings of the 44th International Conference on Software Engineering
  • "Obtaining Information Leakage Bounds via Approximate Model Counting," 2023, Proceedings of the ACM on Programming Languages
  • "CorbFuzz: Checking Browser Security Policies with Fuzzing," 2021, 2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE)
  • "Software Security Analysis in 2030 and Beyond: A Research Roadmap," 2024, ACM Transactions on Software Engineering and Methodology

Tevfik Bultan frequently collaborates with several co-authors, including:

  • İsmet Burak Kadron (6 publications)
  • Seemanta Saha (4 publications)
  • William Eiers (3 publications)
  • Mara Downing (3 publications)
  • Chaofan Shou (3 publications)

The scientist's publications often appear in well-known venues such as:

  • arXiv (Cornell University) with 5 publications
  • Proceedings of the 44th International Conference on Software Engineering (2 publications)
  • Proceedings of the ACM on Programming Languages (1 publication)
  • ACM Transactions on Software Engineering and Methodology (1 publication)
  • 2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE) (1 publication)

The main field of study for Tevfik Bultan is Computer Science, with a total of 40 publications, further specializing into subfields such as:

  • Artificial Intelligence (11 publications)
  • Signal Processing (10 publications)
  • Information Systems (8 publications)
  • Software (8 publications)
  • Computer Networks and Communications (2 publications)

The core topics covered in their research work include:

  • Advanced Malware Detection Techniques (20 publications)
  • Security and Verification in Computing (12 publications)
  • Software Testing and Debugging Techniques (10 publications)
  • Web Application Security Vulnerabilities (6 publications)
  • Software Engineering Research (6 publications)
  • Software Reliability and Analysis Research (6 publications)
  • Information and Cyber Security (4 publications)

Tevfik Bultan has been recognized as an ACM Senior Member and an ACM Distinguished Member since 2016.

Best Publications

  • Analysis of interacting BPEL web services

    Xiang Fu;Tevfik Bultan;Jianwen Su

  • Conversation specification: a new approach to design and analysis of e-service composition

    Tevfik Bultan;Xiang Fu;Richard Hull;Jianwen Su

  • Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic

    Tevfik Bultan;Richard Gerber;William Pugh

  • Conversation protocols: a formalism for specification and verification of reactive electronic services

    Xiang Fu;Tevfik Bultan;Jianwen Su

  • WSAT: A tool for formal analysis of Web services

    Xiang Fu;Tevfik Bultan;Jianwen Su

  • STRANGER: an automata-based string analysis tool for PHP

    Fang Yu;Muath Alkhalaf;Tevfik Bultan

  • Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results

    Tevfik Bultan;Richard Gerber;William Pugh

  • Deciding choreography realizability

    Samik Basu;Tevfik Bultan;Meriem Ouederni

  • Synchronizability of conversations among Web services

    X. Fu;T. Bultan;J. Su

  • Automated verification of access control policies using a SAT solver

    Graham Hughes;Tevfik Bultan

  • Realizability of Choreographies Using Process Algebra Encodings

    G. Salaün;T. Bultan;N. Roohi

  • Analyzing conversations of Web services

    T. Bultan;J. Su;X. Fu

  • A new mapping heuristic based on mean field annealing

    Tevfik Bultan;Cevdet Aykanat

  • Automata-Based Model Counting for String Constraints

    Abdulbaki Aydin;Lucas Bang;Tevfik Bultan

  • Symbolic String Verification: An Automata-Based Approach

    Fang Yu;Tevfik Bultan;Marco Cova;Oscar H. Ibarra

  • Choreography conformance via synchronizability

    Samik Basu;Tevfik Bultan

  • Towards a theory of web service choreographies

    Jianwen Su;Tevfik Bultan;Xiang Fu;Xiangpeng Zhao

  • Conversation protocols: a formalism for specification and verification of reactive electronic services

    Xiang Fu;Tevfik Bultan;Jianwen Su

  • Formal Verification of e-Services and Workflows

    Xiang Fu;Tevfik Bultan;Jianwen Su

  • Specification of Realizable Service Conversations Using Collaboration Diagrams

    T. Bultan;Xiang Fu

Frequent Co-Authors

Jianwen Su
Jianwen Su University of California, Santa Barbara
Oscar H. Ibarra
Oscar H. Ibarra University of California, Santa Barbara
Richard A. Kemmerer
Richard A. Kemmerer University of California, Santa Barbara
Constance L. Heitmeyer
Constance L. Heitmeyer United States Naval Research Laboratory
Cevdet Aykanat
Cevdet Aykanat Bilkent University
Tao Xie
Tao Xie Peking University
William Pugh
William Pugh University of Maryland, College Park
Andreas Zeller
Andreas Zeller Saarland University
Richard Hull
Richard Hull Spring Hills Foundation
Koushik Sen
Koushik Sen University of California, Berkeley

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA unlocks various academic and professional routes. Many students also consider adjacent technical fields. For example, earning an online bachelor's degree in physics can open doors in research, tech, or engineering.

For those seeking graduate-level skills, choosing the cheapest master in data science provides advanced knowledge in a sector experiencing rapid growth, making graduates highly employable in data-driven roles.

If electronics and hardware innovation interest you, pursuing an online bachelor’s in electrical engineering is a flexible way to launch a high-demand career in technology or utilities.

Not everyone needs a full degree to upgrade their prospects. There are certifications that pay well, letting you quickly reskill or specialize while potentially increasing your earning potential.

Exploring these related options allows you to tailor your educational journey to match your career ambitions and interests—whether you want a broad technical foundation or a fast track into a specific sector.

Best Scientists Citing Tevfik Bultan

Trending Scientists

Recently Published Articles