Pre- and Post-Conditions Expressed in Variants of the Modal .MU.-Calculus-Reference-Cited by-同舟云学术

Pre- and Post-Conditions Expressed in Variants of the Modal .MU.-Calculus

Published:2009 Issue:5 Volume:E92-D Page:995-1002
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

TANABE Yoshinori¹²,SEKIZAWA Toshifusa²³,YUASA Yoshifumi⁴²,TAKAHASHI Koichi²

Affiliation:

1. Graduate School of Information Science and Technology, The University of Tokyo

2. Research Center for Verification and Semantics, National Institute of Advanced Industrial Science and Technology

3. Graduate School of Information Science and Technology, Osaka University

4. Graduate School of Information Science and Engineering, Tokyo Institute of Technology

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

http://www.jstage.jst.go.jp/article/transinf/E92.D/5/E92.D_5_995/_pdf

Reference12 articles.

1. [1] K. Takahashi and M. Hagiya, “Abstraction of graph transformation using temporal formulas, ” Supplemental Volume of the 2003 International Conference on Dependable Systems and Networks, pp.W-65-W-66, 2003.

2. Analysis of Synchronous and Asynchronous Cellular Automata Using Abstraction by Temporal Logic

3. [3] P. Blackburn, “Nominal tense logic, ” Notre Dame Journal of Formal Logic, vol.34, pp.56-83, 1993.

4. The Complexity of Enriched μ-Calculi

5. [5] Y. Tanabe, T. Takai, T. Sekizawa, and K. Takahashi, “Preconditions of properties described in CTL for statements manipulating pointers, ” Supplemental Volume of the 2005 International Conference on Dependable Systems and Networks, pp.228-234, 2005.

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

1. Automated Verification of Recursive Programs with Pointers;Automated Reasoning;2012