Программа дисциплины Методология разработки корпоративных приложений

Партнерка на США и Канаду по недвижимости, выплаты в крипто

30% recurring commission
Выплаты в USDT
Вывод каждую неделю
Комиссия до 5 лет за каждого referral

Правительство Российской Федерации

Государственное образовательное бюджетное учреждение

высшего профессионального образования

«Государственный университет - Высшая школа экономики»

Факультет Бизнес-информатики

Отделение Программной инженерии

Программа дисциплины

Методология разработки корпоративных приложений

для направления 080700.68 - «Бизнес-информатика»

подготовки магистра

Автор программы

доцент, к. т.н.

*****@***ru

Program Author:

Associate Professor, Dr. Sergey V. Zykov, PhD (Comp. Sci.)

General Description of the Curriculum:

The course is delivered to master students of software engineering department, business informatics faculty, SU-HSE. It is a part of specialized curricula unit, and it is delivered in modules 1-4 of the first academic year. Number of credits is 8. Course length is 88 academic hours, including 44 hours of lectures, 44 hours of practice, and 200 hours of self-study. Academic control forms are one home assignment, one research paper, one test, one credit after module 2, and one written exam after module 4.

НЕ нашли? Не то? Что вы ищете?

Pre-requisites

The course is based on the knowledge of foundations of mathematics, computer science and algorithm theory, object-oriented analysis and design (OOAD), and on ability to choose adequate mathematics methods and to apply them for problem solution.

Course Objective

The objective of the Enterprise Software System (ESS) Development course delivery is to form professional competencies, related to applying OOAD/programming theory to ESS development. Such an approach allows students to creatively apply the theory for large-scale software project development and information processing while doing their professional activities, and preparing master theses.

Abstract

The course is based on the “Enterprise Applications Development Methodology (using Platform)” course, implemented into SU-HSE in 2008, and on the academic materials, produced by a project team of Moscow Engineering Physics Institute, headed by the author, as a curriculum grant project for Microsoft Research Ltd. in 2004, and developed later under support of SU-HSE Foundation for Educational Innovations. The course is aimed at studying the major current approaches to large-scale software system design and implementation. The course is focused at the methods, platforms, technologies and tools, which are applied for all the development phases of the software systems in question.

Training Objectives:

During the course, the students will:

· Study the basic principles of organization and operation of large-scale software systems;

· Study the ESS lifecycle models and the related approaches to analysis, design and development of such software systems;

· Master methods and tools of software analysis, design and development for applied enterprise-level solutions;

· Acquire practical skills in ESS lifecycle choice, draft and detailed design, module development, integration, testing, and documenting, while using state-of the-art tools and integrated environments.

II. Topic-Wise Curricula Plan

No.	Topic Name	Course Hours, Total	Audience Hours	Self-Study
Lectures	Practical Studies
Module 1 (32 hrs). Mathematical foundation for enterprise system modeling. Lifecycle models
1	Introduction to the “ESS Development” course. Foundations of finite sequence theory (lambda calculus)	12	2	2	8
2	Introduction to type theory	12	2	2	8
3	Formal system of combinatory logic	12	2	2	8
4	Foundations of category theory	12	2	2	8
5	Object systems of variable domains	12	2	2	8
6	Abstract machines for modeling object environment-based computations	12	2	2	8
7	Software lifecycle for enterprise systems	12	2	2	8
8	Software lifecycle models for enterprise systems	12	2	2	8
	Module 1, totally:	96	16	16	64

Module 2 (16 hrs). Methodology and technology basis of enterprise system development
9	Methodologies for enterprise software systems development	14	2	2	10
10	Comparison of technologies and architectures of Java enterprise software systems development platforms	14	2	2	10
11	Modeling and controlling data for enterprise software systems development	12	2	2	8
12	Enterprise software system architectures	6	1	1	4
13	Automated development tools for enterprise software system development	6	1	1	4
	Module 2, totally:	52	8	8	36

Module 3 (20 hrs). Microsoft technologies and tools for enterprise software system development
14	Microsoft .Net: concepts, architecture, and application for enterprise software system development	10	1	1	8
15	MSF methodology and component-based approach for enterprise software system development	12	2	2	8
16	Heterogeneous enterprise software system development with language interoperability	12	2	2	8
17	Database and .Net data processing technologies for enterprise software system development	14	2	2	10
18	Web technologies for enterprise software system development. Silverlight technology and rich media tools for enterprise content management.	12	2	2	8
19	Team development of enterprise software systems	10	1	1	8
	Module 3, totally:	70	10	10	50

Module 4 (20 hrs). Innovative models and tools for enterprise software system development. Implementation examples
20	Domain-specific language-based approach to enterprise software system design	8	1	1	8
21	Applying Microsoft Enterprise Libraries for enterprise software system development	8	2	2	8
22	Microsoft Dynamics platform for enterprise software system implementations. Implementation examples of industry-specific solutions	10	2	2	10
23	Implementation features of enterprise software systems in oil-and-gas. Implementation examples of enterprise software systems in other industries	10	2	2	10
24	Enterprise portals	10	2	2	10
25	Conclusive survey of the course “Enterprise software system development”	10	1	1	4
	Module 4, totally:	70	10	10	50
	TOTAL:	288	44	44	200

III. Basic book(s) and/or reader(s)

Books:

- Barendregt H. P. The lambda calculus (revised edition), Studies in Logic, 103, North Holland, Amsterdam, 1984

- Booch G., Jacobson I., Rumbaugh J. The Unified Modeling Language User Guide. Addison Wesley, 1998

- Box D. , Vol.1: The Common Language Runtime. Addison Wesley, 2002, 432pp.

- Grimes F. for Programmers. Manning Publications, 2002, 386 pp

- Murray K. First Look 2007 Microsoft Office System. Microsoft Press, 2006, 208 pp.

- Nathan A. .NET and COM: The Complete Interoperability Guide. Sams, 2002, 1608 pp.

- Petzold Ch. Programming Microsoft Windows with C#. Microsoft Press, 2002, 1055 pp.

- Platt D. S. Introducing . Microsoft Press, 2002, 336 pp.

- Richter J. Applied Framework Programming. Microsoft Press, 2002, 500 pp.

- Schach S. R. Object-Oriented and Classical Software Engineering (5 ed.) McGraw-Hill, 2001, 744 pp.

- Scott D. S. Domains for denotational semantics. ICALP 1982, 577-613

- Sommerville I. Software Engineering (8th Edition). Pearson Education Ltd., 2008, 850 pp.

- Wolfengagen V. E. Methods and Means for Computations with Objects. Applicative Computational Systems. 2004, Moscow, Jurinfor, — XVI+789 p. ISBN -0

- Wolfengagen V. E. Categorical Abstract Machine. Conspectus: Introduction to Computations. 2002, Moscow, Jurinfor, 96 p. p. ISBN -7

- Wolfengagen V. binatory logic in putations with objects through examples and exercises, 2003, Moscow, Jurinfor, 334 p. ISBN -0.

Internet References:

- The platform: www. /net

- The Microsoft Solution Framework methodology: www. /technet/itsolutions/msf/default. mspx

- Fowler M. Patterns of Enterprise Application Architecture. Addison-Wesley, 2003. http://www. /articles/newMethodology. html

- Microsoft Dynamics-based ESS development methodology and solutions: http://learning. /Manager/Catalog. aspx? clang=en-US&dtype=Catalog&Sort=Relevancy&page=1&cats=%7b803f37c6-1c6bf-7367c606d0aa%7d%3a%7b132be62-a895-ca5a6d643857%7d

IV. Education control forms / Assessments:

- Current control: attendance record, seminar-based knowledge control, home assignment control;

- Intermediate control: credit by the end of Module 2, written test by the end of Module 3, research paper by the end of Module 4, home assignment by the end of Module 4;

- Final control: exam by the end of Module 4;

- The final course grade is a sum of the following elements:

1) practice activities (reports, discussions, business cases);

2) home assignment;

3) research paper;

4) written test;

5) credit;

6) exam.

The overall course grade G (10-point scale) is calculated as a sum of:

G = 0.1P + 0.1T+ 0.1C + 0.1R + 0.2H + 0.4E

The overall course grade G (10-point scale) includes results achieved by students in their practice activities P, written test T, credit C, research paper R, home assignment H, and exam E; it is rounded up to an integer number of points. The rounding procedure accounts for students’ practice activities during seminars.

V. Program Contents

Topic 1: Introduction to the “Enterprise Software Systems Development” course. Foundations of finite sequence theory (lambda calculus)

¨ Topic outline:

§ Definitions for an enterprise and for an information system

§ Information system lifecycle

§ Major software development methodologies

§ Survey of mathematical formalisms for modeling enterprise systems

§ Function in mathematics and in programming

§ Lambda calculus evolution

§ Typeless lambda calculus (A. Church): alphabet, axioms, deduction rules

§ Benefits of lambda calculus as a formal system

§ Lambda calculus as SML programming language model

¨ Main references/books/reading:

§ Barendregt H. P. The lambda calculus (revised edition), Studies in Logic, 103, North Holland, Amsterdam, 1984

§ Church A. The calculi of lambda-conversion.- Princeton, 1941, ed. 2, 1951

§ Sommerville I. Software Engineering (8th Edition). Pearson Education Ltd., 2008, 850 pp.

§ Schach S. R. Object-Oriented and Classical Software Engineering (5 ed.) McGraw-Hill, 2001, 744 pp.

§ Wadsworth C. P. Semantics and pragmatics of the l-calculus. PhD Thesis, University of Oxford, 1981

§ Wolfengagen V. E. Methods and Means for Computations with Objects. Applicative Computational Systems. 2004, Moscow, Jurinfor, — XVI+789 p. ISBN -0

¨ Additional references/books/reading:

§ Cousineau G., Curien P.-L., Mauny M. The categorical abstract machine. Science of Computer Programming 8(2): 173-202, 1987

§ Curry H. B., Feys binatory logic, vol. I, North Holland, Amsterdam, 1958

§ Fowler M. Patterns of Enterprise Application Architecture. Addison-Wesley, 2003. http://www. /articles/newMethodology. html

§ Strachey C. Fundamental Concepts in Programming Languages. Higher-Order and Symbolic Computation, Vol. 13, No 1/2, April 2000, p.11-49.

§ Scott D. S. Domains for denotational semantics. ICALP 1982, 577-613

Topic 2: Introduction to type theory

¨ Topic outline:

§ Types in mathematics and in programming

§ Combinator as a functional program object

§ Assigning type to combinators and functions

§ Basic and inherited types in SML programming language

§ Kinds of programming language type systems. Type-checking mechanism

§ Benefits of type-based models

¨ Main references/books/reading:

§ Barendregt H. P. The lambda calculus (revised edition), Studies in Logic, 103, North Holland, Amsterdam, 1984

§ Hindley J. R. The principal type-scheme of an object in combinatory logic. Trans. Amer. Math. Soc., 146:29-60, 1969

§ Wolfengagen V. E. Methods and Means for Computations with Objects. Applicative Computational Systems. 2004, Moscow, Jurinfor, — XVI+789 p. ISBN -0

¨ Additional references/books/reading:

§ Cook W., Hill W. L., Canning P. S. Inheritance is not subtyping. In: Proc. 17th ACM Symposium on Principles of Programming Langauges, Jan. 1990, p. p. 125-135

§ Hindley J. R. The principal type-scheme of an object in combinatory logic. Trans. Amer. Math. Soc., 146:29-60, 1969

§ Wolfengagen V. E. Categorical Abstract Machine. Conspectus: Introduction to Computations. 2002, Moscow, Jurinfor, 96 p. p. ISBN -7

Topic 3. Formal system of combinatory logic

¨ Topic outline:

§ Combinator definition

§ Combinatory logic as a formal system: alphabet, axioms, deduction rules

§ Combinator examlpes

§ Basis definition. Major bases of combinatory logic

§ Assigning types to combinators. Type inference

§ SML function examples for the basic combinators

¨ Main references/books/reading:

§ Barendregt H. P. The lambda calculus (revised edition), Studies in Logic, 103, North Holland, Amsterdam, 1984

§ Curry H. B., Feys binatory logic, vol. I, North Holland, Amsterdam, 1958

§ Hindley J. R., Seldin J. P. Introduction to combinators and l-calculus. London Mathematical Society Student Texts, 1, Cambridge University Press, 1986

¨ Additional references/books/reading:

§ Hindley J. R. The principal type-scheme of an object in combinatory logic. Trans. Amer. Math. Soc., 146:29-60, 1969

§ Wolfengagen V. binatory logic in putations with objects through examples and exercises, 2003, Moscow, Jurinfor, 334 p. ISBN -0.

§ Wolfengagen V. E. Categorical Abstract Machine. Conspectus: Introduction to Computations. 2002, Moscow, Jurinfor, 96 p. p. ISBN -7

§ Wolfengagen V. E. Methods and Means for Computations with Objects. Applicative Computational Systems. 2004, Moscow, Jurinfor, — XVI+789 p. ISBN -0

Topic 4. Foundations of category theory

¨ Topic outline:

§ The concept of a category

§ Foundations of categorical combinatory logic

§ The concept of an abstract machine

§ Category-based abstract machines and their applications

§ Ideal abstract machine examples

§ State-based abstract machines

§ P. Lendin’s SECD machine

§ The categorical abstract machine (CAM)

¨ Main references/books/reading:

§ Curry H. B., Feys binatory logic, vol. I, North Holland, Amsterdam, 1958

§ Cousineau G., Curien P.-L., Mauny M. The categorical abstract machine. Science of Computer Programming 8(2): 173-202, 1987

§ Hodges A. Alan Turing and the Turing machine. The universal Turing machine: a half-century survey, pp. 3-15, New York, 1988

¨ Additional references/books/reading:

§ Barendregt H. P. The lambda calculus (revised edition), Studies in Logic, 103, North Holland, Amsterdam, 1984

§ Church A. The calculi of lambda-conversion.- Princeton, 1941, ed. 2, 1951

§ Hughes R. J.M. Super combinators: a new implementation method for applicative languages. Proc. of the 1982 ACM Symposium on LISP and Functional Programming, Pittsburgh, 1982

§ Hindley J. R. The principal type-scheme of an object in combinatory logic. Trans. Amer. Math. Soc., 146:29-60, 1969

§ Hindley J. R., Seldin J. P. Introduction to combinators and l-calculus. London Mathematical Society Student Texts, 1, Cambridge University Press, 1986

§ Turing A. M. On computable numbers, with an application to the Entscheidungsproblem. Proc. of London Mathematical Society, ser.2, vol. 42 p. p. 230-265, 1936-7

§ Wolfengagen V. E. Categorical Abstract Machine. Conspectus: Introduction to Computations. 2002, Moscow, Jurinfor, 96 p. p. ISBN -7

§ Wolfengagen V. binatory logic in putations with objects through examples and exercises, 2003, Moscow, Jurinfor, 334 p. ISBN -0.

Topic 5. Object systems of variable domains

¨ Topic outline:

§ Function in mathematics and in programming

§ The concept of a domain

§ Foundations of D. Scott’s theory of computations

§ Lattice theory, a graphical interpretation of the theory of computations

¨ Main references/books/reading:

§ Scott D. S. Domains for denotational semantics. ICALP 1982, 577-613

§ Scott D. S. The lattice of flow diagrams.- Lecture Notes in Mathematics, 188, Symposium on Mathematics of Algorithmic Languages.- Springer-Verlag, 1971, p. p. 311-372

§ Stoy J. E. Denotational semantics: the Scott-Strachey approach to programming language theory. MIT Press, 1977

¨ Additional references/books/reading:

§ Barendregt H. P. The lambda calculus (revised edition), Studies in Logic, 103, North Holland, Amsterdam, 1984

§ Gordon M. J.C. The denotational description of programming languages. Springer-Verlag, 1979

§ Strachey C. Fundamental Concepts in Programming Languages. Higher-Order and Symbolic Computation, Vol. 13, No 1/2, April 2000, p.11-49.

§ Wadsworth C. P. Semantics and pragmatics of the l-calculus. PhD Thesis, University of Oxford, 1981

§ Wolfengagen V. binatory logic in putations with objects through examples and exercises, 2003, Moscow, Jurinfor, 334 p. ISBN -0.

§ Wolfengagen V. E. Categorical Abstract Machine. Conspectus: Introduction to Computations. 2002, Moscow, Jurinfor, 96 p. p. ISBN -7

Topic 6. Abstract machines for modeling object environment-based computations

¨ Topic outline:

§ Functional program translation into the CAM code

§ De Brujin’s notation for lambda term coding

§ Translating de Brujin’s codes into categorical combinatory logic terms

§ Syntax and semantics of CAM language instructions

§ CAM work cycle

§ Comparison of CAM virtual machine

¨ Main references/books/reading:

§ Curry H. B., Feys binatory logic, vol. I, North Holland, Amsterdam, 1958

§ Cousineau G., Curien P.-L., Mauny M. The categorical abstract machine. Science of Computer Programming 8(2): 173-202, 1987

§ Landin P. J. The mechanical evaluation of puter Journal, 6:308-320, January 1964