active learning of state machines
play

Active Learning of State Machines tutorial Frits Vaandrager - PowerPoint PPT Presentation

Feb 11, 2024 •466 likes •786 views

Active Learning of State Machines tutorial Frits Vaandrager Radboud University Nijmegen Dagstuhl, March 2018 Goal Active Automaton Learning Informationsteknologi Informationsteknologi What state machine reset governs the behavior of this

  1. Active Learning of State Machines tutorial Frits Vaandrager Radboud University Nijmegen Dagstuhl, March 2018

  2. Goal Active Automaton Learning Informationsteknologi Informationsteknologi What state machine reset governs the behavior of this black box? SUT input 1 input 2 output 1 output 2

  3. Why Study Automata Learning? Informationsteknologi Informationsteknologi  Fundamental: System Identification  Useful  Often we don’t have models of software components  When we have models we often don’t know whether they are correct

  4. Informationsteknologi Informationsteknologi Machine Learning in General

  5. Informationsteknologi Informationsteknologi Learning Regular Languages

  6. Minimally Adequate Teacher Informationsteknologi Informationsteknologi Membership Queries Yes / No Teacher Learner Equivalence Queries Yes / No + Counterexample

  7. Informationsteknologi Informationsteknologi Regular Sets and Congruences

  8. Informationsteknologi Informationsteknologi Angluin’s L* Algorithm

  9. Black Box Checking (Peled, Vardi & Yannakakis , ‘99) Informationsteknologi Informationsteknologi Learner: Formulate hypothesis Model-Based Testing: Test hypothesis

  10. Informationsteknologi Informationsteknologi

  11. Informationsteknologi Informationsteknologi Our Research Method Tools Theory Applications

  12. Application 1: EMV protocol Informationsteknologi Informationsteknologi  Inference of EMV protocol  Credit card with EMV chip   EMV = Europay, Mastercard and Visa  Compatibility between smartcards and terminals  EMV-compliance required for

  13. Model of SecureCode app on Dutch banking card EMV standard has over 700 pages Informationsteknologi Informationsteknologi At most 1500 membership queries, less than 30 minutes

  14. Different cards, different state machines Learned models provide unique Informationsteknologi Informationsteknologi fingerprints of cards! Specification?

  15. Informationsteknologi Informationsteknologi Application 2: E.dentifier2

  16. State Machines for Old and New E.dentifier2 Informationsteknologi Informationsteknologi

  17. A Theory of Abstractions (Aarts, Jonsson, Uijen & Vaandrager, 2015) Informationsteknologi Informationsteknologi abstract concrete input input Learner Mapper Teacher small ∑ probably abstract concrete large ∑ output output

  18. Application 3-5: Protocol Implementations Informationsteknologi Informationsteknologi We found standard violations in implementations of major protocols:  TCP (CAV’16, FMICS’17)  TLS (Usenix Security ‘15)  SSH (Spin’17)

  19. Informationsteknologi Informationsteknologi SSH Learning Results

  20. Informationsteknologi Informationsteknologi SSH Model Checking Results

  21. Application 6: Power Control Service of Philips Informationsteknologi Informationsteknologi  Legacy component  Refactored component  Equivalent?

  22. Our Approach Legacy Refactored Implementation Implementation model learner model learner Model Model equivalence checker Adapt models N N counter equiv model(s) correct example  ? for  ? using  Y Y done Adapt implementations(s)

  23. Application 7: Engine Status Manager Océ Printer Informationsteknologi Informationsteknologi Goal: learn models of realistic printer controllers Possible use: regression testing, generation of new implementations,..

  24. Adaptive Distinguishing Sequences (Lee & Yannakakis, 1994) Informationsteknologi Informationsteknologi

  25. Results  Learned model from SUT equivalent to handcrafted Informationsteknologi Informationsteknologi model  114 hypotheses generated  8.5 hours needed  29.933.643 membership queries with ≈35 inputs  30.629.711validity queries with ≈30 inputs

  26. Theory+Tools: Learning Register Automata Informationsteknologi Informationsteknologi Three approaches: 1. Using adapted Myhill-Nerode (LearnLib, RALib) 2. Using mappers and CEGAR (Tomte) 3. Using NLambda Haskell library for nominal automata

  27. Theory: Learning Timed Mealy Machines (Jonsson & Vaandrager, 2018) Informationsteknologi Informationsteknologi

  28. Future Work: Opening the Box Informationsteknologi Informationsteknologi Some possible approaches: 1. Fuzzing 2. Static analysis 3. Tainting

  29. Other Research Challenges Informationsteknologi Informationsteknologi  I/O transition systems  Nondeterminism  More complex (operations on) data  Quality of learned models  …

  30. Conclusions Informationsteknologi Informationsteknologi  Nice mix of theory and applications  Numerous challenges

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

Finite State Machines (FSM) Chapter 8 State Machines Introduction State Machines Mealy and

Finite State Machines (FSM) Chapter 8 State Machines Introduction State Machines Mealy and

Finite State Machines (FSM) Chapter 8 State Machines Introduction State Machines Mealy and Moore Machines State Machines Synchronous & Asynchronous Systems State Diagrams Elements of Diagrams State Diagrams Properties State Diagrams

607 views • 33 slides
Finite State Machines (FSM) AKA Finite State Automat on State Machines Introduction State

Finite State Machines (FSM) AKA Finite State Automat on State Machines Introduction State

Finite State Machines (FSM) AKA Finite State Automat on State Machines Introduction State Machines Mealy and Moore Machines State Machines Synchronous & Asynchronous Systems State Diagrams Elements of Diagrams State Diagrams Properties

676 views • 33 slides
Agenda Intro to Active Learning Activity Design Resources for Active Learning Lunch with Active

Agenda Intro to Active Learning Activity Design Resources for Active Learning Lunch with Active

Agenda Intro to Active Learning Activity Design Resources for Active Learning Lunch with Active Learning Veterans Wrap Up Introduction to Active Learning What is active learning? Brainstorm your ideas with your group and generate a

855 views • 42 slides
Multi-Task Active Learning Yi Zhang Outline Active Learning Multi-Task Active Learning

Multi-Task Active Learning Yi Zhang Outline Active Learning Multi-Task Active Learning

Multi-Task Active Learning Yi Zhang Outline Active Learning Multi-Task Active Learning Linguistic Annotations (ACL 08) Image Classification (CVPR 08) Current Work and Discussions Constraint-Driven Active Learning

945 views • 47 slides
Overview A first introduction to Prolog Implementing finite state machines and learning

Overview A first introduction to Prolog Implementing finite state machines and learning

Overview A first introduction to Prolog Implementing finite state machines and learning Prolog along the way Encoding finite state machines in Prolog Recognition and generation with finite state machines in Prolog Completing the

542 views • 5 slides
Implementing finite state machines and learning Prolog along the way Detmar Meurers: Intro to

Implementing finite state machines and learning Prolog along the way Detmar Meurers: Intro to

Implementing finite state machines and learning Prolog along the way Detmar Meurers: Intro to Computational Linguistics I OSU, LING 684.01, 13. January 2003 Overview A first introduction to Prolog Encoding finite state machines in Prolog

623 views • 28 slides
Learning Outcomes I understand the active-low signal convention and how to interface circuits

Learning Outcomes I understand the active-low signal convention and how to interface circuits

2-3.1 2-3.2 Learning Outcomes I understand the active-low signal convention and how to interface circuits that use both active-high and active-low signals Spiral 2-3 I can take any state diagram and create a corresponding state machine

313 views • 16 slides
ACTIVE 1. WELCOME and JUMPING IN LEARNING 1. WHAT IS ACTIVE LEARNING? la Carte 1.

ACTIVE 1. WELCOME and JUMPING IN LEARNING 1. WHAT IS ACTIVE LEARNING? la Carte 1.

ACTIVE 1. WELCOME and JUMPING IN LEARNING 1. WHAT IS ACTIVE LEARNING? la Carte 1. CONSTRUCTING our TEACHING CHALLENGES in a low tech 1. ORCHESTRATION environment 1. SHOW-AND-TELL Selma Hamdani Psychology / DALC / Neuroscience

836 views • 50 slides
Active Learning Passive Learning Active Learning 1. Think 1. Acquisition of knowledge Ability

Active Learning Passive Learning Active Learning 1. Think 1. Acquisition of knowledge Ability

Active Learning Passive Learning Active Learning 1. Think 1. Acquisition of knowledge Ability 2. Decision making 2. Application of knowledge 3. Explain/communicate 1. Deep learning Approach to Uni-directional 2. Interactive Learning

282 views • 5 slides
Hardware Design with VHDL Finite State Machines ECE 443 Finite State Machines FSMs are

Hardware Design with VHDL Finite State Machines ECE 443 Finite State Machines FSMs are

Hardware Design with VHDL Finite State Machines ECE 443 Finite State Machines FSMs are sequential machines with "random" next-state logic Used to implement functions that are realized by carrying out a sequence of steps -- commonly

794 views • 65 slides
12.1 Active Learning: A Review When learning, it may be the case that getting the true labels of

12.1 Active Learning: A Review When learning, it may be the case that getting the true labels of

CS/CNS/EE 253: Advanced Topics in Machine Learning Topic: Active Learning Review and Kernel Methods Lecturer: Andreas Krause Scribe: Jonathan Krause Date: Feb. 17, 2010 12.1 Active Learning: A Review When learning, it may be the case that getting

213 views • 5 slides
Predator and Prey: Active Learning Is Social Learning Kenneth Ronkowitz Active Learning

Predator and Prey: Active Learning Is Social Learning Kenneth Ronkowitz Active Learning

Predator and Prey: Active Learning Is Social Learning Kenneth Ronkowitz Active Learning Symposium, Rutgers University, May 15, 2018 Typically part of the curriculum in biology, phrenology, biology, anatomy, craniometry, physiognomy, crime

484 views • 14 slides
Learning Loss for Active Learning Rymarczyk D., Zieliski B., Tabor J., Sadowski M., Titov M.

Learning Loss for Active Learning Rymarczyk D., Zieliski B., Tabor J., Sadowski M., Titov M.

Learning Loss for Active Learning Rymarczyk D., Zieliski B., Tabor J., Sadowski M., Titov M. Agenda 1. Active Learning introduction 2. Base methods in AL for Deep Learning 3. Learning Loss for Active Learning 4. Our ideas for Active

802 views • 43 slides
Finite State Machines Finite State Machines Often AI as agents: sense , think , then act

Finite State Machines Finite State Machines Often AI as agents: sense , think , then act

3/24/2016 Finite State Machines Finite State Machines Often AI as agents: sense , think , then act But many different rules for agents Ex: sensing, thinking and acting when fighting , running , exploring Can be difficult to

299 views • 5 slides
Lecture 4 Finite State Machines 1 9/18/2020 Modeling Finite State Machines (FSMs)

Lecture 4 Finite State Machines 1 9/18/2020 Modeling Finite State Machines (FSMs)

Lecture 4 Finite State Machines 1 9/18/2020 Modeling Finite State Machines (FSMs) Manual FSM design & synthesis process: 1. Design state diagram (behavior) 2. Derive state table 3. Reduce state table 4. Choose a state

533 views • 35 slides
Lecture 4 Finite State Machines 1 9/26/2019 Modeling Finite State Machines (FSMs)

Lecture 4 Finite State Machines 1 9/26/2019 Modeling Finite State Machines (FSMs)

Lecture 4 Finite State Machines 1 9/26/2019 Modeling Finite State Machines (FSMs) Manual FSM design & synthesis process: 1. Design state diagram (behavior) 2. Derive state table 3. Reduce state table 4. Choose a state

531 views • 29 slides
s c a l e Marc Witteman Croatian Summer school 2017 Attack exploitation space: time vs distance

s c a l e Marc Witteman Croatian Summer school 2017 Attack exploitation space: time vs distance

When Hardware Attacks s c a l e Marc Witteman Croatian Summer school 2017 Attack exploitation space: time vs distance Remote key brute software protocol force relay attack side Fast Slow mitm channel Hardware attacks require:

688 views • 25 slides
Effective Useful Life Study (Group A, Deliverable 16) ERICA PETROFSKY (EPF@CPUC.CA.GOV) CA

Effective Useful Life Study (Group A, Deliverable 16) ERICA PETROFSKY (EPF@CPUC.CA.GOV) CA

Effective Useful Life Study (Group A, Deliverable 16) ERICA PETROFSKY (EPF@CPUC.CA.GOV) CA PUBLIC UTILITIES COMMISSION ENERGY DIVISION ENERGY EFFICIENCY BRANCH Presentation Agenda Contract language Timeline Measure selection process

130 views • 12 slides
New Hampshire EM&V Working Group January 23, 2018 EM&V Functions and Activities EM&V

New Hampshire EM&V Working Group January 23, 2018 EM&V Functions and Activities EM&V

New Hampshire EM&V Working Group January 23, 2018 EM&V Functions and Activities EM&V Other Functions/Activities Regulatory, Implementation EM&V planning, scoping, Policy, Planning contract oversight Program design EM&V

706 views • 11 slides
Passive learning Identifying system behavior from observations, and representing it in the smallest

Passive learning Identifying system behavior from observations, and representing it in the smallest

Passive learning Identifying system behavior from observations, and representing it in the smallest possible model. 20170101160001 Adyen version: ****** 20170101160001 Adyen version: ****** 20170101160002 Starting TX/amt=10001/currency=978

153 views • 4 slides
Decision Theory III (MATH 3071) Lecture 4 2017/18 Expected Money Value Expected Money Value

Decision Theory III (MATH 3071) Lecture 4 2017/18 Expected Money Value Expected Money Value

Decision Theory III (MATH 3071) Lecture 4 2017/18 Expected Money Value Expected Money Value (EMV) is the expectation of a random quantity that involves money. Expected Money Value Under Certainty (EMVUC) is the expected return if perfect

417 views • 9 slides
Genericity of a model- based intrusion testing method Aymerick Savary 1,2 , Mathieu Lassale 1,2

Genericity of a model- based intrusion testing method Aymerick Savary 1,2 , Mathieu Lassale 1,2

Genericity of a model- based intrusion testing method Aymerick Savary 1,2 , Mathieu Lassale 1,2 Jean-Louis Lanet 1 , Marc Frappier 2 SDTA, december 2014, Auvergne, France 1 Universit de Limoges 2 Universit de Sherbrooke Genericity of a

404 views • 24 slides
Overview What are multilevel models? Linear mixed models Symbolic and numeric phases

Overview What are multilevel models? Linear mixed models Symbolic and numeric phases

Overview What are multilevel models? Linear mixed models Symbolic and numeric phases Generalized and nonlinear mixed models Examples Multilevel Models in R: Present & Future Douglas M. Bates U of Wisconsin - Madison,

431 views • 8 slides
Uncertainty and Utilities School of Data Science, Fudan

Uncertainty and Utilities School of Data Science, Fudan

DATA130008 Introduction to Artificial Intelligence Uncertainty and Utilities School of Data Science, Fudan University March 20 th , 2019 Uncertain Outcomes Worst-Case vs. Average Case max min 10 10 9

669 views • 32 slides

More recommend