1 / 14

Research and more

This document provides an overview of a researcher's academic background and extensive contributions in the field of computer science, focusing on termination analysis, program analysis, and adaptive workflows. Earning a B.Sc. and M.Sc. in Computer Science from Hebrew University and completing a Ph.D. in the same field from Katholieke Universiteit Leuven, the researcher engages in advanced studies related to Petri nets, static analysis, and formal verification. Significant projects also include exploring usability in XML query languages and investigating resource management in modeling processes.

lara
Download Presentation

Research and more

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Research and more

  2. Who am I? • B.Sc. Math/Computer Science • Hebrew University of Jerusalem, Israel • M.Sc. Computer Science • Hebrew University of Jerusalem, Israel • Ph.D. in Science (Computer Science) • Katholieke Universiteit Leuven, Belgium • Postdoc at Ecole Polytechnique, France • LaQuSo Background – Recent research – More… / name of department

  3. Background (1997-2004) • Theses: Termination analysis of logic programs • Abstraction techniques in program analysis • But also: • Refactoring in LP [Demoen/Schrijvers/S] • View-usability for queries with aggregation [Cohen/Nutt/Sagiv/S] • XML query languages [Cohen/Kanza/Kogan/Nutt/Sagiv/S] Background – Recent research – More… / name of department

  4. Termination analysis: What is this about? • Undecidable for “interesting languages” • Necessary and sufficient conditions [Dershowitz/Lindenstrauss/Sagiv/S, De Schreye/S] • Sufficient conditions that can be verified automatically [Idem] • Usually: approximations of necessary and sufficient conditions • Often: abstractions or transformations • Interesting decidable sublanguages [Mesnard/S] Algorithms and Tools Background – Recent research – More… / name of department

  5. Background (2005-2006) • Petri nets (modelling and analysis): • Resources • Adaptivity • Termination analysis: • Decidable sublanguages [Mesnard/S] • New approach using TRS [Schneider-Kamp/Giesl/S/Thiemann] • But also: • BKE with μCRL [Bloom/Grote/Mauw/S] • Code stability [Huizing/Kuiper/Punter/S] • Popular papers [Heck/S] / name of department

  6. Resources in Petri nets • Durable and identical resources • Soundness • Whatever the system does… • There is a way to complete the process: and release all resources • Additional resources should not disturb soundness. • Is there a minimal number of resources that ensure soundness for any number of cases? • [Hee/S/Sidorova/Voorhoeve] Algorithm & Tool Background – Recent research – More… / name of department

  7. Adaptivity and workflow Classical workflow: structure is fixed during the design phase Ad-hoc workflow: structure can be modified arbitrarily [vd Aalst et al. 1999] Adaptive workflow: structure can be modified in a structured way • No formal semantics Verification is challenging 2. No reuse of existing WFMS! Structured way: parts of the process can be defined or extended later on… Background – Recent research – More… / name of department

  8. Our solution: Nested Nets … Token is a net! Level 2 Level 1 Analysis is possible using abstractions[Hee/Oanea/S/Sidorova/Voorhoeve/Lomazova] Level 0 Application: medical protocols [Hee/Schonenberg/S/Sidorova/vdWerf] Background – Recent research – More… / name of department

  9. Recent research (2007-2008) • Petri nets (modelling and analysis): • History (global vs. local) • History + adaptivity[Hee/Schonenberg/S/Sidorova/vdWerf] • Mining[vdWerf/vDongen/Hee/Hurkens/S] • Compositionality [Massuthe/S/Sidorova/Wolf] • Improved termination analysis [Schneider-Kamp/Giesl/S/Thiemann] • Framework for automatic verification[Raeds/Petković/S/Somers] • Metrics and Reverse engineering[Petković/vdBrand/S/Korshunova] Background – Recent research – More… / name of department

  10. Recent research: History • Modelling log-based decisions. • Twee models: • Global history (log is accessible for everybody) • Token history (each token has its own past) • Translating history models to classical Petri nets • Analysis • [Hee/S/Sidorova/vd Aalst, Hee/S/Sidorova] Background – Recent research – More… / name of department

  11. Recent research: Termination • LP  TRS; analysis of a TRS • Existing translations: • Restricted to a subclass of LP • Often: LP terminates, TRS – does not! • New translation • New form of rewriting • Provably more powerful than previous transformation-based approaches • [Schneider-Kamp/Giesl/S/Thiemann] Background – Recent research – More… / name of department

  12. Research interests • Static analysis using abstraction techniques • Maintainability • Termination analysis Background – Recent research – More… / name of department

  13. Even more • LaQuSo cases: • ABP 2, Almende, Braunschweig, Cepo, Cordys, De Lage Landen, De Lage Landen 2, Dynafix, M2M, NBG, NBG 2, Oce. • Code analysis • Architecture reviews • Literature study • Requirements elicitation • Certification Background – Recent research – More… / name of department

  14. Example of a LaQuSo case LaQuSo case / name of department

More Related