Research on formalization of efficient query application problems with compound condition in software development

doi:10.1016/S1005-8885(17)60195-X

中国邮电高校学报(英文) ›› 2017, Vol. 24 ›› Issue (2): 18-30.doi: 10.1016/S1005-8885(17)60195-X

• Artificial Intelligence • 上一篇下一篇

Research on formalization of efficient query application problems with compound condition in software development

杨宇晨 Wang Xiaofang Yin Guisheng

电子政务建模仿真国家工程实验室

收稿日期:2016-12-01 修回日期:2017-04-10 出版日期:2017-04-30 发布日期:2017-04-30
通讯作者: 杨宇晨 E-mail:yangyuchen521_1979@aliyun.com
基金资助:
电子政务建模仿真国家工程实验室

Research on formalization of efficient query application problems with compound condition in software development

Yu-Chen YANG

Received:2016-12-01 Revised:2017-04-10 Online:2017-04-30 Published:2017-04-30
Contact: Yu-Chen YANG E-mail:yangyuchen521_1979@aliyun.com
Supported by:
the Open Fund for National Engineering Laboratory for E-Government Modeling and Emulation.

摘要/Abstract

摘要： This paper provides a formalized definition of the application problem of compound condition query (CCQ) and a formal method of applying requirements elicitation based on trace information space derived from trace algebra. With the formalized process of solving the application problem of CCQ, formal requirements specification of application of CCQ is given, a formalized and automatic mapping of the results of requirements elicitation to the formal requirements specification is performed, the software system model and the application code are developed. Through a sample application of comprehensive query on housing information, the feasibility of formalized and automatic software development for the application problem of CCQ is proved. The result has important implications for the other problems regarding formalization and automatic software development.

关键词: automatic programming, formal specification, requirements-based programming, compound condition query

Abstract: This paper provides a formalized definition of the application problem of compound condition query (CCQ) and a formal method of applying requirements elicitation based on trace information space derived from trace algebra. With the formalized process of solving the application problem of CCQ, formal requirements specification of application of CCQ is given, a formalized and automatic mapping of the results of requirements elicitation to the formal requirements specification is performed, the software system model and the application code are developed. Through a sample application of comprehensive query on housing information, the feasibility of formalized and automatic software development for the application problem of CCQ is proved. The result has important implications for the other problems regarding formalization and automatic software development.

Key words: automatic programming, formal specification, requirements-based programming, compound condition query

中图分类号:

TP301.2

Yu-Chen YANG. Research on formalization of efficient query application problems with compound condition in software development[J]. JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM, 2017, 24(2): 18-30.

参考文献

1. Harel D. From play-in scenarios to code: an achievable dream. IEEE Computer, 2001, 34( 1): 53-60

2. Hinchey M G, Rash J L, Rouff C A. A formal approach to requirements-based programming. Proceedings of the 12th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (ECBS'05), Apr 4-7, 2005, Greenbelt, MD, USA. Piscataway, NJ, USA: IEEE, 2005: 339-345

3. Rodrigues W, Guyomarch F, Dekeyser J L. An MDE approach for automatic code generation from UML/MARTE to OpenCL. Computing in Science and Engineering, 2013, 15(1): 46-55

4. Doran S, August S. Reddo: a model driven engineering toolset for embedded software development. Proceedings of the 2013 ACM SIGAda Annual Conference on High Integrity Language Technology (HILT’13), Nov 10-14, 2013, Pittsburgh, PA, USA. New York, NY, USA: ACM, 2013: 47-48

5. Whittle J, Schumann J. Generating statechart designs from scenarios. Proceedings of the 22nd International Conference on Software Engineering (ICSE’00), Jun 4-11, 2000, Limerick, Irland. IEEE Piscataway, NJ, USA: IEEE, 2000: 314-323

6. Colombo P, Khendek F, Lavazza L. Bridging the gap between requirements and design: an approach based on problem frames and SysML. Journal of Systems and Software, 2012, 85(3): 717-745

7. Abdallah R, Hélouët L, Jard C. Distributed implementation of message sequence charts. Software and Systems Modeling, 2015, 14(2): 1029-1048

8. Zhang W Y, Xiang L Z, Wang X F. A model theory for distributed application modeling on big data. Journal of Harbin Engineering University, 2015, 36(5): 671-677 (in Chinese)

9. Cansell D, Méry D. Foundations of the B method. Computing and Informatics, 2012, 22(3/4): 221-256

10. Bjørner D, Jones C B. The Vienna development method: the meta-language. LNCS 61. Berlin, Germany: Springer, 1978

11. Hansen S, Berente N, Lyytinen K. Requirements in the 21st century: current practice and emerging trends. Lyytinen K, Loucopoulos P, Mylopoulos J, et al (eds). Design Requirements Engineering: A Ten-Year Perspective. LNBIP 14. Berlin, Germany: Springer, 2009: 44-87

12. Al-Fataftah I, Issa A A. A systematic review for the latest development in requirement engineering. World Academy of Science, Engineering and Technology, 2012 6: 691-698

13. Zowghi D. A logic-based framework for the management of changing software requirements. Ph D Thesis. Sydney, Australia: Macquarie University, 1999

14. Loucopoulos P, Karakostas V. System requirements engineering. New York, NY, USA: McGraw-Hill, 1995

15. Hinchey M G, Rash I L, Rouff C A. Requirements to design to code: towards a fully formal approach to automatic code generation. Technical Report. TM-2005-2 12774. Greenbelt, MD, USA: NASA Goddard Space Flight Center, 2004

16. Harel D, Marelly R. Specifying and executing behavioral requirements: the play-in/play-out approach. Software and Systems Modeling, 2003, 2(2): 82-107

17. Carter J, Gardner W B. Mise en scene: converting scenarios to CSP traces in support of requirements-based programming. Proceedings of the 31st IEEE Software Engineering Workshop (SEW’07), Mar 6-8, 2007, Columbia, MD, USA. Piscataway, NJ, USA: IEEE, 2007: 41-52

18. Hinchey M G, Rash J L, Rouff C A. System and method for deriving a process-based specification. USP 7543274, 2009-06-02

19. Rash J L, Hinchey M G, Rouff C A, et al. A requirements-based programming approach to developing a NASA autonomous ground control system. Artificial Intelligence Review, 2006, 25(4): 285-297

20. Jackson M A. Software requirements and speci?cations: a lexicon of practice, principles and prejudices. Upper Saddle River, NJ, USA: Addison-Wesley, 1995

21. Jackson, M A. Problem frames: analyzing and structuring software development problems. Upper Saddle River, NJ, USA: Addison-Wesley , 2001

22. Hall J G, Rapanotti L, Jackson M. Problem oriented software engineering. Technial Report, Oct 12, 2006, Department of Computing, The Open University, 2006

23. Zhang W Y, Xiang L Z, Wang X F. A big data resource description model for efficient retrieval. Journal of Harbin Engineering University, 2014, 35(5): 594-601 (in Chinese)

24. Zhang W Y, Xiang L Z, Wang X F. Big data partition management model and its application research. Journal of Harbin Engineering University, 2014, 35(3): 353-360 (in Chinese)

25. Sanjay G, Howard G, Shun-Tak L. The google file system. Proceedings of the 19th ACM Symposium on Operating Systems Principles (SOSP ’03), Oct 19-22, 2003, Bolton Landing (Lake George), NY, USA. New York, NY, USA: ACM, 2003: 29-43

26. Fay C, Jeffrey D, Sanjay G, et al. Bigtable: a distributed storage system for structured data. Proceedings of the 7th USENIX Symposium on Operation Systems Design and Implementation (OSDI’06), Nov 6-8, 2006, Seattle, WA, USA. New York, NY, USA: ACM, 2006: 205-218

27. Jeffrey D, Sanjay G. Mapreduce: simplified data processing on large clusters. Proceedings of the 6th USENIX Symposium on Operation Systems Design and Implementation (OSDI’04), Dec 6–8, 2004, San Francisco, CA, USA. New York, NY, USA: ACM, 2004: 137-150

28. Cooper B F, Ramakrishnan R, Srivastava U, et al. PNUTS: Yahoo!’s hosted data serving platform. Proceedings of the VLDB Endowment, 2008, 1(2): 1277-1288

29. Giuseppe D, Deniz H, Madan J, et al. Dynamo: amazon’s highly available key-value store. Processdings of the 21th ACM Symposium on Operating Systems Principles (SOSP’07), Oct 14-17, 2007, Stevenson, WA, USA. New York, NY, USA: ACM, 2007: 205-220

30. Wu S, Jiang D, Ooi B, et al. Efficient B-tree based indexing for cloud data processing. Proceedings of the VLDB Endowment, 2010, 3(1): 1207-1218

31. Wang J B, Wu S, Gao H, et al. Indexing multi-dimensional data in a cloud system. Proceedings of the 2010 ACM International Conference on Management of Data (SIGMOD’10), Jun 6-10, 2010, Indianapolis, IA, USA. New York, NY, USA: ACM, 2010: 591-602

32. Ding L L, Qiao B Y, Wang G R, et al. An efficient quad-tree based index structure for cloud data management. Proceedings of the 12th International Conference on Web-Age Information Management (WAIM’11), Sept 14-16, 2011, Wuhan, China. New York, NY, USA: ACM, 2011: 238-250

33. Zhou M Q, Zhang R, Zeng D D, et al. Join optimization in the MapReduce environment for column-wise data store. Proceedings of the 6th International Conference on Semantics, Knowledge and Grids (SKG’10), Nov 1-3, 2010, Ningbo, China. Piscataway, NJ, USA: IEEE, 2010: 97-104

Research on formalization of efficient query application problems with compound condition in software development

Research on formalization of efficient query application problems with compound condition in software development

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics

本文评价