 | 2009 |
|---|
| 80 |       | Tevfik Bultan,
Chris Ferguson,
Xiang Fu:
A Tool for Choreography Analysis Using Collaboration Diagrams.
ICWS 2009: 856-863 |
| 79 | | Gwen Salaün,
Tevfik Bultan:
Realizability of Choreographies Using Process Algebra Encodings.
IFM 2009: 167-182 |
| 78 | | Zachary Stengel,
Tevfik Bultan:
Analyzing singularity channel contracts.
ISSTA 2009: 13-24 |
| 77 | | Fang Yu,
Tevfik Bultan,
Oscar H. Ibarra:
Symbolic String Verification: Combining String Analysis and Size Analysis.
TACAS 2009: 322-336 |
| 2008 |
|---|
| 76 |  | Tevfik Bultan,
Tao Xie:
Proceedings of the 2008 Workshop on Testing, Analysis, and Verification of Web Services and Applications, held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2008), TAV-WEB 2008, Seattle, Washington, USA, July 21, 2008
ACM 2008 |
| 75 | | Tevfik Bultan:
Service Choreography and Orchestration with Conversations.
CONCUR 2008: 2-3 |
| 74 | | Tevfik Bultan,
Tao Xie:
Workshop on testing, analysis and verification of web software (TAV-WEB 2008).
ISSTA 2008: 311-312 |
| 73 | | Fang Yu,
Chao Wang,
Aarti Gupta,
Tevfik Bultan:
Modular verification of web services using efficient symbolic encoding and summarization.
SIGSOFT FSE 2008: 192-202 |
| 72 | | Fang Yu,
Tevfik Bultan,
Marco Cova,
Oscar H. Ibarra:
Symbolic String Verification: An Automata-Based Approach.
SPIN 2008: 306-324 |
| 71 | | Graham Hughes,
Tevfik Bultan,
Muath Alkhalaf:
Client and server verification for web services using interface grammars.
TAV-WEB 2008: 40-46 |
| 70 | | Tevfik Bultan,
Xiang Fu:
Choreography Modeling and Analysis with Collaboration Diagrams.
IEEE Data Eng. Bull. 31(3): 27-30 (2008) |
| 69 | | Graham Hughes,
Tevfik Bultan:
Interface Grammars for Modular Software Model Checking.
IEEE Trans. Software Eng. 34(5): 614-632 (2008) |
| 68 | | Graham Hughes,
Tevfik Bultan:
Automated verification of access control policies using a SAT solver.
STTT 10(6): 503-520 (2008) |
| 67 | | Tevfik Bultan,
Xiang Fu:
Specification of realizable service conversations using collaboration diagrams.
Service Oriented Computing and Applications 2(1): 27-39 (2008) |
| 2007 |
|---|
| 66 | | Elliot Barlas,
Tevfik Bultan:
Netstub: a framework for verification of distributed java applications.
ASE 2007: 24-33 |
| 65 | | Fang Yu,
Tevfik Bultan,
Erik Peterson:
Automated size analysis for OCL.
ESEC/SIGSOFT FSE 2007: 331-340 |
| 64 | | Graham Hughes,
Tevfik Bultan:
Interface grammars for modular software model checking.
ISSTA 2007: 39-49 |
| 63 | | Tevfik Bultan,
Xiang Fu:
Specification of Realizable Service Conversations Using Collaboration Diagrams.
SOCA 2007: 122-132 |
| 62 | | Jianwen Su,
Tevfik Bultan,
Xiang Fu,
Xiangpeng Zhao:
Towards a Theory of Web Service Choreographies.
WS-FM 2007: 1-16 |
| 61 | | Tevfik Bultan,
Xiang Fu,
Jianwen Su:
Analyzing Conversations: Realizability, Synchronizability, and Verification.
Test and Analysis of Web Services 2007: 57-85 |
| 60 | | 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) |
| 59 | | 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) |
| 58 | | Aysu Betin-Can,
Tevfik Bultan:
Highly dependable concurrent programming using design for verification.
Formal Asp. Comput. 19(2): 243-268 (2007) |
| 2006 |
|---|
| 57 | | Tevfik Bultan:
Proceedings of the 2006 Workshop on Testing, Analysis, and Verification of Web Services and Applications, held in conjunction with the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA 2006), TAV-WEB 2006, Portland, Maine, USA, July 17, 2006
ACM 2006 |
| 56 | | Tevfik Bultan,
Constance L. Heitmeyer:
Analyzing tabular requirements specifications using infinite state model checking.
MEMOCODE 2006: 7-16 |
| 55 | | Tevfik Bultan,
Jianwen Su,
Xiang Fu:
Analyzing Conversations of Web Services.
IEEE Internet Computing 10(1): 18-25 (2006) |
| 54 | | Constantinos Bartzis,
Tevfik Bultan:
Efficient BDDs for bounded arithmetic constraints.
STTT 8(1): 26-36 (2006) |
| 2005 |
|---|
| 53 | | 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 |
| 52 | | Tuba Yavuz-Kahveci,
Constantinos Bartzis,
Tevfik Bultan:
Action Language Verifier, Extended.
CAV 2005: 413-417 |
| 51 | | Aysu Betin-Can,
Tevfik Bultan:
Verifiable Web Services with Hierarchical Interfaces.
ICWS 2005: 85-94 |
| 50 | | Tevfik Bultan,
Constance L. Heitmeyer,
John O'Leary:
Panel on design for verification.
MEMOCODE 2005: 232-235 |
| 49 | | Tuba Yavuz-Kahveci,
Tevfik Bultan:
Verification of parameterized hierarchical state machines using action language verifier.
MEMOCODE 2005: 79-88 |
| 48 | | Tevfik Bultan,
Aysu Betin-Can:
Scalable Software Model Checking Using Design for Verification.
VSTTE 2005: 337-346 |
| 47 | | Aysu Betin-Can,
Tevfik Bultan,
Xiang Fu:
Design for verification for asynchronously communicating Web services.
WWW 2005: 750-759 |
| 46 | | 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) |
| 45 | | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Synchronizability of Conversations among Web Services.
IEEE Trans. Software Eng. 31(12): 1042-1055 (2005) |
| 44 | | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Realizability of Conversation Protocols with Message Contents.
Int. J. Web Service Res. 2(4): 68-93 (2005) |
| 2004 |
|---|
| 43 | | Aysu Betin-Can,
Tevfik Bultan:
Verifiable Concurrent Programming Using Concurrency Controllers.
ASE 2004: 248-257 |
| 42 | | Tevfik Bultan,
Xiang Fu,
Jianwen Su:
Tools for Automated Verification of Web Services.
ATVA 2004: 8-10 |
| 41 | | Constantinos Bartzis,
Tevfik Bultan:
Widening Arithmetic Automata.
CAV 2004: 321-333 |
| 40 | | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
WSAT: A Tool for Formal Analysis of Web Services.
CAV 2004: 510-514 |
| 39 | | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Realizability of Conversation Protocols With Message Contents.
ICWS 2004: 96- |
| 38 | | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Model checking XML manipulating software.
ISSTA 2004: 252-262 |
| 37 | | 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 |
| 36 | | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Analysis of interacting BPEL web services.
WWW 2004: 621-630 |
| 35 | | 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) |
| 34 | | 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 |
|---|
| 33 | | Constantinos Bartzis,
Tevfik Bultan:
Efficient Image Computation in Infinite State Model Checking.
CAV 2003: 249-261 |
| 32 | | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services.
CIAA 2003: 188-200 |
| 31 | | Constantinos Bartzis,
Tevfik Bultan:
Construction of Efficient BDDs for Bounded Arithmetic Constraints.
TACAS 2003: 394-408 |
| 30 | | 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 |
| 29 | | Aysu Betin-Can,
Tevfik Bultan:
Interface-Based Specification and Verification of Concurrency Controllers.
Electr. Notes Theor. Comput. Sci. 89(3): (2003) |
| 28 | | Constantinos Bartzis,
Tevfik Bultan:
Efficient Symbolic Representations for Arithmetic Constraints in Verification.
Int. J. Found. Comput. Sci. 14(4): 605-624 (2003) |
| 27 | | 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 |
|---|
| 26 | | Constantinos Bartzis,
Tevfik Bultan:
Automata-Based Representations for Arithmetic Constraints in Automated Verification.
CIAA 2002: 282-288 |
| 25 | | Tuba Yavuz-Kahveci,
Tevfik Bultan:
Heuristics for Efficient Manipulation of Composite Constraints.
FroCos 2002: 57-71 |
| 24 | | Tuba Yavuz-Kahveci,
Tevfik Bultan:
Specification, verification, and synthesis of concurrency control components.
ISSTA 2002: 169-179 |
| 23 | | Tuba Yavuz-Kahveci,
Tevfik Bultan:
Automated Verification of Concurrent Linked Lists with Counters.
SAS 2002: 69-84 |
| 22 | | Xiang Fu,
Tevfik Bultan,
Jianwen Su:
Formal Verification of e-Services and Workflows.
WES 2002: 188-202 |
| 21 | | 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 |
|---|
| 20 | | Tevfik Bultan,
Tuba Yavuz-Kahveci:
Action Language Verifier.
ASE 2001: 382-386 |
| 19 | | Zhe Dang,
Tevfik Bultan,
Oscar H. Ibarra,
Richard A. Kemmerer:
Past Pushdown Timed Automata.
CIAA 2001: 74-86 |
| 18 | | Giorgio Delzanno,
Tevfik Bultan:
Constraint-Based Verification of Client-Server Protocols.
CP 2001: 286-301 |
| 17 | | Xiang Fu,
Tevfik Bultan,
Richard Hull,
Jianwen Su:
Verification of Vortex Workflows.
TACAS 2001: 143-157 |
| 16 | | Tuba Yavuz-Kahveci,
Murat Tuncer,
Tevfik Bultan:
A Library for Composite Symbolic Representations.
TACAS 2001: 52-66 |
| 15 | | 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 |
|---|
| 14 | | Zhe Dang,
Oscar H. Ibarra,
Tevfik Bultan,
Richard A. Kemmerer,
Jianwen Su:
Binary Reachability Analysis of Discrete Pushdown Timed Automata.
CAV 2000: 69-84 |
| 13 | | Oscar H. Ibarra,
Tevfik Bultan,
Jianwen Su:
Reachability Analysis for Some Models of Infinite-State Transition Systems.
CONCUR 2000: 183-198 |
| 12 | | Tevfik Bultan:
Action Language: a specification language for model checking reactive systems.
ICSE 2000: 335-344 |
| 11 | | 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 |
| 10 | | Tevfik Bultan:
BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems.
TACAS 2000: 441-455 |
| 9 | | 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 |
|---|
| 8 | | 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 |
|---|
| 7 | | Tevfik Bultan,
Richard Gerber,
Christopher League:
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach.
ISSTA 1998: 113-123 |
| 6 | | Cevdet Aykanat,
Tevfik Bultan,
Ismail Haritaoglu:
A fast neural-network algorithm for VLSI cell placement.
Neural Networks 11(9): 1671-1684 (1998) |
| 1997 |
|---|
| 5 | | Tevfik Bultan,
Richard Gerber,
William Pugh:
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic.
CAV 1997: 400-411 |
| 1996 |
|---|
| 4 | | Tevfik Bultan,
Jeffrey Fischer,
Richard Gerber:
Compositional Verification by Model Checking for Counter-Examples.
ISSTA 1996: 224-238 |
| 1995 |
|---|
| 3 | | Tevfik Bultan,
Cevdet Aykanat:
Circuit partitioning using mean field annealing.
Neurocomputing 8(2): 171-194 (1995) |
| 1992 |
|---|
| 2 | | Tevfik Bultan,
Cevdet Aykanat:
A New Mapping Heuristic Based on Mean Field Annealing.
J. Parallel Distrib. Comput. 16(4): 292-305 (1992) |
| 1991 |
|---|
| 1 | | Tevfik Bultan,
Cevdet Aykanat:
Circuit partitioning using parallel mean field annealing algorithms.
SPDP 1991: 534-541 |
