lecture-04-Ch05-FiniteModels-3

lecture-04-Ch05-FiniteModels-3 - Lecture 4 - Finite Models...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 4 - Finite Models Spring 2010 CSci 5802 1 CSci 5802 Software Engineering II 1 Spring 2010 CSci 5802 Finite Models Chapter 5 ht Goals for Today Understand goals and implications of finite state abstraction Learn how to model program control flow with graphs tp://www.umsec.umn.edu Spring 2010 CSci 5802 2 Learn how to model the software system structure with call graphs Learn how to model finite state behavior with finite state machines Properties of Models Compact : representable and manipulable in a reasonably compact form What is reasonably compact depends largely on how the model will be used Predictive : must represent some salient characteristics of the modeled artifact well enough to distinguish between good and bad outcomes of analysis Spring 2010 CSci 5802 3 no single model represents all characteristics well enough to be useful for all kinds of analysis Semantically meaningful : it is usually necessary to interpret analysis results in a way that permits diagnosis of the causes of failure Sufficiently general : models intended for analysis of some important characteristic must be general enough for practical use in the intended domain of application
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 4 - Finite Models Spring 2010 CSci 5802 2 Graph Representations: directed graphs •D i rec ted g raph : –N ( s e t o f n o d e s ) – E (relation on the set of nodes ) edges CSci 5802 Ch 5, slide 4 Nodes: {a, b, c} Edges: {(a,b), (a, c), (c, a)} a b c b a c Graph Representations: labels and code • We can label nodes with the names or descriptions of the entities they represent. – If nodes a and b represent program regions containing assignment statements, we might draw the two nodes and an edge (a,b) connecting them in this way: CSci 5802 Ch 5, slide 5 x = y + z; a = f(x); Multidimensional Graph Representations
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/21/2011 for the course CSCI 5802 taught by Professor Heimdahl,m during the Spring '08 term at Minnesota.

Page1 / 7

lecture-04-Ch05-FiniteModels-3 - Lecture 4 - Finite Models...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online