Lecture Notes in Computer Science 3472

Literature 643
[PP04] Wolfgang Prenninger and Alexander Pretschner. Abstractions for modelbased
testing. In Proceedings of the International Workshop on Test and
Analysis of Component Based Systems (TACoS 2004), Electronic Notes in
Theoretical Computer Science. Elsevier Science Publishers, 2004. [284, 288,
452]
[PPS + 03] J. Philipps, A. Pretschner, O. Slotosch, E. Aiglstorfer, S. Kriebel, and
K. Scholl. Model-based test case generation for smart cards. In In Proceedings
of the 8th International Workshop on Formal Methods for Industrial
Critical Systems (FMICS 2003), Electronic Notes in Theoretical Computer
Science. Elsivier, 2003. to appear. [286, 339, 343, 347, 406, 439, 444, 446,
447, 448, 449, 451, 453, 454, 455, 456, 457, 458, 459]
[PPW + 05] Alexander Pretschner, Wolfgang Prenninger, Stefan Wagner, Christian
Kühnel, Martin Baumgartner, Bernd Sostawa, Rüdiger Zölch, and Thomas
Stauner. One Evaluation of Model-Based Testing and its Automation. In
Proc. ICSE’05, 2005. To appear. [291]
[PR94] Irith Pomeranz and Sudhakar M. Reddy. Application of homing sequences
to synchronous sequential circuit testing. IEEE Transactions on Computers,
43(5):569–580, May 1994. [22, 32]
[Pre01] A. Pretschner. Classical search strategies for test case generation with
constraint logic programming. In E. Brinksma and J. Tretmans, editors,
Proceedings of the 3rd International Workshop on Formal Approaches to
Testing of Software (FATES 2001), number NS/01/4 in BRICS Notes Series,
pages 47–60, 2001. Satellite Workshop on CONCUR 2001. [407]
[Pre03] A. Pretschner. Compositional generation for MC/DC test suites. In Proceedings
of the International Workshop on Test and Analysis of Component
Based Systems (TACoS 2003), volume 82(6) of Electronic Notes in Theoretical
Computer Science, pages 1–11. Elsevier Science Publishers, 2003.
[289, 407]
[PS01] Tatjana Petković and Magnus Steinby. On directable automata. Journal of
Automata, Languages and Combinatorics, 6(2):205–220, 2001. [6]
[PST96] Ben Potter, Jane Sinclair, and David Till. An Introduction to Formal Specification
and Z. Prentice Hall, second edition, 1996. [325, 327]
[PTLP99] S. Prowell, C. Trammell, R. Linger, and J. Poore. Cleanroom Software
Engineering. Addison Wesley, 1999. [283]
[Put94] Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic
Programming. John Wiley and Sons, Inc, 1994. [239, 241]
[PVY99] D. Peled, M. Vardi, and M. Yannakakis. Black box checking. In Proceedings
of the Joint International Conference on Formal Description Techniques
for Distributed Systems and Communication Protocols (FORTE 1999) and
Protocol Specification, Testing and Verification (PSTV 1999), volume 156
of IFIP Conference Proceedings, pages 225–240. Kluwer Academic, 1999.
[599]
[Rav96] Bala Ravikumar. A deterministic parallel algorithm for the homing sequence
problem. In Proceedings of the 8th IEEE Symposium on Parallel
and Distributed Processing (SPDP 1996), pages 512–520, New Orleans, LA,
October 1996. IEEE Computer Society Press. [31]
[Rav98] Bala Ravikumar. Parallel algorithms for finite automata problems. In
José D.P.Rolim,editor,Proceedings of the 10 Workshops of the 12th International
Parallel Processing Symposium (IPPS 1998) and 9th Symposium
on Parallel and Distributed Processing (SPDS 1998), volume 1388 of
Lecture Notes in Computer Science, page 373. Springer-Verlag, 1998. [31]