On the characterization of until as a fixed point under clocked semantics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4899 LNCS, Issue , 2008, Pages 19-33

  Fisman, Dana ^a,b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN GOALS; FIXE D POINTS; FIXED-POINT CHARACTERIZATION; HARDWARE AND SOFTWARE; HARDWARE DESIGNS;

CANNING; CLOCKS; HARDWARE; INFORMATION THEORY; SEMANTICS; SOFTWARE TESTING; STANDARDS; VERIFICATION;

TEMPORAL LOGIC;

EID: 49949115133     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77966-7_6     Document Type: Conference Paper

References (19)

1. Armoni, R., Fix, L., Flaisher, A., Gerth, R., Ginsburg, B., Kanza, T., Landver, A., Mador-Haim, S., Singerman, E., Tiemeyer, A., Vardi, M.Y., Zbar, Y.: The ForSpec temporal logic: A new temporal property-specification language. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, Springer, Heidelberg (2002)
2. Clarke, E., Emerson, E.: Characterizing correctness properties of parallel programs as fixpoints. In: de Bakker, J.W., van Leeuwen, J. (eds.) Automata, Languages and Programming. LNCS, vol. 85, Springer, Heidelberg (1980)
3. Dam, M.: Temporal logic, automata and classical theories - an introduction. Lecture Notes for the 6th European Summer School on Logic, Language and Information (1994)
4. Eisner, C., Fisman, D.: Sugar 2.0 proposal presented to the Accellera Formal Verification Technical Committee (March 2002), http://www.haifa.il.ibm. com/ verification/sugar/Sugar_2.0_Accellera.ps.
5. Eisner, C., Fisman, D.: A practical introduction to PSL. Springer, Heidelberg (2006)
6. Eisner, C. Fisman, D., Havlicek, J., McIsaac, A., Van Campenhout, D.: The definition of a temporal clock operator. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, Springer, Heidelberg (2003)
7. Emerson, E.A.: Model checking and the Mu-calculus. In: Descriptive Complexity and Finite Models. DIMACS Series in Discrete Mathematics, vol. 31, pp. 185-214. American Mathematical Society, Providence. RI (1997)
8. Havlicek, J., Fisman, D., Eisner, C.: Basic results on the semantics of Accellera PSL 1.1 foundation language. Technical Report 2004.02 Accellera, (May 2004)
9. Havlicek, J., Levi, N., Miller, H., Shultz, K.: Extended CBV statement semantics, partial proposal presented to the Accellera Formal Verification Technical Committee (April 2002), http://www.eda.org/vfv/hm/att-0772/01- ecbv_statement_ semantics.ps.gz
10. Annex E of IEEE Standard for SystemVerilog Unified Hardware Design, Specification, and Verification Language. IEEE Std 1800™ (2005)
11. IEEE Standard for Property Specification Language (PSL). IEEE Std 1850™ (2005)
12. Kaivola, R.: A simple decision method for the linear-time mu-calculus (1995)
13. Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27(3), 333-354 (1983)
14. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Specification. Springer, New York (1992)
15. Manna, Z., Wolper, P.: Synthesis of communicating processes from temporal logic specifications. ACM Trans. Program. Lang. Syst. 6(1), 68-93 (1984)
16. Pnueli, A.: The temporal logic of programs. In: Proc. 18 Annual IEEE Symposium on Foundations of Computer Science, pp. 46-57 (1977)
17. Pnueli, A.: In transition from global to modular temporal reasoning about programs. In: Apt, K. (ed.) Logics and Models of Concurrent Systems. NATO Advanced Summer Institute, vol. F-13, pp. 123-144. Springer, Heidelberg (1985)
18. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5, 285-309 (1955)
19. Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Banff Higher Order Workshop, pp. 238-266 (1995)