| Publication | Date of Publication | Type |
|---|
| Automata-based model counting for string constraints | 2018-03-01 | Paper |
On deciding synchronizability for asynchronously communicating systems Theoretical Computer Science | 2016-11-24 | Paper |
Deciding choreography realizability Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-09-11 | Paper |
On reachability and safety in infinite-state systems International Journal of Foundations of Computer Science | 2015-04-30 | Paper |
Automata-based symbolic string analysis for vulnerability detection Formal Methods in System Design | 2014-06-30 | Paper |
| Interface-based specification and verification of concurrency controllers | 2013-08-30 | Paper |
Synchronizability for Verification of Asynchronously Communicating Systems Lecture Notes in Computer Science | 2012-06-15 | Paper |
Relational string verification using multi-track automata International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
Relational string verification using multi-track automata Implementation and Application of Automata | 2011-02-11 | Paper |
Conversation protocols: a formalism for specification and verification of reactive electronic services Implementation and Application of Automata | 2010-05-07 | Paper |
Efficient image computation in infinite state model checking. Lecture Notes in Computer Science | 2010-04-20 | Paper |
Action language verifier: An infinite-state model checker for reactive software specifications Formal Methods in System Design | 2010-02-05 | Paper |
Symbolic String Verification: Combining String Analysis and Size Analysis Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
Highly dependable concurrent programming using design for verification Formal Aspects of Computing | 2007-08-23 | Paper |
Automated Technology for Verification and Analysis Lecture Notes in Computer Science | 2006-10-25 | Paper |
Action Language Verifier, extended Lecture Notes in Computer Science | 2006-01-10 | Paper |
Efficient Symbolic Representations for Arithmetic Constraints in Verification International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Widening arithmetic automata Lecture Notes in Computer Science | 2005-08-25 | Paper |
WSAT: A tool for formal analysis of web services Lecture Notes in Computer Science | 2005-08-25 | Paper |
Conversation protocols: a formalism for specification and verification of reactive electronic services Theoretical Computer Science | 2005-01-11 | Paper |
Heuristics for efficient manipulation of composite constraints Lecture Notes in Computer Science | 2004-08-11 | Paper |
Constraint-based verification of client-server protocols Lecture Notes in Computer Science | 2004-08-09 | Paper |
Past pushdown timed automata and safety verification. Theoretical Computer Science | 2004-03-14 | Paper |
Formal verification of e-services and workflows Lecture Notes in Computer Science | 2003-09-15 | Paper |
Automata-based representations for arithmetic constraints in automated verification Lecture Notes in Computer Science | 2003-08-11 | Paper |
Construction of efficient BDDs for bounded arithmetic constraints Lecture Notes in Computer Science | 2003-07-30 | Paper |
Past pushdown timed automata Lecture Notes in Computer Science | 2003-07-15 | Paper |
Automated verification of concurrent linked lists with counters Lecture Notes in Computer Science | 2003-07-13 | Paper |
Counter machines and verification problems. Theoretical Computer Science | 2003-01-21 | Paper |
Reachability analysis for some models of infinite-state transition systems Lecture Notes in Computer Science | 2002-11-28 | Paper |
Counter machines: Decidable properties and applications to verification problems Lecture Notes in Computer Science | 2002-06-25 | Paper |
A library for composite symbolic representations Lecture Notes in Computer Science | 2002-02-05 | Paper |
Verification of Vortex workflows Lecture Notes in Computer Science | 2002-02-05 | Paper |
Binary reachability analysis of discrete pushdown timed automata Lecture Notes in Computer Science | 2001-11-11 | Paper |
BDD vs. constraint-based model checking: An experiment evaluation for asynchronous concurrent systems Lecture Notes in Computer Science | 2001-11-06 | Paper |
Circuit partitioning using mean field annealing Neurocomputing | 1995-09-25 | Paper |
A new mapping heuristic based on mean field annealing Journal of Parallel and Distributed Computing | 1993-05-16 | Paper |