Lyee Methodology Mohamed Mejri & Bchir Ktari Computer Science - - PowerPoint PPT Presentation

lyee methodology
SMART_READER_LITE
LIVE PREVIEW

Lyee Methodology Mohamed Mejri & Bchir Ktari Computer Science - - PowerPoint PPT Presentation

Lyee Methodology Mohamed Mejri & Bchir Ktari Computer Science Department Laval University Quebec Canada Agenda Introduction Expertise Projects Interest Collaboration Conclusion Introduction Expertise


slide-1
SLIDE 1

Lyee Methodology

Mohamed Mejri & Béchir Ktari Computer Science Department Laval University Quebec Canada

slide-2
SLIDE 2

Agenda

Introduction Expertise

Projects Interest

Collaboration Conclusion

slide-3
SLIDE 3

Introduction

slide-4
SLIDE 4

Expertise

Languages, Semantics and Formal Methods Static and dynamic analysis of code Advanced compilation techniques:

Certified Compilation Typing etc.

Computer Security

Specification and analysis of cryptographic

protocols and e-commerce protocols

Malicious code detection

slide-5
SLIDE 5

Network Level Application Level Correct cryptographic protocols Dynamic analysis / Monitoring

Projects

Static analysis Self-certified code Correct e-commerce protocols Intrusion Detection

slide-6
SLIDE 6

Projects: Dymna

Dymna (cryptographic and e-commerce protocols

analysis)

Theory: logic, typing system, model-checking, abstract

interpretation, rewriting, etc.

Practice: A tool delivered to CSE (Canadian Security

Establishment)

Distinctions: Many articles in international conferences

and Journal

Collaboration: Standfort University (John Mitchel)

slide-7
SLIDE 7

Dymna Inputs

slide-8
SLIDE 8

Dymna Outputs

slide-9
SLIDE 9

Projects: MaliCOTS

MaliCOTS (Detection of Malicious Code)

Theory: logic, semantics, model-checking, certified

compilation, static and dynamic analysis, etc.

Practice: Three tools delivered to CRDV Distinctions:

Thee Canadian prices:TechnoFed’2000, OCTAS’2001 et

CIPA’2001

Many technical reports and articles

Collaboration: Research Center CRDV.

slide-10
SLIDE 10

MaliCOTS: Security Policy

Never do send after read(f).

Automata

start

read(f)

has_read

send() read(f)

– Logic (µ-calculus) Always( [ read(f) ] never( do( send ) ) )

bad

send()

νX.[read(f)](¬µY.<send>tt ∨ <all>Y) ∧ [all]X

slide-11
SLIDE 11

MaliCOTS: SPCheck

slide-12
SLIDE 12

MaliCOTS: SPCheck

slide-13
SLIDE 13

Interest

Software Engineering:

Formal methods used to:

Specify, Implement, and Verify a software.

Programming Languages:

Syntax, semantics Different paradigms: procedural, functional, parallel,

  • bject oriented, etc.

Compilation Techniques:

Proof Carrying Code, etc.

Computer Security

slide-14
SLIDE 14

Collaboration

slide-15
SLIDE 15

Collaboration

A deep Studying of the Lyee Methodology:

Compare Lyee with other methodologies Identify more beneficial features of Lyee methodology Identifying some sub-projects in order to

Formalize, simplify, or/and ameliorate (if

necessarily) some aspects of the methodology to make it more user-friendly

Develop some new modules for LyeeAll to address

  • ther important aspects that are not handled yet
slide-16
SLIDE 16

Collaboration

Evaluate the methodology at different aspects

Suitable for modularity: develop complex system

from small and simple ones

Suitable for hierarchical description: allows both

low level and high level description

Suitable for formal validation and verification

A proof that the program complies with security policies

Easiness to learn and use: requirement skills of

the users

Suitable for which kind of application Suitable for maintenance: Y2K problem Etc.

slide-17
SLIDE 17

Collaboration

Program (Any Language) Legacy Lyee Structures LyeeAll Requirements (words, definitions conditions) LyeeBelt Program (Any Language)

slide-18
SLIDE 18

Collaboration

Program (Any Language) Legacy Lyee Structures LyeeAll Requirements (words, definitions conditions) LyeeBelt Program (Any Language) LyeeParallel Parallel Program

Project I

slide-19
SLIDE 19

Collaboration

PVM (Parallel Virual Machine)

P= P

1||

…|| P

n

PVM PVM PVM PVM PVM PVM P

1

P

2

P

3

P

4

P

4

P

n

Network

LyeeParallel Lyee Structures

slide-20
SLIDE 20

Collaboration

Program (Any Language) Legacy Lyee Structures LyeeAll Requirements (words, definitions conditions) LyeeBelt Program (Any Language) LyeeOptimizer Optimized Program

Project 2

slide-21
SLIDE 21

Collaboration

Program LyeeOptimizer Optimized Program

E= D+ 2* C D= C+ A+ B C= A+ B B= 2* A A= 1 A= 1 B= 2* A C= A+ B D= C+ A+ B E= D+ 2* C

Begin Iterate Begin Iterate

slide-22
SLIDE 22

Collaboration

Program (Any Language) Legacy Lyee Structures LyeeAll Requirements (words, definitions conditions) LyeeBelt Program (Any Language) LyeeVerifier Reports

Project 3

Business Policies

slide-23
SLIDE 23

Collaboration

Program (Any Language) Legacy Lyee Structures LyeeAll Requirements (words, definitions conditions) LyeeBelt Program (Any Language) LyeeAnalyser

(Equivalence, Profiling, etc.)

Reports

Project 4

slide-24
SLIDE 24

Collaboration

State of the art

Studying Evaluate

LyeeParallel Etc.

I dentifying sub-projects

Compare

LyeeOptimizer LyeeVerifier LyeeAnalyzer

slide-25
SLIDE 25

Collaboration

Contributions

Theoretical aspects: Articles, Conferences, etc. Practical aspects: Tools, prototypes, etc. Documentation: Technical reports , etc. Scientific exchanges : Meeting, seminaries,

presentations, etc.

High qualified students

A working group on Lyee Methodology

slide-26
SLIDE 26

Conclusion

Lyee Methodology

Our feeling

Toward a promising methodology: Good ideas behind the

methodology

A lot of works are need to be done to show the power of

this methodology

Collaboration

We are motivated to participate on this methodology We believe that we can bring a significant contribution

  • n this methodology