| 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 |
Computer Aided Verification
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 |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Computer Aided Verification
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 |
scientific article; zbMATH DE number 2086591 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2084712 (Why is no real title available?)
| 2004-08-09 | Paper |
Past pushdown timed automata and safety verification.
Theoretical Computer Science | 2004-03-14 | Paper |
scientific article; zbMATH DE number 1980999 (Why is no real title available?)
| 2003-09-15 | Paper |
scientific article; zbMATH DE number 1962792 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1956595 (Why is no real title available?)
| 2003-07-30 | Paper |
scientific article; zbMATH DE number 1949647 (Why is no real title available?)
| 2003-07-15 | Paper |
scientific article; zbMATH DE number 1948389 (Why is no real title available?)
| 2003-07-13 | Paper |
Counter machines and verification problems.
Theoretical Computer Science | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1759611 (Why is no real title available?)
| 2002-11-28 | Paper |
scientific article; zbMATH DE number 1759429 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1701756 (Why is no real title available?)
| 2002-02-05 | Paper |
scientific article; zbMATH DE number 1701750 (Why is no real title available?)
| 2002-02-05 | Paper |
scientific article; zbMATH DE number 1670769 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1629966 (Why is no real title available?)
| 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 |
