Modeling and Verification Using UML Statecharts: A Working Guide to Reactive System Design, Runtime Monitoring and Execution-based Model Checking

Modeling and Verification Using UML Statecharts: A Working Guide to Reactive System Design, Runtime Monitoring and Execution-based Model Checking

Volumn , Issue , 2006, Pages 1-306

  Drusinsky, Doron ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85011741622     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-0-7506-7949-7.X5000-4     Document Type: Book

References (42)

1. www.accellera.org.
2. W. Penczek (1995) Branching Time and Partial Order in Temporal Logics. Time and Logic: A Computational Approach Univ. College of London 179-228.
3. J.R. Bäuchi (1960) On a decision method in restricted second order arithmetic. Proc. Internat. Congr Logic, Method. and Philos. Sci. Stanford: Stanford University Press 1-12.
4. A.K. Chandra, D. Kozen and L.J. Stockmeyer (1981) Alternation. Journal of the Association for Computing Machinery 28 114-133.
5. E.M. Clarke Edmund M., O. Grumberg Orna and D.A. Peled Doron A. (Eds) (January 2000) Model Checking MIT Press ISBN 0-262-03270-8
6. D. Drusinsky (Jul. 1990) Symbolic cover minimization of fully I/O specified finite state machines. Computer-Aided Design of Integrated Circuits and Systems IEEE Transactions Vol. 9(7), 779-781.
7. D. Drusinsky (3 January 2005) Semantics and Runtime Monitoring of TLCharts: Statechart Automata with Temporal Logic Conditioned Transitions. Electronic Notes in Theoretical Computer Science Volume 113 1-233. Proceedings of the Fourth Workshop on Runtime Verification (RV 2004). 20040403-20040403. Edited by K. Havelund, Roşu Copyright © 2006, Elsevier B. V. All rights reserved
8. D. Drusinsky (1885) The Temporal Rover and the ATG Rover. Proc. Spin2000 Workshop Springer Verlag Lecture Notes in Computer Science 323-329.
9. D. Drusinsky Doron (November 2001) Specs Can Handle Exceptions. Embedded Developers Journal 8.
10. D. Drusinsky and D. Harel David (July 1989) Using Statecharts for Hardware Description and Synthesis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 8(7), 79-806. Also appeared in Proc. ICCAD, 1988
11. D. Drusinsky and D. Harel David (May 1994) On the power of bounded concurrency I: Finite Automata. Journal of the ACM 41(3), 517-539.
12. J.M. Jézéquel JeanMarc (Eds) (1996) Object-Oriented Software Engineering with Eiffel. Addison-Wesley Eiffel in Practice Series, ISBN 0-201-63381-7 from the PAMPA Project
13. J.E. Hopcroft John E., R. Motwani Rajeev and J.D. Ullman Jeffrey D. (June 2001) Introduction to Automata Theory, Languages, and Computation. 2nd Edition Addison Wesley ISBN: 0201441241
14. D. Harel (1987) Statecharts: A Visual Approach to Complex Systems. Science of Computer Programming Vol. 8(No. 3), 231-274..
15. D. Harel and A. Naamad (October 1996) The STATEMATE semantics of statecharts, ACM Transactions on Software Engineering and Methodology (TOSEM) Volume 5(4), 293-333. Year of Publication: 1996 table of contents
16. H. K. Havelund and R. G. Rosu (23 July 2001) Monitoring Java Programs with Java PathExplorer. Proc. of the First Workshop on Runtime Verification (RV'01) Electronic Notes in Theoretical Computer Science 55(2), Paris, France
17. S. Miyano and T. Hayashi (1984) Alternating Finite automata on infinite-words. Theoretical Computer Science 321-330
18. G.J. Holzmann (2004) SPIN Model Checker. The Primer and Reference Manual Publisher: Addison Wesley Professional (see following) ISBN: 0-321-22862-6
19. http : //j ava.sun. com/developerB ooks/j avaprogramming/jdk14/javapch06.PDF
20. http://www.cs.iastate.edu/leavens/JML/index.shtml
21. M.B. Dwyer Matthew B., G.S. Avrunin George S. and J.C. Corbett James C. (Eds) (March, 1998) Property Specification Patterns for Finite-state Verification. 2nd Workshop on Formal Methods in Software Practice An abstract of this paper is also available
22. http://patterns.projects.cis.ksu.edu/documentation/patterns.shtml
23. Z. Kohavi (1978) Switching and Finite Automata Theory. New York: McGraw-Hill
24. R. Koymans (1990) Specifying Real-Time Properties with Metric Temporal Logic. Real-time Systems 2(4), 255-299.
25. N. Markey Nicolas (2003) Temporal logic with past is exponentially more succinct. Concurrency Column. Bulletin of the EATCS 79 122-128.
26. B. Moszkowski Ben (1986) Executing Temporal Logic Programs. New York, NY: Cambridge University Press
27. Z. Manna and A. Pnueli (1991) The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag
28. Z. Manna and A. Pnueli (1995) Temporal Verification of Reactive Systems: Safety. Springer-Verlag
29. P.M. Melkar-Smith (Oct. 1988) A graphical representation of interval logic. Proc. Inter. Conf. Concurrency Hamburg: FRG 106-120. LNCS 335, Springer-Verlag
30. An Introduction to Object-Oriented Programming with Java 1.5. Edition 3 McGraw-Hill Science/Engineering/Math ISBN: 0073043915. Author: C. Thomas Wu (Otani). Publisher:
31. R. Schwantz Randal, T. Phoenix Tom and B.D. Foy Brian D. (01 Jul 2005) Learning Perl. 4th edition O'Reilly & Associates ISBN 0-596-10105-8. Randal Schwartz and Tom Phoenix and Brian D. Foy
32. http://www.kommunikation.aau.dk/prior/index2.htm
33. M.O. Rabin (1969) Automata on Infinite Objects and Church's Problem. Conference Series in Mathematics Vol. 13 AMS
34. J.R. Rumbaugh James R., M.R. Blaha Michael R., W. Lorensen William, F. Eddy Frederick and W. Premerlani. Publisher: William (Eds) (October 1, 1990) Object-Oriented Modeling and Design. 1st edition ISBN 0136298419 (Hardcover) by
35. S. Safra (1988) On the complexity of ω-automata. 29th annual Symposium on Foundations of Computer Science October 24–26, 1988 White Plains, New York: IEEE Computer Society Press 319-327.
36. S. S afra (October 1988) On the complexity of !-automata. Proc. 29th IEEE Symp. on Foundations of Computer Science White Plains 319-327.
37. M. Sipser (1979) Lower bounds on the size of sweeping automata. Annual ACM Symposium on Theory of Computing 360-364.
38. A combinatorial approach to the theory of !-automata. Information and Computation 48 261-283.
39. http://spot.lip6.fr/wiki/LtITranslationAlgorithms
40. K. Havelund and W. Visser (Eds) (October 2002) Program Model Checking as a New Trend. International Journal on Software Tools for Technology Transfer (STTT) Volume 4(Number 1),
41. http://en.wikipedia.org/wiki/Linear temporal logic
42. W. Thomas Wolfgang (1990) Automata on infinite objects. Van Leeuwen (Ed.) Handbook of Theoretical Computer Science Elsevier 133-164.