Channel Representations in Protocol Verification-Reference-Cited by-同舟云学术

Channel Representations in Protocol Verification

Published:2001 Issue: Volume: Page:1-15
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Abdulla Parosh Aziz,Jonsson Bengt

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44685-0_1

Reference38 articles.

1. Lect Notes Comput Sci;P. A. Abdulla,1999

2. Parosh Aziz Abdulla, Luc Boasson, and Ahmed Bouajjani. Effective lossy queue languages, 2001. To appear in Proc. ICALP’ 2001: 28th International Colloquium on Automata, Lnaguages, and Programming.

3. Lect Notes Comput Sci;P. A. Abdulla,1998

4. Parosh Aziz Abdulla, Karlis Cer↭s, Bengt Jonsson, and Tsay Yih-Kuen. General decidability theorems for infinite-state systems. In Proc. LICS’ 96 11 th IEEE Int. Symp. on Logic in Computer Science, pages 313–321, 1996.

5. Parosh Aziz Abdulla and Bengt Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2):91–101, 1996.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems;Logic for Programming, Artificial Intelligence, and Reasoning;2006

2. A Parametric Communication Model for the Verification of BPEL4WS Compositions;Lecture Notes in Computer Science;2005

3. An Overview of MSR( );Electronic Notes in Theoretical Computer Science;2002-11

4. Eliminating Queues from RT UML Model Representations;Lecture Notes in Computer Science;2002

5. Algorithmic Verification of Invalidation-Based Protocols;Computer Aided Verification;2002