메뉴 건너뛰기




Volumn 1384, Issue , 1998, Pages 345-357

Static partial order reduction

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 58849164515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054182     Document Type: Conference Paper
Times cited : (64)

References (14)
  • 2
    • 84876395437 scopus 로고    scopus 로고
    • A verification engine for SDL specification of communication protocols
    • In S. Bilgen, U. Çağlayan, and C. Ersoy, editors,, Istanbul, Turkey, May
    • E. Bounimova, V. Levin, O. Başbuğoğ1u, and K. Inan. A verification engine for SDL specification of communication protocols. In S. Bilgen, U. Çağlayan, and C. Ersoy, editors, Proceedings of the First Symposium on Computer Networks, pages 16-25, Istanbul, Turkey, May 1996.
    • (1996) Proceedings of the First Symposium on Computer Networks , pp. 16-25
    • Bounimova, E.1    Levin, V.2    Başbuğoğ1u, O.3    Inan, K.4
  • 5
    • 0000138318 scopus 로고
    • An O(Nlogn) unidirectional distributed algorithm for extrema finding in a circle
    • D. Dolev, M. Klave, and M. Rodeh. An O(nlogn) unidirectional distributed algorithm for extrema finding in a circle. Journal of Algorithms, 3:245-260, 1982.
    • (1982) Journal of Algorithms , vol.3 , pp. 245-260
    • Dolev, D.1    Klave, M.2    Rodeh, M.3
  • 6
    • 85027595530 scopus 로고
    • Refining dependencies improves partial-order verification methods
    • of Lecture Notes in Computer Science, Elounda, June, Springer-Verlag
    • P. Godefroid and D. Pirottin. Refining dependencies improves partial-order verification methods. In Proc. 5th Conference on Computer Aided Verification, volume 697 of Lecture Notes in Computer Science, pages 438-449, Elounda, June 1993. Springer-Verlag.
    • (1993) Proc. 5Th Conference on Computer Aided Verification , vol.697 , pp. 438-449
    • Godefroid, P.1    Pirottin, D.2
  • 9
    • 0000863166 scopus 로고
    • An improvement in formal verification
    • Bern, Switzerland, Chapman& Hall
    • G.J. Holzmann and D. Peled. An improvement in formal verification. In Formal Description Techniques 1994, pages 197-211, Bern, Switzerland, 1994. Chapman& Hall.
    • (1994) Formal Description Techniques 1994 , pp. 197-211
    • Holzmann, G.J.1    Peled, D.2
  • 11
    • 0020910824 scopus 로고
    • What good is temporal logic
    • North Holland, in Computer Science 115
    • L. Lamport. What good is temporal logic. In IFIP Congress, pages 657-668. North Holland, 1983. in Computer Science 115
    • (1983) IFIP Congress , pp. 657-668
    • Lamport, L.1
  • 12
    • 0029737169 scopus 로고    scopus 로고
    • Combining partial order reductions with on-the-fly model checking
    • D. Peled. Combining partial order reductions with on-the-fly model checking. Formal Methods in System Design, 8:39-64, 1996.
    • (1996) Formal Methods in System Design , vol.8 , pp. 39-64
    • Peled, D.1
  • 14
    • 85016851732 scopus 로고
    • A stubborn attack on state explosion
    • of Lecture Notes in Computer Science, Rutgers, June, Springer-Verlag
    • A. Valmari. A stubborn attack on state explosion. In Proc. Pnd Workshop on Computer Aided Verification, volume 531 of Lecture Notes in Computer Science, pages 156-165, Rutgers, June 1990. Springer-Verlag.
    • (1990) Proc. Pnd Workshop on Computer Aided Verification , vol.531 , pp. 156-165
    • Valmari, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.