A seminar on relationship between discrete mathematics and software engineering

1. BY
Ram Kumar K R(1RV11IS042)
Ganesh Arkalgud(1RV11IS021)

2. What is Software Engineering?
 Definition:
Software engineering (SE) is the application of a
systematic, disciplined, quantifiable approach to the
design, development, operation, and maintenance of
software, and the study of these approaches; that is,
the application of engineering to software.
 Software Development.
 Software Engineering Problem.
 Uses.
 Tools.
2

3. Procedures in Software Engineering
1. Specification.
2. Design.
3. Analysis.
4. Implementation.
5. Verification.
3

4. Definitions in Software Engineering
 Specification.
 Declarative languages.
 Specification analysis.
 Formal verification.
 Mechanical proofs.
 Static analysis.
 Program reification.
4

5. Important Definitions in DMS
 Propositional logic.
 Predicates.
 Sets.
 Relations.
 Sequences.
 Functions.
 Proof methods.
5

6. Basis Path Testing
Type of Software Testing Technique
First, we compute the cyclomatic
complexity:
number of simple decisions + 1
or
number of enclosed areas + 1
In this case, V(G) = 4

7. Flow Graph
7
1
2
0
3
4
5
6
7 8
9
10
11
1
2
3
6 4
R1
R2
7 8 5
9
11 10
R3
R4
FLOW CHART FLOW GRAPH
0

8. Flow Graph Example
3
4
5
6
7
16
17
8
9
11
12
14
15
10
13
1 int functionY(void)
2 {
3 int x = 0;
4 int y = 19;
5 A: x++;
6 if (x > 999)
7 goto D;
8 if (x % 11 == 0)
9 goto B;
10 else goto A;
11 B: if (x % y == 0)
12 goto C;
13 else goto A;
14 C: printf("%dn", x);
15 goto A;
16 D: printf("End of listn");
17 return 0;
18 }

9. Cyclomatic Complexity
V(G)
modules
modules in this range are
more error prone

10. Graph Matrices
 A graph matrix is a square matrix whose size (i.e., number of rows
and columns) is equal to the number of nodes on a flow graph.
 Each row and column corresponds to an identified node, and matrix
entries correspond to connections (an edge) between nodes.
 By adding a link weight to each matrix entry, the graph matrix can
become a powerful tool for evaluating program control structure
during testing

11. CURRENT ISSUES
 Productivity
 Accuracy
 Cloud Computing
 Synchronization
 Robust nature
 Multilinguality
 Efficiency
11

12. REFERENCES
 Connecting Discrete Mathematics and Software Engineering by
James P. Cohoon and John C. Knight.
 Software Engineering by Lawrence C Paulson.
 Mathematical Reasoning in Software Engineering Education
by Peter B. Henderson and Butler University.
 Current Issues in Software Engineering for Natural Language
Processing by Jochen L. Leidner
12

13. Thank you
13