7. Constraint-based Analysis. Flashcards

1
Q

Benefits of Constraint based analysis

A

Separates analysis specification from implementation
Analysis writer can focus on what rather than how
Yields natural program specification
Enables sophisticated analysis implementations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What does the user need to decide when using constraint based analysis?

A

Specification, not implementation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Datalog

A

declarative logic programming language
not turing complete
subset of prolog or sql

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Datalog Program, what needs to be defined at a high level?

A

Input relations = form of input to program
Output relations = form of output to program
Rules = rules of inference that compute the input from output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Reaching Definitions Analysis

A
OUT[n] = (IN[n]-KILL[n]) U GEN[n]
IN[n] = U OUT[n'] where n' is predecessor n
How well did you know this?
1
Not at all
2
3
4
5
Perfectly