| _version_ |
1860799799558668288
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2009-09-03 15:17:00
|
| format |
Restricted Document
|
| id |
7441
|
| institution |
UniSZA
|
| internalnotes |
[1] I. Sommerville, Software Engineering, 6th ed. UK: Addison-Wesley, 2001. [2] J. Bowen, Formal Specification and Documentation using Z: A Case Study Approach: Thomson Publishing, 2003. [3] A. V. C. Aho, M. J., "Efficient String Matching : An Aid to B ibliographic Search," Communication of the ACM, vol. 18, pp. 333- 340, 1975. [4] M. Y. M. S. M Nordin A Rahman, Aziz Ahmad, A Osman M Tap, "Automaton Based Filtering in Optimal DNA Sequence Similarity Search," presented at Proceeding 0f 1st Regional Conference on Computer Science & Technology, 2007. [5] J. C. F. S. Dupuy, M.Chabre-Peccoud, Y.Ledru, "Formal And Informal Specifications : a proposal for a coupling," presented at 13th International Conference Software and Systems Engineering, Paris, France, 2000. [6] M. N. A. R. M YAZID M SAMAN, AZIZ AHMAD AND A OSMAN M TAP, "A Minimum Cost Process in Searching for a Set of Similar DNA Sequences," in 5th WSEAS International Conference on Telecommunications and Informatics. Istanbul, Turkey, 2006, pp. 348-353. [7] D. W. C. Lok Lam Cheng, Siu-Ming Yiu, "Approximate String Matching in DNA Sequences," The University Of Hong Kong, 2003. [8] M. Saaltink, "The Z/EVES System," presented at ZUM, LNCS, 1997. [9] Bowen J.P and M.G. Hinchey, 1995. Ten Commandments of Formal Methods. Computer, 28(4): 56-63. [10] Babich F. and L. Deotto, 2002. Formal Methods for Specification and Analysis of Communication Protocol. IEEE Communication Surveys & Tutorials., 4(1): 2-15.
|
| originalfilename |
2892-01-FH02-FIK-14-00743.pdf
|
| person |
Web Group
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=7441
|
| spelling |
7441 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=7441 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Article Journal application/pdf 5 1.6 Adobe Acrobat Pro DC 20 Paper Capture Plug-in Web Group 2009-09-03 15:17:00 Formal Validation of DNA Database Using Theorem Proving Technique 2892-01-FH02-FIK-14-00743.pdf Formal Validation of DNA Database Using Theorem Proving Technique UniSZA Private Access Formal Validation of DNA Database Using Theorem Proving Technique International Journal of Computer, the Internet and Management This paper discusses the formal validation of DNA database system. A DNA database is a large, organized body of persistent data, usually associated with computerized software designed to update, query, and retrieve components of the data stored within the system. One of the common difficulties faced by the developer is in designing a robust database system. Even so, in order to solve this matter, developers have to focus their efforts on the formal specifications. This is supposed to reduce the overall development time. Formal specifications can be use to provide an unambiguous and precise supplement to natural language descriptions. Besides, it can be rigorously validate, and verified leading to the early detection of specification errors. Consequently, to validate this problem formally, we specify the DNA database system using Z language and prove by using Z/EVES theorem prover tool. By using this kind of tools, it may helps to reduce time, energy and mistake compared to manual theorem proving which can be error task and tedious. 21.1-21.5 [1] I. Sommerville, Software Engineering, 6th ed. UK: Addison-Wesley, 2001. [2] J. Bowen, Formal Specification and Documentation using Z: A Case Study Approach: Thomson Publishing, 2003. [3] A. V. C. Aho, M. J., "Efficient String Matching : An Aid to B ibliographic Search," Communication of the ACM, vol. 18, pp. 333- 340, 1975. [4] M. Y. M. S. M Nordin A Rahman, Aziz Ahmad, A Osman M Tap, "Automaton Based Filtering in Optimal DNA Sequence Similarity Search," presented at Proceeding 0f 1st Regional Conference on Computer Science & Technology, 2007. [5] J. C. F. S. Dupuy, M.Chabre-Peccoud, Y.Ledru, "Formal And Informal Specifications : a proposal for a coupling," presented at 13th International Conference Software and Systems Engineering, Paris, France, 2000. [6] M. N. A. R. M YAZID M SAMAN, AZIZ AHMAD AND A OSMAN M TAP, "A Minimum Cost Process in Searching for a Set of Similar DNA Sequences," in 5th WSEAS International Conference on Telecommunications and Informatics. Istanbul, Turkey, 2006, pp. 348-353. [7] D. W. C. Lok Lam Cheng, Siu-Ming Yiu, "Approximate String Matching in DNA Sequences," The University Of Hong Kong, 2003. [8] M. Saaltink, "The Z/EVES System," presented at ZUM, LNCS, 1997. [9] Bowen J.P and M.G. Hinchey, 1995. Ten Commandments of Formal Methods. Computer, 28(4): 56-63. [10] Babich F. and L. Deotto, 2002. Formal Methods for Specification and Analysis of Communication Protocol. IEEE Communication Surveys & Tutorials., 4(1): 2-15.
|
| spellingShingle |
Formal Validation of DNA Database Using Theorem Proving Technique
|
| summary |
This paper discusses the formal validation of DNA database system. A DNA database is a large, organized body of persistent data, usually associated with computerized software designed to update, query, and retrieve components of the data stored within the system. One of the common difficulties faced by the developer is in designing a robust database system. Even so, in order to solve this matter, developers have to focus their efforts on the formal specifications. This is supposed to reduce the overall development time. Formal specifications can be use to provide an unambiguous and precise supplement to natural language descriptions. Besides, it can be rigorously validate, and verified leading to the early detection of specification errors. Consequently, to validate this problem formally, we specify the DNA database system using Z language and prove by using Z/EVES theorem prover tool. By using this kind of tools, it may helps to reduce time, energy and mistake compared to manual theorem proving which can be error task and tedious.
|
| title |
Formal Validation of DNA Database Using Theorem Proving Technique
|
| title_full |
Formal Validation of DNA Database Using Theorem Proving Technique
|
| title_fullStr |
Formal Validation of DNA Database Using Theorem Proving Technique
|
| title_full_unstemmed |
Formal Validation of DNA Database Using Theorem Proving Technique
|
| title_short |
Formal Validation of DNA Database Using Theorem Proving Technique
|
| title_sort |
formal validation of dna database using theorem proving technique
|