Presentation is loading. Please wait.

Presentation is loading. Please wait.

GAP- Generating Access Permissions IJAZ AHMED advised by : NESTOR CATANO

Published byLouise Preston Modified over 9 years ago

Similar presentations

Presentation on theme: "GAP- Generating Access Permissions IJAZ AHMED advised by : NESTOR CATANO"— Presentation transcript:

1 GAP- Generating Access Permissions IJAZ AHMED advised by : NESTOR CATANO http://www3.uma.pt/ncatano/aeminium/GAP.html

2 GAP  It takes a Java program and generates the likely access permissions  It implements a modular and static analysis of Java programs.  How it Works?  It extracts the read, write and alias information from a Java source code through AST  It generates a graph for every method that shows read, write and alias information  It traverses the graph and gathers likely information  It works in two mode i.e. Read mode and Write mode  An implementation of the algorithm as an Eclipse plug-in is on way http://www3.uma.pt/ncatano/aeminium/GAP.html

3 General Idea http://www3.uma.pt/ncatano/aeminium/GAP.html

4 Notations, Terminology and Concepts  Method Node  an abstraction to represent method local environment  Context Node  an abstraction to represent external world/other references  Reference Nodes  class fields, parameters, local variables  Object Nodes  represent physical memory of objects  Edges  Read Edge  Write Edge  Pointe Edge http://www3.uma.pt/ncatano/aeminium/GAP.html

5 Some Rules http://www3.uma.pt/ncatano/aeminium/GAP.html  General Idea  To represent the read, write and alias information with edges  Check the types of edges and number of Pointe’ edges to define access Permissions  Types of Rules  Graph Construction Rules  Pre Access Permissions Rules (Graph Traversal)  Post Access Permission Rules (Graph Traversal)

6 An Example- JAVA Program public class B{ int a; } public class A { B x,y,r; public Object method1(B z, Bw ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } http://www3.uma.pt/ncatano/aeminium/GAP.html

7 High Level Algorithm Make the set Z = {Fields} U {Parameters} Make the set M= object of set Z Make the set U = Z U M U { method, Context} Step 1- Create nodes for all items in set U Step 2- Apply the Pointe-Rule for elements in set Z and set M Step 3-Apply the rule Context-R if you are in mode R, otherwise apply rule Context-RW if you are in mode RW. public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y

8 High Level Algorithm Make the set Z = {Fields} U {Parameters} Make the set M= object of set Z Make the set U = Z U M U { method, Context} Step 1- Create nodes for all items in set U Step 2- Apply the Pointe-Rule for elements in set Z and set M Step 3-Apply the rule Context-R if you are in mode R, otherwise apply rule Context-RW if you are in mode RW. public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y P P PP

9 High Level Algorithm Make the set Z = {Fields} U {Parameters} Make the set M= object of set Z Make the set U = Z U M U { method, Context} Step 1- Create nodes for all items in set U Step 2- Apply the Pointe-Rule for elements in set Z and set M Step 3-Apply the rule Context-R if you are in mode R, otherwise apply rule Context-RW if you are in mode RW. public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R P P PP

10 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R P PP High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. P

11 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R P PP High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. P

12 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R P PP High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. P

13 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R P PP High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. t t P P

14 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R P PP High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. t t P P

15 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R PP High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. t t P P

16 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R PP High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. t t P P

17 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R PP High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. t t P w P

18 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R PP High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. t t P w P

19 High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R PP t t P w R P

20 public class A { B x,y,r; public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R PP t t P w R P

21 public class A { B x,y,r; full(x), full(y),full(z),Immutable(w)  public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R PP t t P w R P

22 High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. public class A { B x,y,r; full(x), full(y),full(z),Immutable(w)  public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R PP t t P w R P

23 High Level Algorithm Step 4-For every statement s in the method body, apply a graph construction rule according to the syntax of s. Step 5-Generate Pre-Permissions by applying Pre-Traversal Rules for items in set Z Step 6-Generate Post-Permissions by applying Post-Traversal Rules for items in set Z. public class A { B x,y,r; full(x), full(y),full(z),Immutable(w)  Immutable(x), Immutable(y) public Object method1(B z, B w ){ x=w; Object t=x; y=t; z.a=15; System.print.out(x.a+w.a+t.a); return y; } Analysis of method1 http://www3.uma.pt/ncatano/aeminium/GAP.html z z w w x_object y_object w_object z_object x x method 1 context y y R R R R PP t t P w R P

24 Conclusion http://www3.uma.pt/ncatano/aeminium/GAP.html  Present Status  Can generate access permission for simple program  Tested with some examples  Under development  Future Work  Parser require further iterations to parse complex program  Mapping of GAP Specifications with Plural Syntax  Planning to run GAP on the MTTS application as a bench mark  Integrate as an Eclipse plug-in with Plural  Link  http://www3.uma.pt/ncatano/aeminium/GAP.html

Download ppt "GAP- Generating Access Permissions IJAZ AHMED advised by : NESTOR CATANO"

Similar presentations

Advanced XSLT. Branching in XSLT XSLT is functional programming –The program evaluates a function –The function transforms one structure into another.

Advanced XSLT. Branching in XSLT XSLT is functional programming –The program evaluates a function –The function transforms one structure into another.
CPSC 388 – Compiler Design and Construction

CPSC 388 – Compiler Design and Construction
Debugging Natural Semantics Specifications Adrian Pop and Peter Fritzson Programming Environment Laboratory Department of Computer and Information Science.

Debugging Natural Semantics Specifications Adrian Pop and Peter Fritzson Programming Environment Laboratory Department of Computer and Information Science.
Semantics Static semantics Dynamic semantics attribute grammars

Semantics Static semantics Dynamic semantics attribute grammars
1 Structures. 2 User-Defined Types C provides facilities to define one’s own types. These may be a composite of basic types ( int, double, etc) and other.

1 Structures. 2 User-Defined Types C provides facilities to define one’s own types. These may be a composite of basic types ( int, double, etc) and other.
Linked Lists. 2 Merge Sorted Lists Write an algorithm that merges two sorted linked lists The function should return a pointer to a single combined list.

Linked Lists. 2 Merge Sorted Lists Write an algorithm that merges two sorted linked lists The function should return a pointer to a single combined list.
Programming Paradigms Introduction. 6/15/2005 Copyright 2005, by the authors of these slides, and Ateneo de Manila University. All rights reserved. L1:

Programming Paradigms Introduction. 6/15/2005 Copyright 2005, by the authors of these slides, and Ateneo de Manila University. All rights reserved. L1:
Winter 2007-2008 Compiler Construction T7 – semantic analysis part II type-checking Mooly Sagiv and Roman Manevich School of Computer Science Tel-Aviv.

Winter Compiler Construction T7 – semantic analysis part II type-checking Mooly Sagiv and Roman Manevich School of Computer Science Tel-Aviv.
Fluid Eclipse Summer Work Issues, Lessons Learned, Way Ahead.

Fluid Eclipse Summer Work Issues, Lessons Learned, Way Ahead.
Chapter 3: Abstract Data Types Lists, Stacks Lydia Sinapova, Simpson College Mark Allen Weiss: Data Structures and Algorithm Analysis in Java.

Chapter 3: Abstract Data Types Lists, Stacks Lydia Sinapova, Simpson College Mark Allen Weiss: Data Structures and Algorithm Analysis in Java.
Fall 20021 Semantics Juan Carlos Guzmán CS 3123 Programming Languages Concepts Southern Polytechnic State University.

Fall Semantics Juan Carlos Guzmán CS 3123 Programming Languages Concepts Southern Polytechnic State University.
Building New SOA and AJAX- Based Business Applications Mark Barnard R&D Manager – Natural Business Services Software AG (Canada) Inc.

Building New SOA and AJAX- Based Business Applications Mark Barnard R&D Manager – Natural Business Services Software AG (Canada) Inc.
Interpreter for ZOOM-I Andrew Deren Initial Presentation - SE690 5/30/03

Interpreter for ZOOM-I Andrew Deren Initial Presentation - SE690 5/30/03
C. Varela; Adapted w/permission from S. Haridi and P. Van Roy1 Declarative Computation Model Defining practical programming languages Carlos Varela RPI.

C. Varela; Adapted w/permission from S. Haridi and P. Van Roy1 Declarative Computation Model Defining practical programming languages Carlos Varela RPI.
1 Semantic Processing. 2 Contents Introduction Introduction A Simple Compiler A Simple Compiler Scanning – Theory and Practice Scanning – Theory and Practice.

1 Semantic Processing. 2 Contents Introduction Introduction A Simple Compiler A Simple Compiler Scanning – Theory and Practice Scanning – Theory and Practice.
Memories of Bug Fixes Sunghun Kim, Kai Pan, and E. James Whitehead Jr., University of California, Santa Cruz Presented By Gleneesha Johnson CMSC 838P,

Memories of Bug Fixes Sunghun Kim, Kai Pan, and E. James Whitehead Jr., University of California, Santa Cruz Presented By Gleneesha Johnson CMSC 838P,
CS 330 Programming Languages 09 / 18 / 2007 Instructor: Michael Eckmann.

CS 330 Programming Languages 09 / 18 / 2007 Instructor: Michael Eckmann.
1 Control Flow Analysis Mooly Sagiv Tel Aviv University 640-6706 Textbook Chapter 3

1 Control Flow Analysis Mooly Sagiv Tel Aviv University Textbook Chapter 3
Memory Management A memory manager should take care of allocating memory when needed by programs release memory that is no longer used to the heap. Memory.

Memory Management A memory manager should take care of allocating memory when needed by programs release memory that is no longer used to the heap. Memory.
Compiler Summary Mooly Sagiv html://www.math.tau.ac.il/~msagiv/courses/wcc03.html.

Compiler Summary Mooly Sagiv html://

Similar presentations

Ads by Google