Data flow analysis of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Duplication, insertion and lossiness errors in unreliable communication channels
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Generalized fair reachability analysis for cyclic protocols
IEEE/ACM Transactions on Networking (TON)
Verification of communication protocols using data flow analysis
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Deadlock detection in communicating finite state machines by even reachability analysis
Mobile Networks and Applications - Special issue: protocols for mobile environments
Symbolic Verification of Communication Protocols with Infinite StateSpaces using QDDs
Formal Methods in System Design
Effective Recognizability and Model Checking of Reactive Fiffo Automata
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Well-Abstracted Transition Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Channel Representations in Protocol Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Eliminating Queues from RT UML Model Representations
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Well-abstracted transition systems: application to FIFO automata
Information and Computation
On Reachability Analysis of Communicating Finite State Machines
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Deadlock Detection in Communicating Finite State Machines by Even Reachability Analysis
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Using Forward Reachability Analysis for Verification of Lossy Channel Systems
Formal Methods in System Design
Decidability of the termination problem for completely specified protocols
Distributed Computing
Verification of programs with half-duplex communication
Information and Computation
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
Mixing Lossy and Perfect Fifo Channels
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Regular Model Checking Using Inference of Regular Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Regularity Results for FIFO Channels
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of programs with half-duplex communication
Information and Computation
The ω-regular post embedding problem
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Reachability Problems in Piecewise FIFO Systems
ACM Transactions on Computational Logic (TOCL)
Flat acceleration in symbolic model checking
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Piecewise FIFO channels are analyzable
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A modular methodology to verify communication protocols
Computer Communications
Research: Protocol validation by simultaneous reachability analysis
Computer Communications
Hi-index | 0.00 |