DOC PREVIEW
USC CSCI 599 - November2b

This preview shows page 1-2-16-17-18-34-35 out of 35 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 35 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 35 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 35 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 35 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 35 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 35 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 35 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 35 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Background informationMajor Verification TopicsArchitecture VerificationCommon architecture IssuesCommon architecture problemArchitecture RefinementRefinement pattern approachRefinement patternCompleteness assumptionSlide 10ExampleSlide 12Slide 13Slide 14Slide 15Architecture as TheoriesArchitecture stylesTranslation to LogicSlide 19MappingProvingCompositionproblem exampleSpecificationConcurrent System VerificationExternal SpecificationComposite internal specificationComposite module verificationComposite moduleSimple module specification verificationSimple module internal specsSlide 32DiscussionRelated worksGeneral discussionBackground information•Formal verification methods based on theorem proving techniques and model checking–to prove the absence of errors (in the formal model)–to reason about the behaviors of programs•No known generic software verification –Involves complicated proving–Generally cannot be easily and cost-effectively integrated to software and hardware development cyclesMajor Verification Topics•Specification Verification•Architecture Verification•General practical issuesArchitecture Verification•Correctness of architecture refinement–a methodology for the correct stepwise refinement of software architectures–using the approach of architecture refinement patterns that are correctness preserving and compositionalCommon architecture Issues•From abstract level to concrete level•Simple architecture: box - arrows, representing data component and connections•Large architecture: Hierarchical approachCommon architecture problem•Limited utility of architecture hierarchy results from the current level of informality•Ambiguity in architecture allows unintended interpretations. May cause erroneous interrepretationArchitecture Refinement•From a abstract architecture to a concrete (lower-level) architecture–lead to:•fewer architectural design errors•extensive and systematic reuse of design knowledge and proofsRefinement pattern approach•A pair architecture schemas (homogenous or heterogeneous)•proven to be relatively correct with respect to the given mapping schemaRefinement pattern•Requires a special correctness criterion–a special mapping between architectures–extensive translation:•the representation of components, interfaces, and connections•aggregated, decomposed, or eliminatedCompleteness assumption•Prove that a concrete architecture has all required properties–No new properties can be inferred from the concrete architecture •All components, interfaces, and connections intended to be true of the architecture at its level of detail–If a fact is not explicit in the architecture, assume that it is not intended to be trueCompleteness assumption•Standard way to proof relative correctness –show that the concrete specification logically implies the abstract specification under a given mapping–allow additional and specified behaviors, as long as the specified behavior is implemented–no guarantee that negative properties are preserved under refinement•Alternative:–faithful interpretation–hard and no general proof technique•Use preproved refinement patternsExample•Use only logical theories for simplicity•To show how to systematically and incrementally transform a abstract architecture to its lower-level form•Approach: combining small and local refinement to form the larger compositeExamplecharscodeLexical AnalyzerLexical ParserAnalyzer OptimizerCode Generatortoks ast astbindingsLexical ParserAnalyzer OptimizerastFrom simple dataflow to shared syntax tree:Example: abstract sub-architecture to concrete sub-architectureArchitecture as Theories•Architecture Styles–Operations & axioms•Translation to Logic–Patterns  logic (theory generation rules)•Mapping–Name mapping–Style mapping–Interpretation mappingArchitecture stylesDataflow style:Axioms example -- Every function must at least have one port:Translation to Logic•An instance of function declaration schema:–f: Functional_Style!Function [  op: t]•The underlying theory contains the same instance of first order sentences:Pattern of Abstract ArchitectureM: MODULE [ Pattern of Concrete ArchitectureMapping•Name mapping:–c | m–op | w•Style mapping:–Accepts (_, _) | Gets (_, _)–Connects (_, _, _) | Writes (_,_) ^ Reads(_,_)•Interpretation mapping = name + style mappingProving•Criterion–all intended to do–not intended to doComposition•Horizontal–compose instances of refinement patterns to form one large composite refinement•Vertical–most concrete architecture in a hierarchy is correct with respect to the most abstract–justified since faithful interpretation is transitiveproblem example•Concrete architecture 1–A  B (dataflow connection)•Concrete architecture 2–B  C (dataflow connection)•the composition of 1 and 2 is not faithful!–need new abstract dataflow from A to CSpecification•Correctness issue•Complete specification of program is in terms of hierarchical structure of module specifications•Module external specification are abstract, about module behavior •Module internal specifications are descriptions of internal implementationsConcurrent System Verification•Program is a set of events•Interpreted and verified with a formal proof system•Internal specification classified as composite or simple•Composite: composed of linked sub-modules, each with external and internal specificationExternal SpecificationExternal specification consist of three parts:•behavior: module delivers to the environment •provide: how modules synchronizes with the environment•require: synchronization cooperation the module expects from environmentComposite internal specificationInternal specification of a composite module associates events described in the external specification of the module with events described in the external specifications of the sub-modules.• Ports: a set of single direction communication channels between the module and its environment•Network link: sub module ports are connected together to form communication channelsComposite module verificationVerification of composite module:1. External behaviors of the sub-modules plus the network and interface links must imply the external behavior of composite module2. Provides and requires of the sub modules and composite module must be mutually supportive and complete.“mutual support: sub module


View Full Document

USC CSCI 599 - November2b

Documents in this Course
Week8_1

Week8_1

22 pages

Week2_b

Week2_b

10 pages

LECT6BW

LECT6BW

20 pages

LECT6BW

LECT6BW

20 pages

5

5

44 pages

12

12

15 pages

16

16

20 pages

Nima

Nima

8 pages

Week1

Week1

38 pages

Week11_c

Week11_c

30 pages

afsin

afsin

5 pages

October5b

October5b

43 pages

Week11_2

Week11_2

20 pages

final

final

2 pages

c-4

c-4

12 pages

0420

0420

3 pages

Week9_b

Week9_b

20 pages

S7Kriegel

S7Kriegel

21 pages

Week4_2

Week4_2

16 pages

sandpres

sandpres

21 pages

Week6_1

Week6_1

20 pages

4

4

33 pages

Week10_c

Week10_c

13 pages

fft

fft

18 pages

LECT7BW

LECT7BW

19 pages

24

24

15 pages

14

14

35 pages

Week9_c

Week9_c

24 pages

Week11_67

Week11_67

22 pages

Week1

Week1

37 pages

LECT3BW

LECT3BW

28 pages

Week8_c2

Week8_c2

19 pages

Week5_1

Week5_1

19 pages

LECT5BW

LECT5BW

24 pages

Week10_b

Week10_b

16 pages

Week11_1

Week11_1

43 pages

Week7_2

Week7_2

15 pages

Week5_b

Week5_b

19 pages

Week11_a

Week11_a

29 pages

LECT14BW

LECT14BW

24 pages

T7kriegel

T7kriegel

21 pages

0413

0413

2 pages

3

3

23 pages

C2-TSE

C2-TSE

16 pages

10_19_99

10_19_99

12 pages

s1and2-v2

s1and2-v2

37 pages

Week10_3

Week10_3

23 pages

jalal

jalal

6 pages

1

1

25 pages

T3Querys

T3Querys

47 pages

CS17

CS17

15 pages

porkaew

porkaew

20 pages

LECT4BW

LECT4BW

21 pages

Week10_1

Week10_1

25 pages

wavelet

wavelet

17 pages

October5a

October5a

22 pages

p289-korn

p289-korn

12 pages

2

2

33 pages

rose

rose

36 pages

9_7_99

9_7_99

18 pages

Week10_2

Week10_2

28 pages

Week7_3

Week7_3

37 pages

Load more
Download November2b
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view November2b and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view November2b 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?