ソフトウェア工学
Contents
1. 1997 2010 31 1 e context diagram DFD DFD 2010 32 1 DFD DFD e DFD gt a2. 2010 25 2010 26 1 gt 2 3 gt 4
3. SCC 2010 74 ni 2010 75
4. 20 R Pressman 2010 80 0 2010 81 DFD 1 a 022 2010 82
5. AND G OR 2010 39 es data dictionary DFD a b a b is equivalent to a b a D and alb a b either or a a optional al a 0 iterations of mt a n a m n m a a m ajn a n nm 1 110 6 6 2010 40 e DFD gt DFD mini spec
6. 2010 76 2 1 LIN 2010 7 2010 78
7. 20 R Pressman 2010 50 0 2010 51 DFD 1 6 2 FAR 2 a 2010
8. 1 1 25 9 pp 934 962 1984 2 DFD 1 1 5 2010 37 2010 38 2 DFD 2 mm
9. x gt 2010 ON NN 2010 g software engineering 1968 NATO software crisis software development methodology technique tool project management
10. y y 6 portability OS y y 2010 m software development who project gt what product gt how process am life cycle reduirements analysis EE maintenance system design external design prodram design internal design testing coding 2010 9 2010 10
11. STS 5 6 5 y A 2 B C 6 B C D 2010 69 2010 70 sa TR transactional decomposition y 1 e 9 STS TR 2010 71 a
12. IF THEN IF THEN 1 IF A THEN ee 8 IF OK THEN 2 ELSE OK 2 IF B THEN ELSE gt IE lt THEN END IF ELSE e IF THEN ELSE DO WHILE END IF ELSE END IF ELSE END IF EOF END IF END IF ELSE END IF END DO 2010 127 2010 128 s 3 x g g
13. file 4 entity e source e sink g semantics 2010 30 1
14. gt oe Me a 0 Me E 4 em 4 else 4 2010 11 1 system requirements requirements specification 2 requirements analysis system definition gt analyst functional system specification functional specification structured analysis 2010 12 3 system design external design de
15. ISBN 6 200 2000 2010 145 openFile readRecord searchBook a 3 amp inputKey prettyPrintBook 2010 146 1 amp define RECORD_NUM 2000 2 amp define FIELD_SIZE 201 amp typedef struct _BookRecord char yomilIFIELD_SIZE 7 c
16. 6 1 0 6 5 2 3 2010 86 1 d 2010 87 DFD 2 3 2 2010 88 2 a 5 2 b Og OE a OT
17. pluggable es E _ interface software architecture 2010 179 2010 180 e y y SW HW NW y y metrics y x risk management risk impact risk probability
18. 2010 17 2010 18 XP cont d 3 object oriented software development y gt spiral model incremental iterative 4 Agile software development XP extreme programming SCRUM Crystal manifesto gt Nn Boehm 1988 2010 19 gt
19. 3 0 x LOC 112 x 2 5 x 0 35 a COCOMO 2 0 a y GUI b x FP c x y FP 2010 188 1 EI external inputs a EO external outputs LE ei EIF external interface files logical files EQ external inquiries 2
20. 4 ge fan in fan out ft 2010 92 e module strength module cohesion gt 1 coincidental strength 1 3 1 2 6 2 logical strength 3 temporal strength 4 procedural strength 3 5 communication cohesion ds
21. instance sub class derived class 204 2010 203 2010 dynamic binding person 2010 205
22. mg correctness 1 2 partial correctness y axiomatic semantics inductive assertion method Floyd s Hoare logic Hoare theorem prover 2010 163 oc pre condition Y invariant B post condition co B Y P cw P B 10 y P y DbC design by contract 2010
23. int x x 2147483648 2147483647 boolean p p true false a type checking 1 2 int int 1 true int boolean gt type inference a C C Java ML 2010 170 2010 171 e software maintenance lt gt a corrective mainte
24. 1 T 1 1 1 A B 2010 79
25. 2010 159 e ADT abstract data type y operation encapsulation information hiding g algebraic specification y stack sort axioms Stack integer si Stack Zz Integer pop push z s s pop init stack error top push z s z top init stack error empty init true empty push z s false operators init Stack push integer X Stack gt Stack DOD Stack Stack toD Stack gt integer empty Stack gt bool 2010 160 Z a M4AME DATE NAME DATE BirthdayBook known P NAME birthday NAME DATE known dom birthday known
26. EIF ILF 30 48 84 44 65 105 gt 3 12 30 14 40 90 EQ SN EO 700 FP EI 2010 189 2010 190 3 0 1 2 3 4 5 0 65 Xx 0 01 x 28 0 182 FP 0 65 0 01 x 0 182 x 700 x FP 127 4 2010 191 se Gantt chart 2 3 4 EEEEEE 6 7 2 9 10 11 12 1 1 3 1 4 2 1 2 2 2 3 UI 2 4 2010 192 ge 1950 60
27. ISO9126 1 functionality gt 2 reliability y y 3 usability y y 2010 cont d 4 efficiency gt 5 maintainability
28. TR a 1 2 STS 3132 4 2 3 2 1 2 2 2 3 21 i NN C 2010 89 2010 90 r L SN x 2 c a 1 1 1 2 4 3 S 1 2 2 i 2 0 23 ET 2010 91 gt gt e gt
29. gt 4 12 Embrace Change Communication lt Simplicity Feedback Courage 2010 20 XP Cont d Planning Game Small Releases Metaphor Simple Design Testing Refactoring Pair Programming Collective Ownership Continuous Integration 10 40 40 Hour Week 11 On Site Customer 12 Coding Standards NSR OR NM 2010 21 2010 9 a MW 9 e e a 20
30. 6 informational strength 7 functional strength 2010 93 2010 94 4 7 4 5 es module coupling y 1 content couplin PP 2 common coupling 3 external coupling _ 6 7 4 control coupling 5 stamp coupling 6 data couplin
31. lt gt 1 Jackson 2 Warnier 2010 100 e 1 4 2 3 2010 101 a 1 b 1 c
32. 2010 41 2010 42 1 2 3 4 5 6 7 4 e mail 3 a b 2010 43 a La 2 e data
33. a 3 a sequence A B b selection if then else P A B c iteration do while P A a BOhm Jacopini gt 3 e proper program gt 1 1 gt 2010 121 2010 122 NS 2010 123 e flow chart gt e NS Nassi Shneiderman y 4 y
34. e reverse engineering y recovery e forward engineering eg restructuring y 2010 176 g software refactoring factoring gt y y e software reuse y a producer reuse
35. 2010 117 2010 118 Ji a 0 1 9 ii while f else gq system design specification y y gt gq NN design specification gt wm source program y 2010 119 e y structured programming Dijkstra 1 NS PAD 2 3 2010 120
36. s lt 2010 48 2010 49
37. b white box test gt x c code review y walk through gt inspection 2010 a 1 3 9 2 2a e g9 amku5ge 2b 1
38. 2010 105 2010 106 5 e 1 4 2 gt gt 2010 107 Yes 2010 108 1 mma am 2010
39. a 70 a 80 CASE computer aided software engineering 1986 90 CASE repository DFD cf library 90 CVS 2010 193 Eclipse e IDE Integrated Development Environment ni 2010 194 2010 195 e object y thing state beha
40. a DFD ER gt a gt a system design UI y s program design gt eg GUI graphical user interface y amp 2010 57 2010 58
41. risk control 2010 181 g product metrics gt s LOC lines of code NCNB non comment non blank LOC McCabe a resource metrics y a process metrics y gt CMM capability maturity model e SPICE Software process improvement and capability determination ISO9000 ISO9000 3 ISO9001 2010 182 e McCabe cyclomatic complexity CFG CFG
42. 3 2010 113 2010 114 1 s a e 1 NN 2010 115 2 m 2 2010 116 3 a 3
43. ER 2010 44 cont d e ER entity x relationship 2010 45 e cardinality 1 1 1 N M N 1 1 RE 4 aa ae e modality yl 2010 46 2010 47 e statechart diagram state event 1
44. I Object oriented g class a inheritance a UN dynamic binding 2010 201 2010 202 super class class attribute operation base class member variable instance variable member function method instantiation i ee a a
45. 148 2 b readRecord amp int readRecord FILE fp BookRecord bookTable intnum 7 num 0 while feof fb 7 if fscanf fp s s s Ys Yd Ys n bookTable num yomi bookTablelnuml author 6 7 nUm else DrintError Format error s n book Tablelnuml yomi 1 7 printf Total number of books d n num return num 2010 149 2 C searchBook amp Void searchBook BookRecord book int num Void InputKey char key char keyIFIELD_SIZE piintf Input Key n inti strcby key while 1 void prettyPrintBook BookRecord book InputKey key printf Pretty Print Books n 7 strcmp key 7 0 breaki printf n for i 0 i lt num
46. 2 a yy 2010 33 2010 34 1 DFD DFD 3 1 i 3 2 3 5 3 3 2010 35 2010 36 2 1 10 200 s s
47. 52 DFD 2 6 2 ID 6 5 2010 53 DFD 3 ID ID ID 6 2 2 2010 54 DFD 2 0 Rg 3 2 HH i 7 97 2010 55 2010 56
48. g logic algebra set tIheory formalization gt y y Z Z notation 2010 157 2010 1S8 s e gt x y lt integer x integer y x gt 0 gt 0 interger z divide z x divide z y Vw integer w divide w x divide w y 2z lt gt w divide a 5 5 a gcd x gcd x y gcg r y mod x gcd x mod y y gcd x y gcd y x gcd x 0 gcd 0 x a mod 5 ga 5
49. cause effect graph decision table e g PDL program description languade 1 1 1 1 1 1 1 1 2 1 1 2 1 1 1 2 2 1 1 3 1 1 4 ga use case Jacobson actor role beneficiary scenario
50. y error 2010 135 es _ 2010 136 a e g g g unit test a block box test gt gt
51. es gt 2010 e 1960 1970 1980 1990 2000 2010
52. ffunctional decomposition y 1 ll STS TR 2010 72 Cont d 2010 73 a
53. if Strcmp booklil yomi key strlen key 0 prettyPrintBook book i printf 2010 150 3 amp void InputKey char key void prettyPrintBook BookRecord book char key print s nm book yom printf s m book author 7 printf gt scanf s key void printError char msg char str int no while strlen key gt FIELD_SIZE 7 fprintf stderr msg str 7 printError Invalid input key s n key 0 0 if no 0 exit no printf gt scanf s key 2010 151 wme readrecord searchBoot 2010 152 a Ssystem test
54. 164 1 1 1 IM eo x e c e a 4 x e c y a Pi B BB P2 9 oa Pi P2 ty 2010 165 2 3 AO Pi Bj ta Q P2 1Bj aiifQ then Pi else P2 B AAQ PCS fa while Q do P a A Q 2010 166 assertion Wa a b a a b lt c d 20Ax ml gt 0 Ei nl x 1 1 gt 0Ax SH ml x GG 1 loop invariant d b 7 gt 0 d 7 7 1 gt 0 7 1 7 e x n b n x x Ol x 2010 167 6 2 n lee t S1 X 92 while t gt 0 Sa C2 x 1 3 0 54 W t while t gt 0 do C2 x return X P x t C1 x WO P 0 n n in gt OiPx tix nl n 0 P x n
55. 2010 168 7 0 Pe Dirx nl 20A1 C x DWE OD irit n l A t O 1 0A1 C7 DD OE WE DD ix rikH nl At gt 0 t gt O0 gt in gt 0 l n nl S1 X S20 16 8 whilet gt 0 do C2 x 1 xi nl At gt 0 f gt O0 gt in gt 0A l n nl S1 x oy a S21 pb bB whilet gt 0doC2 x 1 x i nl At gt 0 gt O0 gt in gt 0 Al n nltx lia ia t n ib 1 At gt 0 C2 x Hix i nl At gt 0O0 gt in gt 0Al nl nlkx lin gt 0Axrn nll in gt 0 A x nl n t nix nl ft gt 0O0 x ikl nl At gt 0 53 x S41 x itl n l A t gt 0O0 gt in gt 0Al nl nlkx lin gt 0Axrn nll in gt 0 A x nl nll t nix nl ft gt 0 rill nl At gt 0 53 x 924 12 94200 ix i nl A t gt 0 10A1 xx 1 1 0A xx nll in gt 0 A x nl n t nix nl ft gt 0 x nl gt Ot x x tiyh t t 1 n At gt 0O0 gt in gt 0Al nl nlkx lin gt 0Axrn nll in gt 0 A x nl nll t nix nl ft gt 0O0 1 7 0 x x ti 1 gt 01 1 t gt Ot t 1 i i n l At gt 0 2010 169 a type
56. vs consumer reuse b black box reuse vs white box reuse c compositional reuse Ln es mi VS generative reuse 3 d vertical reuse vs horizontal reuse 2010 177 2010 178 Bg component Lr Li
57. DFD 1 ID ID ID i ID 2010 83 1 a es SS 2010 84 1 b 6 3 1 051 6 3 2 6 5 2 2010 85 1 c 6 2 1 6 2 2 6 2 3 6 3 1 6 5 1
58. lt module 1 2 3 2010 59 es 8 Myers y Dijkstra e 8 y Jackson Warnierl eg e DbC Design by Contract Meyer client supplier assertion 2010 60 a structured design
59. control flow graph for int J Nn J for int i if datali int k al i l 4 LOC 9 10 2010 183 CMM 5 Optimizing it 1 Me initial 2010 184 e gt e a COCOMO Constructive Cost Model Boehml a COCOMO 2 0
60. 109 2 m mmmm gt 2010 110 3 mmjmamas 2010 111 2010 112 g gt 1 2 1 2 1 1
61. composite design abstraction e system design specification 1 module structure diagram 2 module function specification 3 module interface specification 2010 61 a abstraction lt information hiding a procedure abstraction b data abstraction gt encapsulation c control abstraction 3 gt 5 ee
62. a5 2010 A B C A N C C A fan out 0 B C A A B C 1 y KN 2 en fan in 2010 63 2010 64 Constantine 1 2 3 1 STS 2 TR 3 20
63. IPT gt 1 divide and conquer module 2 stepwise refinement 3 3 sequence selection iteration 2010 6 software test tester module test unit test integration test system test function test shipping test acceptance test y test report error fault debug
64. C int fact 1 1 for Tl 1 lt n 1 fact i fact C Int fact int n 1 if n 0 return 1 return n fact n 1 a ct Lisp fact x x 0 then 1 DEFUN fact N elsex x fact x 1 COND ZEROP N 1 T TIMES N FACT SUB1 N e x Prolog fact 0 1 fact 0 1 fact x y sub x L w fact X Y sub X 1 W A fact w z times x fact W Z times Z Y fact 3 y fact 3 Y 2010 133 2010 134 RR test case test suite Ei3 a 0 while if else g failure x fault defect
65. e 9 xy9 jdsi5enjcd abcdef 123456 2010 a 1 1 64 2 0 1 2 63 64 65 2010 139 1 e statement coverage CO coverage gt 1 P or Q R abcdgh coverage e edge coverage C1 coverage gt 1 P or Q R abcdf P or Q R abcdgh P or Q R abef P or Q R abegh coverage 2010 140 2 e condition coverage gt 1 e 9 P Q P Q
66. C R require M mask a Cr E V c C C gt E nn f E 7 1 O d C C2 gt E7 E exclusive V I include O only one 2010 155 2 decision table i Cy C2 100 2 0 C O C x xlxlxlO 5 100 2 gs0 lt 9 9 e 9 1 200 200 ODE OlIxX 1lx OO xX DD 2010 156
67. test plan a function test gt g 1 CEG cause effect graph 639 g b performance test 100 100 et kg wm stress test volume test 20 s0 configuration test compatibility test Y mw security test timing test NA TT a environment test quality test gt recovery test maintenance test A documentation test usability test g 2010 153 2010 154 e R M ki b
68. y b c d if then else do while do untll 2010 124 NS MORE DATA ON DOWHILE MORE DATA ON EOF MORE DATA OFF MORE DATA ON PAD e PAD problem analysis diagram gt 2 6e d GPD Structured programming diagram HCP hierarchical and compact description chart YACII yet another control chart II a b if then else c do while d do until pHA 2010 125 2010 126 EOF mw PDL program description language DO WHILE _ IF NOT EOF THEN
69. or P Q or 2010 141 3 e path coverage gt 1 e g abcdgh abcdfcdgh abegh abefegh abcdfegh coverage 2010 142 a integration test a bottom up test y y y b top down test gt gt gt c mixed integration sandwich test gt d big bang
70. 7 software maintenance CE customer engineer 2010 e waterfall model verify review cf validate a 1960 fowchart a 1970 a 1980 paradigm 1 software prototyping prototype 2 operational approach executable specification
71. 2010 g Software gt JIS X0001 gt hardware GUI ORB Object Request Broker OS 2010 sa y y y
72. FP ag FP function point y gt 2010 A X A 10 10 0 15 90 25 0 40 70 260 A X A B C a 2010 COCOMO Putnam COCOMO LOC 1 10 100 s COCOMO g COCOMO es COCOMO 2010 187 COCOMO contd e COCOMO a b c
73. gt 2010 27 s gt DFD data flow diagram data dictionary y e ER entity relationship diagram eg gt state transition diagram gt 2010 28 e event cf flowchart 2010 29 cont d a syntax 4 1 flow 2 process bubble 3 data store
74. 10 23 cont d g a y y b c 2010 24 e 1 a SA structured analysis b use case scenario 2 3 4
75. 10 65 g STS Source Transform Sink decomposition gt 5 2010 66 STS 1 2 1 3 10 O00 0 2 O00 08 2010 67 STS 3 3 gt 0600000 2010 68 STS 4 4
76. birthday 4 4 AddBirthdayBook ABirthdayBook name NAME date DATE name known birthday birthday WU name gt date known dom birthday g 2 2010 schema InitBirthdayBook BirthdayBook known FindBirthday SBirthdayBook name NAME date DATE name known date birthday name 161 e verification amp validation a model checking temporal logic formula safety liveness review b Hoare 2010 162 e
77. d 1 2010 102 10001 10001 10002 S 630401 100 10002 10002 2010 103 gt 630401 30 630401 100 630402 50 2010 104 NR e 1 3 o 1
78. g 7 2010 95 2010 96 1 3 1 2 3 A B 2010 97 4 6 4 A 5 6 2010 98 g e 2 A x C A D A 2010 99 e gt gt
79. har authorlFIELD_SIZE 7 FILE openFile stub BookRecordi printf Open File n retun NULL main BookRecord bookTable RECORD_NUM int readRecord FILE fp BookRecord bookTable FILE fp intnum printf Read Records fn return 0 Void searchBook BookRecord book int num fp openFile num readRecord fp bookTable fclose fp searchBook book num printf Retrieve Books n 2010 147 2 a openFile amp Oefine FILENAME_SIZE 101 void printError char msd char str int no FILE openFile prinff Error n char flename FILENAME_SIZE 7 FILE fp 7 print gt 7 scanf s flename 7 if fp fopen filename NULL 7 printError Cannot open flle s n filename 1 return fp 2010
80. nance b adaptive maintenance c perfective maintenance d preventive maintenance 4 Lientz and Swanson 1981 2010 172 em configuration manasgement version release e impact analysis a regression test y gt ge program slicing y s slice
81. odgrams algorithms data structures Virth 1976 algorithm logic control IKowalski 1979 2010 131 g procedural programming y Fortran COBOL Algol BASIC PL I Pascal C Ada g functional programmin9g y Lisp lambda calculus Scheme ML g logic programming y Prolog resolution principle g object oriented programming gt RE Smalltalk C Java C g aspect oriented programming y cross cutting concern weaving AspectJ Hyper J DemeterJ adaptive programming 2010 132 m
82. ormation hiding data abstraction 2010 197 2010 198 struct i 85 G1 student void print b1 struct 1 52 Staff 1 void Drint gt 52 2 a else if void print 1 2010 199 2010 200 interface s type
83. oto y gt y s gt indentation y 2010 129 C Pascal COBOL Fortran Ritchie 1972 Wirth 1970 1959 Backus 1955 IF p THEN A ELSE ifp then A else i B END IF IF p GOTO 20 while p while p do PERFORM A A A A UNTIL NOT p GO TO 10 CONTINUE CONTINUE A IF p GO TO 20 GO TO 10 repeat PERFORM A A PERFORM A until p UNTIL p 2010 130 e programmin9g e programming paradigm gt gt pr
84. signer module interface system design specification external design specification 4 program design internal design detailed design gt programmer program design specification logic design specification structured design 2010 5 coding gt coder program language source program structured programmin9 3 2010 e structured programming IBM
85. test gt 2010 143 2010 144 100 ISBN 1
86. vior identity eg object oriented gt y e OO software development gt OOA OO analysis gt OOD OO design OOP OO programming 2010 196 cont d function object Object based a message passing method invocation e modularization cohesion coupling e encapsulation inf
87. y backward slice forward slice static slice dynamic slice 2010 173 2010 174 a data dependence Y a a if a lt 0 1 control dependence b 10 b 10 if int func int data 1n sum 0 int prod 5 int 1 0 while 1 lt data length Sum Sum data 1 prod prod datalils ep int func int data int sum 0 int i while 1 lt data length sum datalil 1 3 3 4 5 6 F 8 9 ww O NO OO pp WW DD 6 sum 2010 175 e software reengineering
Download Pdf Manuals
Related Search