Tevfik Bultan

From MaRDI portal
(Redirected from Person:344798)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Automata-based model counting for string constraints2018-03-01Paper
On deciding synchronizability for asynchronously communicating systems
Theoretical Computer Science
2016-11-24Paper
Deciding choreography realizability
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
2015-09-11Paper
On reachability and safety in infinite-state systems
International Journal of Foundations of Computer Science
2015-04-30Paper
Automata-based symbolic string analysis for vulnerability detection
Formal Methods in System Design
2014-06-30Paper
Interface-based specification and verification of concurrency controllers2013-08-30Paper
Synchronizability for Verification of Asynchronously Communicating Systems
Lecture Notes in Computer Science
2012-06-15Paper
Relational string verification using multi-track automata
International Journal of Foundations of Computer Science
2012-03-13Paper
Relational string verification using multi-track automata
Implementation and Application of Automata
2011-02-11Paper
Conversation protocols: a formalism for specification and verification of reactive electronic services
Implementation and Application of Automata
2010-05-07Paper
Efficient image computation in infinite state model checking.
Lecture Notes in Computer Science
2010-04-20Paper
Action language verifier: An infinite-state model checker for reactive software specifications
Formal Methods in System Design
2010-02-05Paper
Symbolic String Verification: Combining String Analysis and Size Analysis
Tools and Algorithms for the Construction and Analysis of Systems
2009-03-31Paper
Highly dependable concurrent programming using design for verification
Formal Aspects of Computing
2007-08-23Paper
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science
2006-10-25Paper
Computer Aided Verification
Lecture Notes in Computer Science
2006-01-10Paper
Efficient Symbolic Representations for Arithmetic Constraints in Verification
International Journal of Foundations of Computer Science
2005-10-19Paper
Computer Aided Verification
Lecture Notes in Computer Science
2005-08-25Paper
Computer Aided Verification
Lecture Notes in Computer Science
2005-08-25Paper
Conversation protocols: a formalism for specification and verification of reactive electronic services
Theoretical Computer Science
2005-01-11Paper
scientific article; zbMATH DE number 2086591 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2084712 (Why is no real title available?)2004-08-09Paper
Past pushdown timed automata and safety verification.
Theoretical Computer Science
2004-03-14Paper
scientific article; zbMATH DE number 1980999 (Why is no real title available?)2003-09-15Paper
scientific article; zbMATH DE number 1962792 (Why is no real title available?)2003-08-11Paper
scientific article; zbMATH DE number 1956595 (Why is no real title available?)2003-07-30Paper
scientific article; zbMATH DE number 1949647 (Why is no real title available?)2003-07-15Paper
scientific article; zbMATH DE number 1948389 (Why is no real title available?)2003-07-13Paper
Counter machines and verification problems.
Theoretical Computer Science
2003-01-21Paper
scientific article; zbMATH DE number 1759611 (Why is no real title available?)2002-11-28Paper
scientific article; zbMATH DE number 1759429 (Why is no real title available?)2002-06-25Paper
scientific article; zbMATH DE number 1701756 (Why is no real title available?)2002-02-05Paper
scientific article; zbMATH DE number 1701750 (Why is no real title available?)2002-02-05Paper
scientific article; zbMATH DE number 1670769 (Why is no real title available?)2001-11-11Paper
scientific article; zbMATH DE number 1629966 (Why is no real title available?)2001-11-06Paper
Circuit partitioning using mean field annealing
Neurocomputing
1995-09-25Paper
A new mapping heuristic based on mean field annealing
Journal of Parallel and Distributed Computing
1993-05-16Paper


Research outcomes over time


This page was built for person: Tevfik Bultan