Call for Paper - September 2022 Edition
IJCA solicits original research papers for the September 2022 Edition. Last date of manuscript submission is August 22, 2022. Read More

Domain Identification and Description Techniques

Print
PDF
 
Download Full Text
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 159 - Number 1
Year of Publication: 2017
Authors:
Naeem Akhter, Muhammad Idrees, Furqan-ur-Rehman
10.5120/ijca2017912603

Naeem Akhter, Muhammad Idrees and Furqan-ur-Rehman. Domain Identification and Description Techniques. International Journal of Computer Applications 159(1):16-19, February 2017. BibTeX

@article{10.5120/ijca2017912603,
	author = {Naeem Akhter and Muhammad Idrees and Furqan-ur-Rehman},
	title = {Domain Identification and Description Techniques},
	journal = {International Journal of Computer Applications},
	issue_date = {February 2017},
	volume = {159},
	number = {1},
	month = {Feb},
	year = {2017},
	issn = {0975-8887},
	pages = {16-19},
	numpages = {4},
	url = {http://www.ijcaonline.org/archives/volume159/number1/26966-2017912603},
	doi = {10.5120/ijca2017912603},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

A system to be developed is expected to provide solution of a problem. After a careful identification of domains, an explicit, precise and well-engineered description is essential to develop an accurate solution providing system. Machine domain is formal while problem domain is informal. Description is like a platform for the developers to start and finish the development activities. Four principles regarding domain descriptions include von Neuman’s principle; Principle of reductionism; Montaigne’s principle and Shanley law. Graphs and models are also vital tools of domain description.

References

  1. Michael Jackson; Requirements and Specifications: a Lexicon of Practice, Principles and Prejudices; Addison-Wesley, 1995
  2. John von Neumann and Oskar Morgenstern; Theory of Games and Economic Behaviour; Princeton University Press, 1944.
  3. Donald E Knuth; Structured Programming with go to Statements; ACM Computing Surveys Volume 6 Number 4 pages 261-301, December 1974.
  4. Pierre-Arnoul de Marneffe; Holon programming:A survey; Université de Liège, Service Informatique, 1973. Quoted in [Knuth74].
  5. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides; Design Patterns: Elements of Reusable Object-Oriented Software; Addison-Wesley 1994.
  6. Christopher Alexander; The Timeless Way of Building; Oxford University Press, 1979.
  7. Michael Jackson; Software Requirements & Specifications: a lexicon of practice, principles and prejudices; Addison-Wesley and ACM Press 1995.
  8. Daniel Jackson and Michael Jackson; Problem Decomposition for Reuse; Software Engineering Journal 11,1 pages 19-30, January 1996.
  9. Jim Woodcock and Martin Loomes; Software Engineering Mathematics: Formal Methods Demystified; Pitman, 1988.
  10. R L Ackoff, Scientific Method: Optimizing Applied Research Decisions, Chichester, England, Wiley, 1962.

Keywords

Problem domain, Machine domain, Reductionism, Analytical model, Iconic model, Analogic model