Testing LTL formula translation into Büchi automata

International Journal on Software Tools for Technology Transfer

Volumn 4, Issue 1, 2002, Pages 57-70

  Tauriainen, Heikki ^a   Heljanko, Keijo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Model checking; Software testing; Temporal logic; Verification

Indexed keywords

AUTOMATED TOOLS; CRITICAL SYSTEMS; LINEAR TEMPORAL LOGIC; LTL FORMULAE; MODEL CHECKER; MODEL CHECKING TOOLS; TESTING METHODOLOGY;

MODEL CHECKING; SOFTWARE TESTING; TEMPORAL LOGIC; TOOLS; VERIFICATION;

AUTOMATA THEORY;

EID: 84896692979     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090200070     Document Type: Article

References (21)

1. Avižienis, A.: The N-version approach to fault-tolerant software. IEEE Trans Software Eng SE-11(12):1491-1501, 1985
2. Avižienis, A., Chen, L.: On the implementation of N-version programming for software fault tolerance during program execution. In: Proc. 1st IEEE International Computer Software and Applications Conference (COMPSAC 77), pp. 149-155, 1977
3. Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory-efficient algorithms for the verification of temporal properties. Formal Methods Syst Design 1:275-288, 1992
4. Couvreur, J.-M.: On-the-fly verification of linear temporal logic. In: Proc. World Congress on Formal Methods in the Development of Computing Systems (FM'99), volume I, Lecture Notes in Computer Science, vol. 1708. Springer, Berlin Heidelberg New York, 1999, pp. 253-271
5. Daniele, M., Giunchiglia, F., Vardi, M.Y.: Improved automata generation for linear temporal logic. In: Proc. 11th International Conference on Computer Aided Verification (CAV'99), Lecture Notes in Computer Science, vol. 1633. Springer, Berlin Heidelberg New York, 1999, pp. 249-260. See also: "Software packages" at URL: http://www.cs.rice.edu/CS/Verification/
6. Etessami, K., Holzmann, G.: Optimizing B̈uchi automata. In: Proc. 11th International Conference on Concurrency Theory (CONCUR'2000), Lecture Notes in Computer Science, vol. 1877. Springer, Berlin Heidelberg New York, 2000, pp. 153-167
7. Gerth, R., Peled, D., Vardi, M.Y., Wolper P.: Simple on-thefly automatic verification of linear temporal logic. In: Proc. 15th Workshop Protocol Specification, Testing, and Verification, pp. 3-18. Chapman and Hall, London, 1995
8. Holzmann, G.: The model checker Spin. IEEE Trans Software Eng 23(5):279-295, 1997
9. Clarke, E. Jr., Grumberg, O., Peled, D.: Model checking. MIT, Boston, Mass., USA, 1999
10. Kupferman, O., Vardi, M. Y.: Model checking of safety properties. In: Proc. 11th International Conference on Computer Aided Verification (CAV'99), Lecture Notes in Computer Science, vol. 1633. Springer, Berlin Heidelberg New York, 1999, pp. 172-183.See also an extended version at URL: http://www.cs.rice.edu/vardi/papers/
11. Latvala, T., Heljanko, K.: Coping with strong fairness. Fundam Inform 43(1-4):175-193, 2000
12. Rönkkö, M.: A distributed object oriented implementation of an algorithm converting a LTL formula to a generalised Buchi automaton, 1999. Available only on the www.See MaunoRonkko's homepage at URL: http://www.abo.fi/mauno.ronkko/
13. th IEEE Symposium on Foundations of Computer Science, pp. 319-327. IEEE Computer, New York, 1988
14. Tauriainen, H.: A randomized testbench for algorithms translating linear temporal logic formulae into B̈uchi automata. In: Proc. Workshop Concurrency, Specification and Programming 1999 (CS&P'99), pp. 251-262. Warsaw University, 1999
15. Tauriainen, H.: Automated testing of B̈uchi automata translators for linear temporal logic. Technical Report A66, Laboratory for Theoretical Computer Science, Helsinki University of Technology, 2000. Available at URL: http://www.tcs.hut.fi/Publications/reports/A66abstract.html
16. Tauriainen, H., Heljanko, K.: Testing Spin's LTL formula conversion into B̈uchi automata with randomly generated input. In: Proc. 7th International Spin Workshop on Model Checking of Software (Spin'2000), Lecture Notes in Computer Science, vol. 1885. Springer, Berlin Heidelberg New York, 2000, pp. 54-72
17. Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.), Handbookof formal languages, volume 3, pp. 385-455. Springer, Berlin Heidelberg New York, 1997
18. Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Logics for concurrency: structure versus automata, Lecture Notes in Computer Science, vol. 1043. Springer, Berlin Heidelberg New York, 1996, pp. 238-265
19. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. 1st IEEE Symposium on Logic in Computer Science (LICS'86), pp. 332-344. IEEE Computer, New York, 1986
20. Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Inf Comput 115(1):1-37, 1994
21. Varpaaniemi, K., Heljanko, K., Lilius, J.: PROD 3.2 - An advanced tool for efficient reachability analysis. In: Proc. 9th International Conference on Computer Aided Verification (CAV'97), Lecture Notes in Computer Science, vol. 1254. Springer, Berlin Heidelberg New York, 1997, pp. 472-475