larissa an aspect oriented language for reactive systems
play

Larissa, an Aspect-Oriented Language for Reactive Systems PhD - PowerPoint PPT Presentation

Dec 13, 2022 •247 likes •1.52k views

Larissa, an Aspect-Oriented Language for Reactive Systems PhD Defense David Stauch Verimag/Grenoble INP November 13th, 2007 Jury Roland Groz Shmuel Katz Mario Sdholt Pascal Fradet Florence Maraninchi Karine Altisen 2/36 Introduction

  1. 10/36 Introduction Larissa Formal Analysis Tools Conclusion Crosscutting Concern 2: Compass Mode Compass Vector model has compass mode select mode/Compass Add Compass mode to Altimax base program mode mode/.. Display mode/... mode/... Time Altimeter Barometer Memory . . . . . . . . .

  2. 10/36 Introduction Larissa Formal Analysis Tools Conclusion Crosscutting Concern 2: Compass Mode Compass Vector model has compass mode select mode/Compass Add Compass mode to Altimax base program mode mode/ Display Compass mode/... mode/... Time Altimeter Barometer Memory . . . . . . . . .

  3. 10/36 Introduction Larissa Formal Analysis Tools Conclusion Crosscutting Concern 2: Compass Mode Compass Vector model has compass mode select mode/Compass Add Compass mode to Altimax base program mode mode/Time mode/ Display Compass mode/... mode/... Time Altimeter Barometer Memory . . . . . . . . .

  4. 11/36 Introduction Larissa Formal Analysis Tools Conclusion Larissa: Aspects for Argos Goal: aspect language for synchronous languages Argos adequate base language simple synchronous language expressive, characterizing constructs Must express cross-cutting concerns Same concepts as other aspect languages: join points, pointcuts, advice

  5. 12/36 Introduction Larissa Formal Analysis Tools Conclusion Outline Introduction 1 Larissa 2 Context and Requirements The Language Example Formal Analysis Tools 3 Conclusion and Further Work 4

  6. 13/36 Introduction Larissa Formal Analysis Tools Conclusion Argos Operators Base elements: boolean signals, complete and deterministic Mealy automata A a a/mod2 A

  7. 13/36 Introduction Larissa Formal Analysis Tools Conclusion Argos Operators Base elements: boolean signals, complete and deterministic Mealy automata Main operators: parallel product, local signals A a a/mod2 B mod2 mod2/mod4 mod2 ( A � B ) \ { mod2 }

  8. 13/36 Introduction Larissa Formal Analysis Tools Conclusion Argos Operators Base elements: boolean signals, complete and deterministic Mealy automata Main operators: parallel product, local signals Semantics: compilation into flat automata A a a a/mod2 a/mod4 a B mod2 a mod2/mod4 mod2 ( A � B ) \ { mod2 }

  9. 14/36 Introduction Larissa Formal Analysis Tools Conclusion Encapsulation Argos programs form expressions, e.g. (( A � B ) \ { a } ) � C A A, B and C automata or a/b Argos expressions a/b B a C

  10. 14/36 Introduction Larissa Formal Analysis Tools Conclusion Encapsulation Argos programs form expressions, e.g. (( A � B ) \ { a } ) � C I A A, B and C automata or a/b Argos expressions a/b Interface: inputs, outputs B a C O

  11. 14/36 Introduction Larissa Formal Analysis Tools Conclusion Encapsulation Argos programs form expressions, e.g. (( A � B ) \ { a } ) � C I A A, B and C automata or a/b Argos expressions a/b Interface: inputs, outputs B a Strong encapsulation: component structure invisible from outside C O

  12. 14/36 Introduction Larissa Formal Analysis Tools Conclusion Encapsulation Argos programs form expressions, e.g. (( A � B ) \ { a } ) � C I A A, B and C automata or a/b Argos expressions a/b Interface: inputs, outputs B a Strong encapsulation: component structure invisible from outside C Operators preserve i/o-trace O equivalence ( ∼ ): if A ′ ∼ A , then (( A ′ � B ) \ { a } ) � C ∼ (( A � B ) \ { a } ) � C

  13. 14/36 Introduction Larissa Formal Analysis Tools Conclusion Encapsulation Argos programs form expressions, e.g. (( A � B ) \ { a } ) � C I A ′ a/b A, B and C automata or Argos expressions Interface: inputs, outputs B a Strong encapsulation: component structure invisible from outside C Operators preserve i/o-trace O equivalence ( ∼ ): if A ′ ∼ A , then (( A ′ � B ) \ { a } ) � C ∼ (( A � B ) \ { a } ) � C

  14. 15/36 Introduction Larissa Formal Analysis Tools Conclusion Requirements: Aspects for Argos Express cross-cutting concerns crosscut structure of Argos expressions parallel composition can express some aspects for sequential languages

  15. 15/36 Introduction Larissa Formal Analysis Tools Conclusion Requirements: Aspects for Argos Express cross-cutting concerns crosscut structure of Argos expressions parallel composition can express some aspects for sequential languages Integrate well into Argos define as translation into automaton simple, formal semantics respect encapsulation, as other Argos operators usually not respected by aspect languages

  16. 16/36 Introduction Larissa Formal Analysis Tools Conclusion Related Work Aspects and Parallelism Concurrent aspects [Douence et al, GPCE06]: asynchronous base program, asynchronous execution of advice

  17. 16/36 Introduction Larissa Formal Analysis Tools Conclusion Related Work Aspects and Parallelism Concurrent aspects [Douence et al, GPCE06]: asynchronous base program, asynchronous execution of advice Formal Properties Many formalisations of aspect languages Aspects preserving the encapsulation: Composition Filters [Bergmans, Aksit]: intercept and modify messages between components Open Modules [Aldrich, ECOOP06]: add additional information to interface

  18. 17/36 Introduction Larissa Formal Analysis Tools Conclusion Larissa Join points: one step in the execution I.e., transitions in an automaton

  19. 17/36 Introduction Larissa Formal Analysis Tools Conclusion Larissa Join points: one step in the execution I.e., transitions in an automaton Pointcut: select transitions in automaton Aspect

  20. 17/36 Introduction Larissa Formal Analysis Tools Conclusion Larissa Join points: one step in the execution I.e., transitions in an automaton Pointcut: select transitions in automaton Advice: modify transitions change target state and outputs Aspect

  21. 17/36 Introduction Larissa Formal Analysis Tools Conclusion Larissa Join points: one step in the execution I.e., transitions in an automaton Pointcut: select transitions in automaton Advice: modify transitions change target state and outputs Aspect

  22. 17/36 Introduction Larissa Formal Analysis Tools Conclusion Larissa I Join points: one step in the execution I.e., transitions in an automaton Pointcut: select transitions in automaton Advice: modify transitions O change target state and outputs Challenge: respect encapsulation Aspect

  23. 17/36 Introduction Larissa Formal Analysis Tools Conclusion Larissa I Join points: one step in the execution I.e., transitions in an automaton Pointcut: select transitions in automaton Advice: modify transitions O change target state and outputs Challenge: respect encapsulation Aspect

  24. 17/36 Introduction Larissa Formal Analysis Tools Conclusion Larissa I Join points: one step in the execution I.e., transitions in an automaton Pointcut: select transitions in automaton Advice: modify transitions O change target state and outputs Challenge: respect encapsulation Aspect aspect must only refer to interface

  25. 18/36 Introduction Larissa Formal Analysis Tools Conclusion Pointcuts I Must select transitions a b b O

  26. 18/36 Introduction Larissa Formal Analysis Tools Conclusion Pointcuts I Must select transitions a Solution: observer automaton b inputs: inputs and outputs b of observed program one output JP O Pointcut a b/JP

  27. 18/36 Introduction Larissa Formal Analysis Tools Conclusion Pointcuts I Must select transitions a Solution: observer automaton b inputs: inputs and outputs b of observed program one output JP O Pointcut emits JP Pointcut ⇒ transition in program selected a b/JP

  28. 18/36 Introduction Larissa Formal Analysis Tools Conclusion Pointcuts I Must select transitions a Solution: observer automaton b inputs: inputs and outputs b of observed program one output JP O Pointcut emits JP Pointcut ⇒ transition in program selected a b/JP JP

  29. 18/36 Introduction Larissa Formal Analysis Tools Conclusion Pointcuts I Must select transitions a Solution: observer automaton b inputs: inputs and outputs b of observed program one output JP O Pointcut emits JP Pointcut ⇒ transition in program selected a Transitions identified statically b/JP by parallel product JP

  30. 19/36 Introduction Larissa Formal Analysis Tools Conclusion Advice Difficulty: specify one new target state I O Aspect

  31. 19/36 Introduction Larissa Formal Analysis Tools Conclusion Advice Difficulty: specify one new target state trace a. b I Solution: execute finite input trace automaton deterministic, thus a always identifies one state b b O Aspect

  32. 19/36 Introduction Larissa Formal Analysis Tools Conclusion Advice Difficulty: specify one new target state trace a. b I Solution: execute finite input trace automaton deterministic, thus a always identifies one state b b O Aspect

  33. 19/36 Introduction Larissa Formal Analysis Tools Conclusion Advice Difficulty: specify one new target state trace a. b I Solution: execute finite input trace automaton deterministic, thus a always identifies one state b b O Aspect

  34. 19/36 Introduction Larissa Formal Analysis Tools Conclusion Advice Difficulty: specify one new target state trace a. b I Solution: execute finite input trace automaton deterministic, thus a always identifies one state b b O Aspect

  35. 19/36 Introduction Larissa Formal Analysis Tools Conclusion Advice Difficulty: specify one new target state trace a. b I Solution: execute finite input trace automaton deterministic, thus a always identifies one state b Two kinds: b toInit advice: execute trace from initial state O toCurrent advice: execute trace from source state of transition Aspect

  36. 20/36 Introduction Larissa Formal Analysis Tools Conclusion Example: Logbook Shortcut Aspect LB Pointcut: transitions in main modes where minus is true Advice: trace mode.select.mode.mode, output Logbook mode/ Time mode/ mode/ Alti Baro Time Altimeter Barometer select select select Baro mode mode/ Time mode Alti mode/ mode/ mode mode mode Memory Logbook altimax

  37. 20/36 Introduction Larissa Formal Analysis Tools Conclusion Example: Logbook Shortcut Aspect LB Pointcut: transitions in main modes where minus is true Advice: trace mode.select.mode.mode, output Logbook minus ∧ mode/ JP ,Time mode/ Time .../ JP .../ JP mode/ mode/ .../ JP Alti Baro Time Altimeter Barometer minus/ JP .../ JP .../ JP select select select main .../ JP Time ∨ select Alti ∨ Baro mode mode/ Time mode Baro Alti sub mode/ mode/ mode mode mode pointcut of LB Memory Logbook altimax

  38. 20/36 Introduction Larissa Formal Analysis Tools Conclusion Example: Logbook Shortcut Aspect LB Pointcut: transitions in main modes where minus is true Advice: trace mode.select.mode.mode, output Logbook minus ∧ mode/ JP ,Time mode/ Time .../ JP .../ JP mode/ .../ JP Baro mode Time Altimeter Barometer minus/ JP .../ JP .../ JP select select select main .../ JP Time ∨ select Alti ∨ Baro mode mode/ Time mode Baro Alti sub mode/ mode/ mode mode mode pointcut of LB Memory Logbook altimax

  39. 20/36 Introduction Larissa Formal Analysis Tools Conclusion Example: Logbook Shortcut Aspect LB Pointcut: transitions in main modes where minus is true Advice: trace mode.select.mode.mode, output Logbook mode/ Time mode/ Baro mode Time Altimeter Barometer minus/ JP select select select main Time ∨ select minus/Logbook Alti ∨ minus/Logbook Baro mode mode/ Time mode Baro Alti sub mode/ mode/ mode mode mode pointcut of LB Memory Logbook altimax ⊳ LB

  40. 21/36 Introduction Larissa Formal Analysis Tools Conclusion Advice Program mode Compass Advice insufficient for Compass Concern select mode/ mainMode Replace transition by advice program mode Advice program has terminating state: represents return to base program advice program mode/.. mode/... mode/... Time Altimeter Barometer . . . . . . . . .

  41. 21/36 Introduction Larissa Formal Analysis Tools Conclusion Advice Program mode Compass Advice insufficient for Compass Concern select mode/ mainMode Replace transition by advice program mode Advice program has terminating state: represents return to base program advice program mode/.. mode/... mode/... mode/... Time Altimeter Barometer Compass . . . . . . . . . . . . altimax ⊳ compass

  42. 22/36 Introduction Larissa Formal Analysis Tools Conclusion Recovery Advice and Compiler Recovery advice “Jumping backward” Identify set of recovery states Jump to last recovery state that was passed

  43. 22/36 Introduction Larissa Formal Analysis Tools Conclusion Recovery Advice and Compiler Recovery advice “Jumping backward” Identify set of recovery states Jump to last recovery state that was passed Compiler for Argos and Larissa All language variants implemented Experimentation with many examples Written in Java, AspectJ, BDD library Available at http://www-verimag.imag.fr/ ∼ stauch/ArgosCompiler/

  44. 23/36 Introduction Larissa Formal Analysis Tools Conclusion Outline Introduction 1 Larissa 2 3 Formal Analysis Tools Aspect Interference Aspects and Contracts Conclusion and Further Work 4

  45. 24/36 Introduction Larissa Formal Analysis Tools Conclusion Formal Analysis Tools Larissa: small language, formally defined, with simple semantics Well adapted to study formal properties of aspect languages We studied two such properties: interaction of several aspects combination of Larissa with contracts

  46. 25/36 Introduction Larissa Formal Analysis Tools Conclusion Aspect Interaction Aspect Interaction Do several aspects influence each other? When is P ⊳ A1 ⊳ A2 ∼ P ⊳ A2 ⊳ A1?

  47. 25/36 Introduction Larissa Formal Analysis Tools Conclusion Aspect Interaction Aspect Interaction plus/ JP m Do several aspects influence each other? When is P ⊳ A1 ⊳ A2 ∼ P ⊳ A2 ⊳ A1? main Time ∨ Example: Second Shortcut Aspect M select Alti ∨ Baro Also use plus button as shortcut sub in the main modes Pressing plus goes to the Memory mode Pointcut of M

  48. 26/36 Introduction Larissa Formal Analysis Tools Conclusion Weaving the Second Shortcut Aspect Weave M into altimax ⊳ LB plus/ JP m mode/ Alti Time ... main minus/... Time ∨ select Alti ∨ ... Baro Logbook sub altimax ⊳ LB Pointcut of M

  49. 26/36 Introduction Larissa Formal Analysis Tools Conclusion Weaving the Second Shortcut Aspect Weave M into altimax ⊳ LB When pressing minus in main mode: altimax ⊳ LB goes to submode pointcut stays in main mode plus/ JP m mode/ Alti Time ... main minus/... Time ∨ select Alti ∨ ... Baro Logbook sub altimax ⊳ LB Pointcut of M

  50. 26/36 Introduction Larissa Formal Analysis Tools Conclusion Weaving the Second Shortcut Aspect Weave M into altimax ⊳ LB When pressing minus in main mode: altimax ⊳ LB goes to submode pointcut stays in main mode plus/ JP m mode/ Alti Time ... main minus/... Time ∨ select Alti ∨ ... Baro Logbook sub altimax ⊳ LB Pointcut of M

  51. 26/36 Introduction Larissa Formal Analysis Tools Conclusion Weaving the Second Shortcut Aspect Weave M into altimax ⊳ LB When pressing minus in main mode: altimax ⊳ LB goes to submode pointcut stays in main mode Error: Advice transitions added to Logbook mode plus/ JP m mode/ Alti Time ... main plus/Memory minus/... Time ∨ select Alti ∨ ... Baro Logbook sub altimax ⊳ LB ⊳ M Pointcut of M

  52. 27/36 Introduction Larissa Formal Analysis Tools Conclusion Joint Weaving Problem: aspect M written for altimax, not for altimax ⊳ LB Idea: weave aspects jointly into the program

  53. 27/36 Introduction Larissa Formal Analysis Tools Conclusion Joint Weaving Problem: aspect M written for altimax, not for altimax ⊳ LB Idea: weave aspects jointly into the program Select join points for all aspects first, then apply advice Joint Weaving: altimax ⊳ (LB,M) apply pointcuts and determine join point transitions 1 sequentially apply advice 2

  54. 28/36 Introduction Larissa Formal Analysis Tools Conclusion Application to the Example: altimax ⊳ (LB,M) mode/ Time mode/ mode/ Alti Baro Time Altimeter Barometer select select select mode/ Baro mode mode/ Time mode mode/Alti mode mode mode Memory Logbook

  55. 28/36 Introduction Larissa Formal Analysis Tools Conclusion Application to the Example: altimax ⊳ (LB,M) mode/ Time minus ∧ mode/ JP ,Time .../ JP mode/ .../ JP mode/ .../ JP m .../ JP Alti Baro Time Altimeter Barometer .../ JP .../ JP .../ JP m select .../ JP m select select .../ JP mode/ Baro mode mode/ Time mode mode/Alti mode mode mode Memory Logbook

  56. 28/36 Introduction Larissa Formal Analysis Tools Conclusion Application to the Example: altimax ⊳ (LB,M) mode/ Time minus ∧ mode/ JP ,Time .../ JP mode/ .../ JP mode/ .../ JP Alti Baro Time Altimeter Barometer .../ JP .../ JP select select select .../ JP mode/ Baro mode mode/ Time plus/Memory mode mode/Alti mode mode mode Memory Logbook plus/Memory

  57. 28/36 Introduction Larissa Formal Analysis Tools Conclusion Application to the Example: altimax ⊳ (LB,M) mode/ Time mode/ mode/ Alti Baro Time Altimeter Barometer select select select minus/Logbook minus/Logbook mode/ Baro mode mode/ Time plus/Memory mode mode/Alti mode mode mode Memory Logbook plus/Memory

  58. 29/36 Introduction Larissa Formal Analysis Tools Conclusion Proving Non-Interference Is altimax ⊳ (LB,M) ∼ altimax ⊳ (M,LB)?

  59. 29/36 Introduction Larissa Formal Analysis Tools Conclusion Proving Non-Interference Is altimax ⊳ (LB,M) ∼ altimax ⊳ (M,LB)? Not always, because advice is still applied sequentially Jointly woven Larissa aspects still interfere, if they select the same join point transitions

  60. 29/36 Introduction Larissa Formal Analysis Tools Conclusion Proving Non-Interference Is altimax ⊳ (LB,M) ∼ altimax ⊳ (M,LB)? Not always, because advice is still applied sequentially Jointly woven Larissa aspects still interfere, if they select the same join point transitions Theorem for Jointly-Woven Aspects Noninterference of two aspects, for any base program: if no transition selected by both aspects in product of pointcuts

  61. 29/36 Introduction Larissa Formal Analysis Tools Conclusion Proving Non-Interference Is altimax ⊳ (LB,M) ∼ altimax ⊳ (M,LB)? Not always, because advice is still applied sequentially Jointly woven Larissa aspects still interfere, if they select the same join point transitions Theorem for Jointly-Woven Aspects Noninterference of two aspects, for any base program: if no transition selected by both aspects in product of pointcuts Noninterference of two aspects, for given base program P: if no transition selected by both aspects in product of pointcuts and P

  62. 30/36 Introduction Larissa Formal Analysis Tools Conclusion Design-by-Contract Originally introduced by Bertrand Meyer for object-oriented programming Contract: assumption A ⇒ guarantee G

  63. 30/36 Introduction Larissa Formal Analysis Tools Conclusion Design-by-Contract Originally introduced by Bertrand Meyer for object-oriented programming Contract: assumption A ⇒ guarantee G Example (in Java): class C{ / ∗ @ assume i < 10 ∗ / / ∗ @ guarantee \ result < 10 ∗ / int m(int i ) { . . . } }

  64. 31/36 Introduction Larissa Formal Analysis Tools Conclusion Aspects Modify Contracts Example call to m: i=9, returns 9 i<10 m(9) 9 result<10

  65. 31/36 Introduction Larissa Formal Analysis Tools Conclusion Aspects Modify Contracts Example call to m: i=9, returns 9 Adding aspect to m: int around(int i): m(i){ i<10 m(9) return 1 + proceed(i + 1); } 9 result<10

  66. 31/36 Introduction Larissa Formal Analysis Tools Conclusion Aspects Modify Contracts Example call to m: i=9, returns 9 Adding aspect to m: int around(int i): m(i){ i<10 m(9) return 1 + proceed(i + 1); } 9 result<10

  67. 31/36 Introduction Larissa Formal Analysis Tools Conclusion Aspects Modify Contracts Example call to m: i=9, returns 9 Adding aspect to m: int around(int i): m(i){ i<10 m(9) m(10) return 1 + proceed( i + 1 ); } Now: A violated 9 result<10

  68. 31/36 Introduction Larissa Formal Analysis Tools Conclusion Aspects Modify Contracts Example call to m: i=9, returns 9 Adding aspect to m: int around(int i): m(i){ i<10 m(9) m(10) return 1 + proceed(i + 1); } Now: A violated, G violated 9 10 result<10

  69. 31/36 Introduction Larissa Formal Analysis Tools Conclusion Aspects Modify Contracts Example call to m: i=9, returns 9 Adding aspect to m: int around(int i): m(i){ i<10 m(9) m(10) return 1 + proceed(i + 1); } Now: A violated, G violated In this case, a new contract for method with aspect can be derived: 9 / ∗ @ assume i < 10 ∗ / 10 result<10 / ∗ @ guarantee \ result < 10 ∗ /

  70. 31/36 Introduction Larissa Formal Analysis Tools Conclusion Aspects Modify Contracts Example call to m: i=9, returns 9 Adding aspect to m: i<9 int around(int i): m(i){ i<10 m(8) m(9) return 1 + proceed(i + 1); } Now: A violated, G violated In this case, a new contract for method with aspect can be derived: 9 / ∗ @ assume i < 9 ∗ / 10 result<10 / ∗ @ guarantee \ result < 10 ∗ /

  71. 31/36 Introduction Larissa Formal Analysis Tools Conclusion Aspects Modify Contracts Example call to m: i=9, returns 9 Adding aspect to m: i<9 int around(int i): m(i){ i<10 m(8) m(9) return 1 + proceed(i + 1); } Now: A violated, G violated In this case, a new contract for method with aspect can be derived: 9 / ∗ @ assume i < 9 ∗ / 10 result<10 / ∗ @ guarantee \ result < 11 ∗ / result<11

  72. 31/36 Introduction Larissa Formal Analysis Tools Conclusion Aspects Modify Contracts Example call to m: i=9, returns 9 Adding aspect to m: i<9 int around(int i): m(i){ i<10 m(8) m(9) return 1 + proceed(i + 1); } Now: A violated, G violated In this case, a new contract for method with aspect can be derived: 9 / ∗ @ assume i < 9 ∗ / 10 result<10 / ∗ @ guarantee \ result < 11 ∗ / result<11 Idea: derive new contracts automatically

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

A Static Aspect Language for Modelica Models Malte Lochau (lochau@ips.cs.tu-bs.de) Henning

A Static Aspect Language for Modelica Models Malte Lochau (lochau@ips.cs.tu-bs.de) Henning

Institute for Programming and Reactive Systems TU Braunschweig, Germany 2nd International Workshop on Equation-Based Object-Oriented Languages and Tools at ECOOP 2008, July 8, Paphos, Cyprus A Static Aspect Language for Modelica Models Malte

432 views • 26 slides
Aspect-Oriented Programming and Aspect-J TDDD05 Ola Leifer Most slides courtesy of Jens

Aspect-Oriented Programming and Aspect-J TDDD05 Ola Leifer Most slides courtesy of Jens

Aspect-Oriented Programming and Aspect-J TDDD05 Ola Leifer Most slides courtesy of Jens Gustafsson and Mikhail Chalabine Outline: Aspect-Oriented Programming New concepts introduced Crosscutting concern Aspect Dynamic aspect

1.12k views • 50 slides
Nu: a Dynamic Aspect-Oriented Intermediate Language Model and Virtual Machine for Flexible

Nu: a Dynamic Aspect-Oriented Intermediate Language Model and Virtual Machine for Flexible

Nu: a Dynamic Aspect-Oriented Intermediate Language Model and Virtual Machine for Flexible Runtime Adaptation Robert Dyer and Hridesh Rajan Department of Computer Science Iowa State University { rdyer,hridesh } @cs.iastate.edu 7 th

1.01k views • 58 slides
An Aspect-Oriented Behavioral Interface Specification Language FLACOS '08, Malta Takuo Watanabe

An Aspect-Oriented Behavioral Interface Specification Language FLACOS '08, Malta Takuo Watanabe

An Aspect-Oriented Behavioral Interface Specification Language FLACOS '08, Malta Takuo Watanabe &amp; Kiyoshi Yamada * Department of Computer Science, Tokyo Institute of Technology * Currently with: Research Center for Information Security,

242 views • 22 slides
synERJY An Object-oriented Synchronous Programming Language Synchrony - Ten Years After Reinhard

synERJY An Object-oriented Synchronous Programming Language Synchrony - Ten Years After Reinhard

synERJY An Object-oriented Synchronous Programming Language Synchrony - Ten Years After Reinhard Budde Axel Poign Karl-Heinz Sylla Overview Highlights Reactive Components Synchronous Styles Hybrid Systems

532 views • 19 slides
CiAO: An Aspect-Oriented OS Family for Resource-Constrained Embedded Systems Daniel Lohmann

CiAO: An Aspect-Oriented OS Family for Resource-Constrained Embedded Systems Daniel Lohmann

CiAO: An Aspect-Oriented OS Family for Resource-Constrained Embedded Systems Daniel Lohmann Wanja Hofer Wolfgang Schrder-Preikschat Friedrich-Alexander University Erlangen-Nuremberg Jochen Streicher Olaf Spinczyk Technical University

638 views • 40 slides
Towards an Aspect-oriented approach to Agent-oriented programming Matthieu Amiguet Univ. of

Towards an Aspect-oriented approach to Agent-oriented programming Matthieu Amiguet Univ. of

Towards an Aspect-oriented approach to Agent-oriented programming Matthieu Amiguet Univ. of Applied Sciences Locle, Switzerland Jose Baez LIRMM, University of Montpellier, France Adina Nagy Institut fr Informatik, HU Berlin,

895 views • 51 slides
An introduction to Aspect- AspectJ extends the Java programming Oriented Programming with

An introduction to Aspect- AspectJ extends the Java programming Oriented Programming with

The AspectJ programming language An introduction to Aspect- AspectJ extends the Java programming Oriented Programming with language with constructs in order to support AOP. AspectJ It is a superset of Java. Each valid Java

276 views • 11 slides
modeling crosscutting in aspect-oriented mechanisms Hidehiko Masuhara (University of Tokyo)

modeling crosscutting in aspect-oriented mechanisms Hidehiko Masuhara (University of Tokyo)

modeling crosscutting in aspect-oriented mechanisms Hidehiko Masuhara (University of Tokyo) joint work with Gregor Kiczales (University of British Columbia) 1 aspect-oriented programming AOP supports modularization of crosscutting

814 views • 36 slides
Aspect-Oriented Programming with Type Classes Martin Sulzmann National University of Singapore

Aspect-Oriented Programming with Type Classes Martin Sulzmann National University of Singapore

Aspect-Oriented Programming with Type Classes Martin Sulzmann National University of Singapore Meng Wang Oxford University Aspect-Oriented Programming with Type Classes p.1 Whats this talk about? Aspect-oriented programming (AOP) is

444 views • 32 slides
Outline Synchronous Programming Introduction of Reactive Systems The Data-Flow Language Lustre

Outline Synchronous Programming Introduction of Reactive Systems The Data-Flow Language Lustre

Outline Synchronous Programming Introduction of Reactive Systems The Data-Flow Language Lustre The Imperative Language Esterel Compilation of Synchronous Languages Nicolas Halbwachs Verification and Automatic Testing of Synchronous

371 views • 26 slides
Performance Modelling of Message-Oriented Middleware with Priority Queues Snigdha Singh, Larissa

Performance Modelling of Message-Oriented Middleware with Priority Queues Snigdha Singh, Larissa

Performance Modelling of Message-Oriented Middleware with Priority Queues Snigdha Singh, Larissa Schmid, Anne Koziolek ARCHITECTURE-DRIVEN REQUIREMENTS ENGINEERING GROUP, INSTITUTE FOR PROGRAM STRUCTURES AND DATA ORGANIZATION, KIT DEPARTMENT OF

495 views • 12 slides
The Aspect-Oriented Design of the ++ Parser Framework Puma C/C Matthias Urban Daniel Lohmann

The Aspect-Oriented Design of the ++ Parser Framework Puma C/C Matthias Urban Daniel Lohmann

The Aspect-Oriented Design of the ++ Parser Framework Puma C/C Matthias Urban Daniel Lohmann Olaf Spinczyk pure systems GmbH Friedrich-Alexander University Technical University Magdeburg Erlangen-Nuremberg Dortmund 9th International

595 views • 56 slides
modelling reactive system Introduction mCRL2 (successor of )is a

modelling reactive system Introduction mCRL2 (successor of )is a

Introducing mCRL2 language for modelling reactive system Introduction mCRL2 (successor of )is a specification language for describing concurrent discrete event systems. It is accompanied with a toolset for simulation,

291 views • 10 slides
Determinate and Timing-Predictable Concurrency in Reactive Systems The Synchronous

Determinate and Timing-Predictable Concurrency in Reactive Systems The Synchronous

Determinate and Timing-Predictable Concurrency in Reactive Systems The Synchronous Approach and the SCCharts Language A r t Reinhard von Hanxleden 1 i * f a S C o m p * l t e n N t e e c t * s T i W s In

578 views • 38 slides
Does Aspect-Oriented Programming Increase the Development Speed for Crosscutting Code? An

Does Aspect-Oriented Programming Increase the Development Speed for Crosscutting Code? An

Does Aspect-Oriented Programming Increase the Development Speed for Crosscutting Code? An Empirical Study Stefan Hanenberg, Sebastian Kleinschmager, Manuel Josupeit-Walter University of Duisburg-Essen 45117 Essen, Germany

408 views • 12 slides
Recovering the Imperfect: Cell Segmentation in the Presence of Dynamically Localized Proteins

Recovering the Imperfect: Cell Segmentation in the Presence of Dynamically Localized Proteins

Recovering the Imperfect: Cell Segmentation in the Presence of Dynamically Localized Proteins Second Workshop on Medical Image Learning with Less Labels and Imperfect Data (MIL3ID) 4.10.2020 zgn iek*, Yassine Marrakchi*, Enoch B. Antwi,

831 views • 16 slides
CSE 473: Artificial Intelligence Spring 2014 Hidden Markov Models &amp; Particle Filtering

CSE 473: Artificial Intelligence Spring 2014 Hidden Markov Models &amp; Particle Filtering

CSE 473: Artificial Intelligence Spring 2014 Hidden Markov Models &amp; Particle Filtering Hanna Hajishirzi Many slides adapted from Dan Weld, Pieter Abbeel, Dan Klein, Stuart Russell, Andrew Moore &amp; Luke Zettlemoyer 1 Outline

620 views • 29 slides
The standard atmosphere I Introduction to Aeronautical Engineering Prof. dr. ir. Jacco Hoekstra

The standard atmosphere I Introduction to Aeronautical Engineering Prof. dr. ir. Jacco Hoekstra

The standard atmosphere I Introduction to Aeronautical Engineering Prof. dr. ir. Jacco Hoekstra M.T. Salam - CC - BY - SA Felix Baumgartner Joe Kittinger August 16 th , 1960 October 14 th , 2012 31 333 m 38 969 m R. de Pandora - CC - BY - SA

624 views • 30 slides
Design layout and expected performance of Inner Tracker for ATLAS Phase 2 Upgrade Swagato

Design layout and expected performance of Inner Tracker for ATLAS Phase 2 Upgrade Swagato

Design layout and expected performance of Inner Tracker for ATLAS Phase 2 Upgrade Swagato Banerjee 1 High Luminosity LHC (HL-LHC) upgrade Phase 2 Upgrade Installation: 2024 onwards, Preparation: now 10 times integrated luminosity: 3000 fb -1

571 views • 18 slides
Larissa Aspects and Design-By-Contract David Stauch, Karine Altisen, Florence Maraninchi

Larissa Aspects and Design-By-Contract David Stauch, Karine Altisen, Florence Maraninchi

David Stauch 1 Larissa Aspects and Design-By-Contract Larissa Aspects and Design-By-Contract David Stauch, Karine Altisen, Florence Maraninchi Verimag, Grenoble, France David Stauch 2 Larissa Aspects and Design-By-Contract Introduction

236 views • 9 slides
import community @fmasanori, @KatiaNakamura, @pk_pacheco Ten different countries Diversity

import community @fmasanori, @KatiaNakamura, @pk_pacheco Ten different countries Diversity

import community @fmasanori, @KatiaNakamura, @pk_pacheco Ten different countries Diversity Statement at PSF (excerpt) we believe that a diverse Python community is stronger and more vibrant. A diverse community where people treat each

624 views • 49 slides
AIST Risk Symposium Regulators Roundup - ATO Presenter: Larissa Evans Assistant Commissioner,

AIST Risk Symposium Regulators Roundup - ATO Presenter: Larissa Evans Assistant Commissioner,

AIST Risk Symposium Regulators Roundup - ATO Presenter: Larissa Evans Assistant Commissioner, Fund Services and Engagement Superannuation and Employer Obligations, ATO UNCLASSIFIED - external Outline Application process Walk-though

307 views • 17 slides
NIRV GIFT BIBLE Format: Slides NIRV GIFT BIBLE Format: Slides Filesize: 2.47 MB Reviews

NIRV GIFT BIBLE Format: Slides NIRV GIFT BIBLE Format: Slides Filesize: 2.47 MB Reviews

H7YQEHSNBXNC ~ PDF # NIRV GIFT BIBLE Format: Slides NIRV GIFT BIBLE Format: Slides NIRV GIFT BIBLE Format: Slides Filesize: 2.47 MB Reviews Reviews Without doubt, this is the very best operate by any writer. This is for all those who statte

422 views • 4 slides

More recommend