메뉴 건너뛰기




Volumn 85, Issue 2, 2004, Pages 176-191

A tool for specification and verification of epistemic properties in interpreted systems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; CRYPTOGRAPHY; FORMAL LOGIC; MULTI AGENT SYSTEMS; NETWORK PROTOCOLS; PROGRAM COMPILERS; SEMANTICS; THEOREM PROVING;

EID: 18744403444     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82609-X     Document Type: Conference Paper
Times cited : (9)

References (22)
  • 3
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • Bryant R.E. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers. August 1986;677-691
    • (1986) IEEE Transaction on Computers , pp. 677-691
    • Bryant, R.E.1
  • 6
    • 0023861309 scopus 로고
    • The dining cryptographers problem: Unconditional sender and recipient untraceability
    • Chaum D. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology. 1:1988;65-75
    • (1988) Journal of Cryptology , vol.1 , pp. 65-75
    • Chaum, D.1
  • 14
    • 1142268722 scopus 로고    scopus 로고
    • Bounded model checking for interpreted systems
    • Institute of Computer Science of the Polish Academy of Sciences
    • A. Lomuscio and W. Penczek, Bounded model checking for interpreted systems. Technical report, Institute of Computer Science of the Polish Academy of Sciences, 2002.
    • (2002) Technical Report
    • Lomuscio, A.1    Penczek, W.2
  • 19
    • 0010478799 scopus 로고    scopus 로고
    • A knowledge-based algorithm for the internet transmission control protocol (TCP)
    • January Blackwell Publishers Ltd, Oxford, UK and Boston, USA
    • Freek Stulp and Rineke Verbrugge. A knowledge-based algorithm for the internet transmission control protocol (TCP) (extended version). Bulletin of Economic Research, 54(1):69-94, January 2002. Blackwell Publishers Ltd, Oxford, UK and Boston, USA.
    • (2002) Bulletin of Economic Research , vol.54 , Issue.1 , pp. 69-94
    • Stulp, F.1    Verbrugge, R.2
  • 20
    • 18744392059 scopus 로고
    • An automata-theoretic approach to protocol verification
    • Berlin - Heidelberg - New York, October Springer
    • M. Y. Vardi. An automata-theoretic approach to protocol verification (abstract). In International Conference on Concurrency (CONCURRENCY '88), pages 73-73, Berlin - Heidelberg - New York, October 1988. Springer.
    • (1988) International Conference on Concurrency (CONCURRENCY '88) , pp. 73-73
    • Vardi, M.Y.1


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