Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Boundedness, empty channel detection, and synchronization for communicating finite automata
Theoretical Computer Science
On deadlock detection in systems of communicating finite state machines
Computers and Artificial Intelligence
Computer networks
Testing for unboundedness of FIFO channels
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Data flow analysis of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Unreliable channels are easier to verify than perfect channels
Information and Computation
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On Communicating Finite-State Machines
Journal of the ACM (JACM)
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Elements of the Theory of Computation
Elements of the Theory of Computation
Protocol Description and Analysis Based on a State Transition Model with Channel Expressions
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Undecidable Verification Problems for Programs with Unreliable Channels
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
The Power of QDDs (Extended Abstract)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Automatic Temporal Verification of Buffer Systems
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Symbolic Verification with Periodic Sets
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Symbolic Protocol Verification with Queue BDDs
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Automatic abstraction for model checking software systems with interrelated numeric constraints
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Dihomotopy as a Tool in State Space Analysis
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Automated Analysis of Fault-Tolerance in Distributed Systems
Formal Methods in System Design
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Regularity Results for FIFO Channels
Electronic Notes in Theoretical Computer Science (ENTCS)
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs
Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability Problems in Piecewise FIFO Systems
ACM Transactions on Computational Logic (TOCL)
Piecewise FIFO channels are analyzable
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A kleene theorem for a class of communicating automata with effective algorithms
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Verification of communication protocols using abstract interpretation of FIFO queues
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Bounded phase analysis of message-passing programs
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Applying abstract acceleration to (co-)reachability analysis of reactive programs
Journal of Symbolic Computation
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Inferring networked system models from behavior traces
Proceedings of the 2012 ACM conference on CoNEXT student workshop
Unidirectional channel systems can be tested
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
The power of priority channel systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
| Hi-index | 0.00 |
We study the verification of properties of communication protocolsmodeled by a finite set of finite-state machines that communicate by exchangingmessages via unbounded FIFO queues. It is well-known that most interesting verification problems, such as deadlock detection, are undecidable for this classof systems. However, in practice, these verification problems may very wellturn out to be decidable for a subclass containing most“real” protocols.Motivated by this optimistic (and, we claim, realistic)observation, we present an algorithm that may construct a finite and exact representation of the state space of a communication protocol, even ifthis state space is infinite. Our algorithm performs a loop-first search in the state space of the protocol being analyzed. A loop-first search isa search technique that attempts to explore first the results of successiveexecutions of loops in the protocol description (code). A new data structurenamed Queue-content Decision Diagram (QDD) is introduced for representing (possibly infinite) sets of queue-contents. Operations for manipulating QDDs during a loop-first search are presented.A loop-first search using QDDs has beenimplemented, and experiments on several communication protocols with infinitestate spaces have been performed. For these examples, our tool completed itssearch, and produced a finite symbolic representation for these infinitestate spaces.