| 2007 |
| 62 | EE | Elliot Barlas,
Tevfik Bultan:
Netstub: a framework for verification of distributed java applications.
ASE 2007: 24-33 |
| 61 | EE | Fang Yu,
Tevfik Bultan,
Erik Peterson:
Automated size analysis for OCL.
ESEC/SIGSOFT FSE 2007: 331-340 |
| 60 | EE | Graham Hughes,
Tevfik Bultan:
Interface grammars for modular software model checking.
ISSTA 2007: 39-49 |
| 59 | EE | Tevfik Bultan,
Xiang Fu:
Specification of Realizable Service Conversations Using Collaboration Diagrams.
SOCA 2007: 122-132 |
| 58 | EE | Jianwen Su,
Tevfik Bultan,
Xiang Fu,
Xiangpeng Zhao:
Towards a Theory of Web Service Choreographies.
WS-FM 2007: 1-16 |
| 57 | EE | Tevfik Bultan,
Xiang Fu,
Jianwen Su:
Analyzing Conversations: Realizability, Synchronizability, and Verification.
Test and Analysis of Web Services 2007: 57-85 |
| 56 | EE | Aysu Betin-Can,
Tevfik Bultan,
Mikael Lindvall,
Benjamin Lux,
Stefan Topp:
Eliminating synchronization faults in air traffic control software via design for verification with concurrency controllers.
Autom. Softw. Eng. 14(2): 129-178 (2007) |
| 55 | EE | Mikael Lindvall,
Ioana Rus,
Paolo Donzelli,
Atif M. Memon,
Marvin V. Zelkowitz,
Aysu Betin-Can,
Tevfik Bultan,
Christopher Ackermann,
Bettina Anders,
Sima Asgari,
Victor R. Basili,
Lorin Hochstein,
Jörg Fellmann,
Forrest Shull,
Roseanne Tesoriero Tvedt,
Daniel Pech,
Daniel Hirschbach:
Experimenting with software testbeds for evaluating new technologies.
Empirical Software Engineering 12(4): 417-444 (2007) |
| 54 | EE | Aysu Betin-Can,
Tevfik Bultan:
Highly dependable concurrent programming using design for verification.
Formal Asp. Comput. 19(2): 243-268 (2007) |
| 2006 |
| 53 | EE | Tevfik Bultan,
Constance L. Heitmeyer:
Analyzing tabular requirements specifications using infinite state model checking.
MEMOCODE 2006: 7-16 |
| 52 | EE | Tevfik Bultan,
Jianwen Su,
Xiang Fu:
Analyzing Conversations of Web Services.
IEEE Internet Computing 10(1): 18-25 (2006) |
| 51 | EE | Constantinos Bartzis,
Tevfik Bultan:
Efficient BDDs for bounded arithmetic constraints.
STTT 8(1): 26-36 (2006) |
| 2005 |
| 50 | EE | Aysu Betin-Can,
Tevfik Bultan,
Mikael Lindvall,
Benjamin Lux,
Stefan Topp:
Application of design for verification with concurrency controllers to air traffic control software.
ASE 2005: 14-23 |
| 49 | EE | Tuba Yavuz-Kahveci,
Constantinos Bartzis,
Tevfik Bultan:
Action Language Verifier, Extended.
CAV 2005: 413-417 |
| 48 | EE | Aysu Betin-Can,
Tevfik Bultan:
Verifiable Web Services with Hierarchical Interfaces.
ICWS 2005: 85-94 |
| 47 | EE | Tevfik Bultan,
Constance L. Heitmeyer,
John O'Leary:
Panel on design for verification.
MEMOCODE 2005: 232-235 |
| 46 | EE | Tuba Yavuz-Kahveci,
Tevfik Bultan:
Verification of parameterized hierarchical state machines using action language verifier.
MEMOCODE 2005: 79-88 |
| 45 | EE | Aysu Betin-Can,
Tevfik Bultan,
Xiang Fu:
Design for verification for asynchronously communicating Web services.
WWW 2005: 750-759 |
| 44 | EE | Shriram Krishnamurthi,
Tevfik Bultan:
Discussion summary: characteristics of web services and their impact on testing, analysis and verification.
ACM SIGSOFT Software Engineering Notes 30(1): 5 (2005) |
| 43 | EE | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Synchronizability of Conversations among Web Services.
IEEE Trans. Software Eng. 31(12): 1042-1055 (2005) |
| 2004 |
| 42 | EE | Aysu Betin-Can,
Tevfik Bultan:
Verifiable Concurrent Programming Using Concurrency Controllers.
ASE 2004: 248-257 |
| 41 | EE | Tevfik Bultan,
Xiang Fu,
Jianwen Su:
Tools for Automated Verification of Web Services.
ATVA 2004: 8-10 |
| 40 | EE | Constantinos Bartzis,
Tevfik Bultan:
Widening Arithmetic Automata.
CAV 2004: 321-333 |
| 39 | EE | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
WSAT: A Tool for Formal Analysis of Web Services.
CAV 2004: 510-514 |
| 38 | EE | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Realizability of Conversation Protocols With Message Contents.
ICWS 2004: 96- |
| 37 | EE | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Model checking XML manipulating software.
ISSTA 2004: 252-262 |
| 36 | EE | Sandeep K. Shukla,
Tevfik Bultan,
Constance L. Heitmeyer:
Panel: given that hardware verification has been an uphill battle, what is the future of software verification?
MEMOCODE 2004: 157-158 |
| 35 | EE | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Analysis of interacting BPEL web services.
WWW 2004: 621-630 |
| 34 | EE | Zhe Dang,
Tevfik Bultan,
Oscar H. Ibarra,
Richard A. Kemmerer:
Past pushdown timed automata and safety verification.
Theor. Comput. Sci. 313(1): 57-71 (2004) |
| 33 | EE | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Conversation protocols: a formalism for specification and verification of reactive electronic services.
Theor. Comput. Sci. 328(1-2): 19-37 (2004) |
| 2003 |
| 32 | EE | Constantinos Bartzis,
Tevfik Bultan:
Efficient Image Computation in Infinite State Model Checking.
CAV 2003: 249-261 |
| 31 | EE | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services.
CIAA 2003: 188-200 |
| 30 | EE | Constantinos Bartzis,
Tevfik Bultan:
Construction of Efficient BDDs for Bounded Arithmetic Constraints.
TACAS 2003: 394-408 |
| 29 | EE | Tevfik Bultan,
Xiang Fu,
Richard Hull,
Jianwen Su:
Conversation specification: a new approach to design and analysis of e-service composition.
WWW 2003: 403-410 |
| 28 | EE | Aysu Betin-Can,
Tevfik Bultan:
Interface-Based Specification and Verification of Concurrency Controllers.
Electr. Notes Theor. Comput. Sci. 89(3): (2003) |
| 27 | EE | Constantinos Bartzis,
Tevfik Bultan:
Efficient Symbolic Representations for Arithmetic Constraints in Verification.
Int. J. Found. Comput. Sci. 14(4): 605-624 (2003) |
| 26 | EE | Tuba Yavuz-Kahveci,
Tevfik Bultan:
A symbolic manipulator for automated verification of reactive systems with heterogeneous data types.
STTT 5(1): 15-33 (2003) |
| 2002 |
| 25 | EE | Constantinos Bartzis,
Tevfik Bultan:
Automata-Based Representations for Arithmetic Constraints in Automated Verification.
CIAA 2002: 282-288 |
| 24 | EE | Tuba Yavuz-Kahveci,
Tevfik Bultan:
Heuristics for Efficient Manipulation of Composite Constraints.
FroCos 2002: 57-71 |
| 23 | EE | Tuba Yavuz-Kahveci,
Tevfik Bultan:
Specification, verification, and synthesis of concurrency control components.
ISSTA 2002: 169-179 |
| 22 | EE | Tuba Yavuz-Kahveci,
Tevfik Bultan:
Automated Verification of Concurrent Linked Lists with Counters.
SAS 2002: 69-84 |
| 21 | EE | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Formal Verification of e-Services and Workflows.
WES 2002: 188-202 |
| 20 | | Oscar H. Ibarra,
Jianwen Su,
Zhe Dang,
Tevfik Bultan,
Richard A. Kemmerer:
Counter Machines and Verification Problems.
Theor. Comput. Sci. 289(1): 165-189 (2002) |
| 2001 |
| 19 | EE | Tevfik Bultan,
Tuba Yavuz-Kahveci:
Action Language Verifier.
ASE 2001: 382-386 |
| 18 | EE | Zhe Dang,
Tevfik Bultan,
Oscar H. Ibarra,
Richard A. Kemmerer:
Past Pushdown Timed Automata.
CIAA 2001: 74-86 |
| 17 | EE | Giorgio Delzanno,
Tevfik Bultan:
Constraint-Based Verification of Client-Server Protocols.
CP 2001: 286-301 |
| 16 | EE | Xiang Fu,
Tevfik Bultan,
Richard Hull,
Jianwen Su:
Verification of Vortex Workflows.
TACAS 2001: 143-157 |
| 15 | EE | Tuba Yavuz-Kahveci,
Murat Tuncer,
Tevfik Bultan:
A Library for Composite Symbolic Representations.
TACAS 2001: 52-66 |
| 14 | | Oscar H. Ibarra,
Tevfik Bultan,
Jianwen Su:
On Reachability and Safety in Infinite-State Systems.
Int. J. Found. Comput. Sci. 12(6): 821-836 (2001) |
| 2000 |
| 13 | | Zhe Dang,
Oscar H. Ibarra,
Tevfik Bultan,
Richard A. Kemmerer,
Jianwen Su:
Binary Reachability Analysis of Discrete Pushdown Timed Automata.
CAV 2000: 69-84 |
| 12 | EE | Oscar H. Ibarra,
Tevfik Bultan,
Jianwen Su:
Reachability Analysis for Some Models of Infinite-State Transition Systems.
CONCUR 2000: 183-198 |
| 11 | EE | Tevfik Bultan:
Action Language: a specification language for model checking reactive systems.
ICSE 2000: 335-344 |
| 10 | EE | Oscar H. Ibarra,
Jianwen Su,
Zhe Dang,
Tevfik Bultan,
Richard A. Kemmerer:
Conter Machines: Decidable Properties and Applications to Verification Problems.
MFCS 2000: 426-435 |
| 9 | EE | Tevfik Bultan:
BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems.
TACAS 2000: 441-455 |
| 8 | EE | Tevfik Bultan,
Richard Gerber,
Christopher League:
Composite model-checking: verification with type-specific symbolic representations.
ACM Trans. Softw. Eng. Methodol. 9(1): 3-50 (2000) |
| 1999 |
| 7 | EE | Tevfik Bultan,
Richard Gerber,
William Pugh:
Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results.
ACM Trans. Program. Lang. Syst. 21(4): 747-789 (1999) |
| 1998 |
| 6 | EE | Tevfik Bultan,
Richard Gerber,
Christopher League:
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach.
ISSTA 1998: 113-123 |
| 5 | EE | Cevdet Aykanat,
Tevfik Bultan,
Ismail Haritaoglu:
A fast neural-network algorithm for VLSI cell placement.
Neural Networks 11(9): 1671-1684 (1998) |
| 1997 |
| 4 | | Tevfik Bultan,
Richard Gerber,
William Pugh:
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic.
CAV 1997: 400-411 |
| 1996 |
| 3 | EE | Tevfik Bultan,
Jeffrey Fischer,
Richard Gerber:
Compositional Verification by Model Checking for Counter-Examples.
ISSTA 1996: 224-238 |
| 1995 |
| 2 | EE | Tevfik Bultan,
Cevdet Aykanat:
Circuit partitioning using mean field annealing.
Neurocomputing 8(2): 171-194 (1995) |
| 1992 |
| 1 | | Tevfik Bultan,
Cevdet Aykanat:
A New Mapping Heuristic Based on Mean Field Annealing.
J. Parallel Distrib. Comput. 16(4): 292-305 (1992) |