메뉴 건너뛰기




Volumn 3, Issue 2, 1994, Pages 131-165

A Graphical Interval Logic for Specifying Concurrent Systems

Author keywords

automated proof checking; concurrent systems; formal specifications; graphical interval logic; temporal logic; timing diagrams; visual languages

Indexed keywords

COMPUTER GRAPHICS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; HUMAN ENGINEERING; PROGRAM DEBUGGING; PROGRAM DIAGNOSTICS; SOFTWARE ENGINEERING; SYSTEMS ANALYSIS; THEOREM PROVING;

EID: 0028421478     PISSN: 1049331X     EISSN: 15577392     Source Type: Journal    
DOI: 10.1145/192218.192226     Document Type: Article
Times cited : (61)

References (33)
  • 1
    • 85034833107 scopus 로고
    • Propositional temporal interval logic in PSPACE complete
    • Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • AABY, A. A., AND NARAYANA, K. T. 1988. Propositional temporal interval logic in PSPACE complete. In Proceedings of the 9th International Conference on Automated Deduction. Lecture Notes in Computer Science, vol. 193. Springer-Verlag, Berlin, 218-237.
    • (1988) In Proceedings of the 9th International Conference on Automated Deduction. , vol.193 , pp. 218-237
    • AABY, A.A.1    NARAYANA, K.T.2
  • 6
    • 84943223204 scopus 로고
    • The declarative past and imperative future
    • Lecture Notes in Computer Science, Springer-Verlag
    • GABBAY, D. M. 1987. The declarative past and imperative future. In Proceedings of the Conference on Temporal Logic in Specification. Lecture Notes in Computer Science, vol 398, Springer-Verlag, 409-448.
    • (1987) In Proceedings of the Conference on Temporal Logic in Specification. , vol.398 , pp. 409-448
    • GABBAY, D.M.1
  • 7
    • 0024031533 scopus 로고
    • Integrated environments for formally well-founded design and simulation of concurrent systems
    • (June)
    • GIACALONE, A., AND SMOLKA, S. A. 1988. Integrated environments for formally well-founded design and simulation of concurrent systems. IEEE Trans. Softw. Eng. 14, 6 (June), 787-801.
    • (1988) IEEE Trans. Softw. Eng. , vol.14 , Issue.6 , pp. 787-801
    • GIACALONE, A.1    SMOLKA, S.A.2
  • 10
    • 0001084433 scopus 로고
    • A propositional modal logic of time intervals
    • (Oct.)
    • HALPERN, J. Y., AND SHOHAM, Y. 1991. A propositional modal logic of time intervals. J. ACM 38, 4 (Oct.), 935-962.
    • (1991) J. ACM , vol.38 , Issue.4 , pp. 935-962
    • HALPERN, J.Y.1    SHOHAM, Y.2
  • 12
    • 0023365727 scopus 로고
    • Statecharts: A visual formalism for complex systems
    • (June)
    • HAREL, D. 1987. Statecharts: A visual formalism for complex systems Sci. Comput. Program. 8, 3 (June), 231-274.
    • (1987) Sci. Comput. Program , vol.8 , Issue.3 , pp. 231-274
    • HAREL, D.1
  • 14
    • 0003871030 scopus 로고
    • Tech. Rep., Dept. of Computer Science, Univ. of Rochester, N.Y. (Revised March), 1989
    • KOOMEN, J. A. G. M. 1987. The TIMELOGIC temporal reasoning system. Tech. Rep., Dept. of Computer Science, Univ. of Rochester, N.Y. (Revised March 1989).
    • (1987) The TIMELOGIC temporal reasoning system
    • KOOMEN, J.A.G.M.1
  • 18
    • 0037643821 scopus 로고
    • Tech. Rep. 57, DEC Systems Research Center, Palo Alto, Calif.
    • LAMPORT, L. 1990. A temporal logic of actions. Tech. Rep. 57, DEC Systems Research Center, Palo Alto, Calif.
    • (1990) A temporal logic of actions
    • LAMPORT, L.1
  • 19
    • 0020910824 scopus 로고
    • What good is temporal logic?
    • IFIP, Washington, D.C.
    • LAMPORT, L. 1983. What good is temporal logic? In Proceedings of the IFIP Congress. IFIP, Washington, D.C., 657-668.
    • (1983) In Proceedings of the IFIP Congress , pp. 657-668
    • LAMPORT, L.1
  • 20
    • 84943347452 scopus 로고
    • The next 700 programming languages
    • (Mar.)
    • LANDIN, P. J. 1966. The next 700 programming languages. Commun. ACM. 9, 3 (Mar.) 157-166.
    • (1966) Commun. ACM. , vol.9 , Issue.3 , pp. 157-166
    • LANDIN, P.J.1
  • 21
    • 85032172711 scopus 로고
    • Specification and verification of concurrent programs by automata
    • Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • MANNA, Z., AND PNUELI, A. 1987. Specification and verification of concurrent programs by automata. In Proceedings of the Conference on Temporal Logic in Specification. Lecture Notes in Computer Science, vol. 348, Springer-Verlag, Berlin, 124-187.
    • (1987) In Proceedings of the Conference on Temporal Logic in Specification. , vol.348 , pp. 124-187
    • MANNA, Z.1    PNUELI, A.2
  • 22
    • 0000204728 scopus 로고
    • Verification of concurrent programs: The temporal framework
    • R. S. Boyer and J. S. Moore, Eds. Academic Press, New York
    • MANNA, Z., AND PNUELI, A. 1981. Verification of concurrent programs: The temporal framework. In The Correctness Problem in Computer Science, R. S. Boyer and J. S. Moore, Eds. Academic Press, New York, 215-273.
    • (1981) In The Correctness Problem in Computer Science , pp. 215-273
    • MANNA, Z.1    PNUELI, A.2
  • 23
    • 84919173497 scopus 로고
    • A graphical representation of interval logic
    • Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • MELLIAR-SMITH, P. M. 1988. A graphical representation of interval logic. In Proceedings of the International Conference on Concurrency. Lecture Notes in Computer Science, vol. 335, Springer-Verlag, Berlin, 106-120.
    • (1988) In Proceedings of the International Conference on Concurrency. , vol.335 , pp. 106-120
    • MELLIAR-SMITH, P.M.1
  • 25
    • 77950065004 scopus 로고
    • A low level language for obtaining decision procedures for classes of temporal logics
    • Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • PLAISTED, D. 1983. A low level language for obtaining decision procedures for classes of temporal logics. In Proceedings of the CMU Workshop on Logics of Programs. Lecture Notes in Computer Science, Vol. 164. Springer-Verlag, Berlin, 403-420.
    • (1983) In Proceedings of the CMU Workshop on Logics of Programs. , vol.164 , pp. 403-420
    • PLAISTED, D.1
  • 26
    • 34250124963 scopus 로고
    • Modeling concurrency with partial orders
    • PRATT, V. 1986. Modeling concurrency with partial orders. Int. J. Parall. Program. 15, 1, 33-71.
    • (1986) Int. J. Parall. Program. , vol.15 , Issue.1 , pp. 33-71
    • PRATT, V.1
  • 27
    • 0346873045 scopus 로고
    • Ph.D. thesis, Dept. of Computer and Electrical Engineering, Univ. of California, Santa Barbara, Calif.
    • RAMAKRISHNA, Y. S. 1993. Interval Logics for Temporal Specification and Verification. Ph.D. thesis, Dept. of Computer and Electrical Engineering, Univ. of California, Santa Barbara, Calif.
    • (1993) Interval Logics for Temporal Specification and Verification
    • RAMAKRISHNA, Y.S.1
  • 33
    • 33749205715 scopus 로고
    • On the relation of programs and computations to models of temporal logic
    • Lecture Notes in Computer Science, Springer-Verlag, Berlin
    • WOLPER, P. 1987. On the relation of programs and computations to models of temporal logic. In Proceedings of the Conference on Temporal Logic in Specification. Lecture Notes in Computer Science, vol. 398. Springer-Verlag, Berlin, 75-123.
    • (1987) In Proceedings of the Conference on Temporal Logic in Specification. , vol.398 , pp. 75-123
    • WOLPER, P.1


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