A Framework for. Security Analysis. with Team Automata
|
|
- Beatrice Bates
- 5 years ago
- Views:
Transcription
1 A Framework for Security Analysis with Team Automata Marinella Petrocchi Istituto di Informatica e Telematica National Research Council IIT-CNR Pisa, Italy Tuesday 8 June 2004 DIMACS with Maurice ter Beek and Gabriele Lenzini (ISTI-CNR, Italy) (U. Twente, Netherlands)
2 Outline Team Automata (TA): origins, foundations, and examples TA applied to security analysis: origins and inspiration an insecure communication scenario Generalized Non Deducibility on Compositions (GNDC) from process algebras to TA compositional result for the insecure scenario Case study: integrity of EMSS protocol Conclusions and future work 2
3 Origins of TA Ellis informally introduced TA at ACM GROUP 97 (Team Automata for Groupware Systems) as an extension of the I/O automata (IOA) of Lynch & Tuttle, namely: TA are not required to be input-enabled TA may synchronize on output actions no fixed method of composition for TA Series of papers and Ph.D. thesis of ter Beek show that the usefulness of TA is not limited to modeling groupware, but: extends to modeling collaboration in reactive, distributed systems in general! 3
4 Foundations of TA model logical architecture of system design abstract from concrete data and actions describe behavior in terms of - state-action diagram (automaton) - role of actions (input, output, internal) - synchronizations (simultaneous execution of shared actions) crux: automata composition! + flexible (role of actions, choice of transitions) + scalable (modular construction, iteration) + extendible (time, probabilities, priorities) + verifiable (automata-theoretic results) no tool (yet) 4
5 Example TA over Component Automata C 1 : a, b external actions b a q 1 q 1 C 2 : b a q 2 q 2 TA T free & T ai over the composable system {C 1, C 2 } defined by choosing their transitions! T free : T ai : ( q1 q 2 ) b b ( q 1 q 2 ) ( q1 q 2 ) a ( q 1 q 2 ) a ( q1 q 2 ) a a a ( q 1 q 2 ) ( q1 q 2 ) b ( q 1 q 2 ) T ai = {C 1, C 2 } = composition like that of IOA every TA is a component automaton! 5
6 TA Applied to Security Analysis ter Beek et al. first applied TA to security at ECSCW 01 (Team Automata for Spatial Access Control) by specifying and analyzing a variety of access control strategies Inspired by Lynch approach to use IOA for specifying and analyzing (cryptographic) communication protocols at CSFW 99 (I/O Automaton Models and Proofs for Shared-Key Communication Systems) we started to apply TA in the same direction at WISP 03 (Team Automata for Security Analysis of Multicast/Broadcast Communication) which meanwhile has been extended and led to (A Framework for Security Analysis with Team Automata) 6
7 An Insecure Communication Scenario An informal description of TA by their interactions: {Reveal} assertions T S {Pub} {Pub } {Reveal } send/receive eavesdrop {Eve} T IC send/receive inject {Eve } T R T P assertions T X T I T IC insecure channel T S initiator Σ S com to communicate with T IC T R responder Σ R com to communicate with T IC T X intruder Σ I com to communicate with T IC Σ S com Σ R com Σ I com = Σ P com = Σ S com Σ R com T P = hide Σ P com ( {T S, T R, T IC }) secure and T I = hide Σ I com ( {T P, T X }) insecure scenario 7
8 Generalized Non Deducibility on Compositions (GNDC) P GNDC α(p ) iff (P Top φ C )\C α(p ) P term of a process algebra, modeling a system running in isolation behavioral relation (trace inclusion) α(p ) the expected (correct) behavior of P Top φ C term modeling the most general intruder φ the (bounded) initial knowledge of Top φ C C channels used by Top φ C to interact with P parallel composition operator ( )\C restriction to communication over channels other than C 8
9 GNDC in Terms of TA T P GNDC α(t P) iff O C hide C ( {T P,Top φ C }) α(t P) T P TA modeling secure communication scenario behavioral inclusion (set of traces/language) α(t P ) the expected (correct) behavior of T P Top φ C TA modeling the most general intruder φ the (bounded) initial knowledge of Top φ C C actions used by Top φ C to interact with T P {T P,Top φ C } (as before) composition like IOA hide C (T ) (as before) hides external actions C (as internal actions) of a TA T O C T observational behavior of a TA T (w.r.t. actions not in C) 9
10 Compositionality Compositional reasoning, useful for identifying sub-problems and separately treated them evaluating (security) properties over sub-components asserting the properties validity over the whole system (e.g., using theorems about automata composition) other... We decompose the insecure communication scenario, and... Result: the observational behaviour of the overall system is the shuffle of the observational behaviours of the sub-components! 10
11 Compositional Result for Insecure Scenario Recall: Σ P com = all public send/receive actions Let T 1 = hide Σ P com ( {T S, T IC }) and T 2 = hide Σ P com ( {T R, T IC }) Theorem: if T 1 GNDC OC T 1 and T 2 GNDC OC T 2 then {T 1, T 2 } GNDC {Σ T 1,Σ T 2 } {OC T 1,O C T 2 }, {Σ1,Σ 2 } {L 1, L 2 } full synchronized shuffle of language L i over alphabet Σ i Example: if L 1 ={abc} Σ 1 ={a, b, c} and L 2 = {cd} Σ 2 = {c, d}, then abc Σ1 Σ2 cd = {abcd} (i.e. words must synchronize on Σ 1 Σ 2 = {c}) shuffle/free interleaving: {abccd, acbcd, cdabc,...} 11
12 Case Study: Integrity of EMSS Protocol S P 0 {R n n 1} P 0 = m 0,, S P 1 {R n n 1} P 1 = m 1, h(p 0 ), S P i {R n n 1} P i = m i, h(p i 1 ), h(p i 2 ) 2 i last S P sign {R n n 1} P sign = {h(p last ), h(p last 1 )} sk(s) modeling sender and receiver as TA T S, T R embed T S, T R in the insecure communication scenario defining integrity as the ability of T R to to accept a message m i only as the ith message sent by T S evaluating the property over two subcomponents applying compositionality allowed us to prove that integrity is guaranteed in the EMSS protocol! 12
13 Conclusions and Future Work What has been done: Security analysis with TA by defining an insecure communication scenario reformulating GNDC in terms of TA formulating some effective compositional analysis strategies What we would like to do: extend the analysis to other security properties try to automate the currently manual specification and verification of properties promote TA for security analysis! :) Questions & suggestions are welcome! 13
14 Component Automaton C = (Q, (Σ inp, Σ out, Σ int ), δ, I) Q set of states Σ = Σ inp Σ out Σ int alphabet (a partition!) a δ Q Σ Q transition relation q q I Q set of initial states (q, q ) δ a Σ inp input actions Σ out output actions Σ int internal actions } Σ ext externally observable cannot be observed Composable System a set S = {C 1,..., C n } of component automata is a composable system if i {1,..., n}: Σ i,int j {1,...,n}\{i} Σ j = 14
15 Complete Transition Space The complete transition space of a Σ = i {1,...,n} (Σ i,inp Σ i,out Σ i,int ) in S is a (S) = {(q, q ) i {1,...,n} Q i i {1,...,n} Q i j {1,..., n} : (proj j (q), a, proj j (q )) δ j i {1,..., n} : (proj i (q), a, proj i (q )) δ i proj i (q) = proj i (q )} in every team transition at least 1 component acts according to its transition relation all other components either join or are idle 15
16 Transition Space of TA a (S) a Σ δ a the choices of team transition relations δ a, a Σ, define a specific TA! 16
17 Team Automaton T = ( Q i, (Σ inp, Σ out, Σ int ), δ, i {1,...,n} i {1,...,n} I i ) is a TA composed over composable system S if Σ int = i {1,...,n} Σ i,int Σ out = i {1,...,n} Σ i,out Σ inp = ( i {1,...,n} Σ i,inp) \ Σ out = Σ δ i {1,...,n} Q i Σ i {1,...,n} Q i such that a Σ δ a a (S) and δ a = a (S) if a Σ int every TA is a component automaton! 17
Component-Interaction Automata as a Verification-Oriented Component-Based System Specification
Component-Interaction Automata as a Verification-Oriented Component-Based System Specification Luboš Brim, Ivana Černá, Pavlína Vařeková, Barbora Zimmerova Faculty of Informatics Masaryk University, Brno
More informationSynchronizations in Team Automata for Groupware Systems
Computer Supported Cooperative Work 12: 21 69, 2003. 2003 Kluwer Academic Publishers. Printed in the Netherlands. 21 Synchronizations in Team Automata for Groupware Systems MAURICE H. TER BEEK 1, CLARENCE
More informationAlgebraic Trace Theory
Algebraic Trace Theory EE249 Presented by Roberto Passerone Material from: Jerry R. Burch, Trace Theory for Automatic Verification of Real-Time Concurrent Systems, PhD thesis, CMU, August 1992 October
More informationAlgebraic Trace Theory
Algebraic Trace Theory EE249 Roberto Passerone Material from: Jerry R. Burch, Trace Theory for Automatic Verification of Real-Time Concurrent Systems, PhD thesis, CMU, August 1992 October 21, 2002 ee249
More informationAngelo Troina. Joint work with: Ruggero Lanotte (University of Insubria at Como) Andrea Maggiolo Schettini (University of Pisa)
Angelo Troina Dipartimento di Informatica, Università di Pisa, Italy Probabilistic Joint work with: Ruggero Lanotte (University of Insubria at Como) Andrea Maggiolo Schettini (University of Pisa) 1/23
More informationFormal Methods for Specifying and Verifying Distributed Algorithms Process Algebra vs I/O Automata
Formal Methods for Specifying and Verifying Distributed Algorithms Process Algebra vs I/O Automata Marina Gelastou, Chryssis Georgiou and Anna Philippou Department of Computer Science, University of Cyprus,
More informationPartial model checking via abstract interpretation
Partial model checking via abstract interpretation N. De Francesco, G. Lettieri, L. Martini, G. Vaglini Università di Pisa, Dipartimento di Ingegneria dell Informazione, sez. Informatica, Via Diotisalvi
More informationReachability Results for Timed Automata with Unbounded Data Structures
Acta Informatica manuscript No. (will be inserted by the editor) Reachability Results for Timed Automata with Unbounded Data Structures Ruggero Lanotte Andrea Maggiolo-Schettini Angelo Troina Received:
More informationProtocol Insecurity with a Finite Number of Sessions and Composed Keys is NP-complete
Protocol Insecurity with a Finite Number of Sessions and Composed Keys is NP-complete Michaël Rusinowitch and Mathieu Turuani LORIA-INRIA- Université Henri Poincaré, 54506 Vandoeuvre-les-Nancy cedex, France
More informationSeamless Model Driven Development and Tool Support for Embedded Software-Intensive Systems
Seamless Model Driven Development and Tool Support for Embedded Software-Intensive Systems Computer Journal Lecture - 22nd June 2009 Manfred Broy Technische Universität München Institut für Informatik
More informationAutomata-based analysis of recursive cryptographic protocols
1 Automata-based analysis of recursive cryptographic protocols Thomas Wilke Joint work with Ralf Küsters Christian-Albrechts-Universität zu Kiel June 13, 2004 Un-/Decidability of security in the DY model
More informationProbabilistic Model Checking of Security Protocols without Perfect Cryptography Assumption
Our Model Checking of Security Protocols without Perfect Cryptography Assumption Czestochowa University of Technology Cardinal Stefan Wyszynski University CN2016 Our 1 2 3 Our 4 5 6 7 Importance of Security
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationEE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories. Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo
EE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories 1 Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo Outline: Contracts and compositional methods for system design Where and why using
More informationTrace Refinement of π-calculus Processes
Trace Refinement of pi-calculus Processes Trace Refinement of π-calculus Processes Manuel Gieseking manuel.gieseking@informatik.uni-oldenburg.de) Correct System Design, Carl von Ossietzky University of
More informationThe Expressivity of Universal Timed CCP: Undecidability of Monadic FLTL and Closure Operators for Security
The Expressivity of Universal Timed CCP: Undecidability of Monadic FLTL and Closure Operators for Security Carlos Olarte and Frank D. Valencia INRIA /CNRS and LIX, Ecole Polytechnique Motivation Concurrent
More informationHybrid I/O Automata. Nancy Lynch, MIT Roberto Segala, University of Verona Frits Vaandrager, University of Nijmegen.
Hybrid I/O Automata Nancy Lynch, MIT Roberto Segala, University of Verona Frits Vaandrager, University of Nijmegen http://www.cs.kun.nl/~fvaan I/O Automata (Lynch & Tuttle, 87; Jonsson 87) Purpose Formal
More informationDecentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication
Decentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication Stavros Tripakis Abstract We introduce problems of decentralized control with communication, where we explicitly
More informationProbabilistic Model Checking and Strategy Synthesis for Robot Navigation
Probabilistic Model Checking and Strategy Synthesis for Robot Navigation Dave Parker University of Birmingham (joint work with Bruno Lacerda, Nick Hawes) AIMS CDT, Oxford, May 2015 Overview Probabilistic
More informationAn Algebraic Theory of Interface Automata
An Algebraic Theory of Interface Automata Chris Chilton a, Bengt Jonsson b, Marta Kwiatkowska a a Department of Computer Science, University of Oxford, UK b Department of Information Technology, Uppsala
More informationMonotonic Abstraction in Parameterized Verification
Monotonic Abstraction in Parameterized Verification Parosh Aziz Abdulla 1 Department of Information Technology Uppsala University Sweden Giorgio Delzanno 2 Dipartimento Informatica e Scienze dell Informazione
More informationLecture th January 2009 Fall 2008 Scribes: D. Widder, E. Widder Today s lecture topics
0368.4162: Introduction to Cryptography Ran Canetti Lecture 11 12th January 2009 Fall 2008 Scribes: D. Widder, E. Widder Today s lecture topics Introduction to cryptographic protocols Commitments 1 Cryptographic
More informationCompositional Abstractions for Interacting Processes
Proceedings of the International Multiconference on Computer Science and Information Technology pp. 745 754 ISSN 1896-7094 c 2007 PIPS Compositional Abstractions for Interacting Processes Maciej Koutny
More informationStatic Program Analysis using Abstract Interpretation
Static Program Analysis using Abstract Interpretation Introduction Static Program Analysis Static program analysis consists of automatically discovering properties of a program that hold for all possible
More informationTimo Latvala. March 7, 2004
Reactive Systems: Safety, Liveness, and Fairness Timo Latvala March 7, 2004 Reactive Systems: Safety, Liveness, and Fairness 14-1 Safety Safety properties are a very useful subclass of specifications.
More informationLiveness in Timed and Untimed Systems. Abstract. and its timed version have been used successfully, but have focused on safety conditions and
Liveness in Timed and Untimed Systems Roberto Segala y Rainer Gawlick z Jrgen Sgaard-Andersen x Nancy Lynch { Abstract When proving the correctness of algorithms in distributed systems, one generally considers
More informationSpecifying and Verifying Systems of Communicating Agents in a Temporal Action Logic
Specifying and Verifying Systems of Communicating Agents in a Temporal Action Logic Laura Giordano 1, Alberto Martelli 2, Camilla Schwind 3 1 Dipartimento di Informatica, Università del Piemonte Orientale,
More informationLecture 4 Event Systems
Lecture 4 Event Systems This lecture is based on work done with Mark Bickford. Marktoberdorf Summer School, 2003 Formal Methods One of the major research challenges faced by computer science is providing
More informationThe Underlying Semantics of Transition Systems
The Underlying Semantics of Transition Systems J. M. Crawford D. M. Goldschlag Technical Report 17 December 1987 Computational Logic Inc. 1717 W. 6th St. Suite 290 Austin, Texas 78703 (512) 322-9951 1
More informationA framework based on implementation relations for implementing LOTOS specifications
Published in: Computer Networks and ISDN Systems, 25 (1992), 23-41 A framework based on implementation relations for implementing LOTOS specifications Guy Leduc Research Associate of the National Fund
More informationUndecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae XXI (2001) 1001 1025 1001 IOS Press Undecidability Results for Timed Automata with Silent Transitions Patricia Bouyer LSV, ENS Cachan, CNRS, France bouyer@lsv.ens-cachan.fr Serge
More informationHoming and Synchronizing Sequences
Homing and Synchronizing Sequences Sven Sandberg Information Technology Department Uppsala University Sweden 1 Outline 1. Motivations 2. Definitions and Examples 3. Algorithms (a) Current State Uncertainty
More informationFrom Featured Transition Systems to Modal Transition Systems with Variability Constraints: A Model Transformation
From Featured Transition Systems to Modal Transition Systems with Variability Constraints: A Model Transformation Maurice ter Beek, Stefania Gnesi & Franco Mazzanti Formal Methods and Tools lab, ISTI-CNR,
More informationAutomatic Synthesis of Distributed Protocols
Automatic Synthesis of Distributed Protocols Rajeev Alur Stavros Tripakis 1 Introduction Protocols for coordination among concurrent processes are an essential component of modern multiprocessor and distributed
More informationTESTING is one of the most important parts of the
IEEE TRANSACTIONS 1 Generating Complete Controllable Test Suites for Distributed Testing Robert M. Hierons, Senior Member, IEEE Abstract A test suite is m-complete for finite state machine (FSM) M if it
More informationA logical framework to deal with variability
A logical framework to deal with variability (research in progress) M.H. ter Beek joint work with P. Asirelli, A. Fantechi and S. Gnesi ISTI CNR Università di Firenze XXL project meeting Pisa, 21 June
More informationClasses and conversions
Classes and conversions Regular expressions Syntax: r = ε a r r r + r r Semantics: The language L r of a regular expression r is inductively defined as follows: L =, L ε = {ε}, L a = a L r r = L r L r
More informationNotes on BAN Logic CSG 399. March 7, 2006
Notes on BAN Logic CSG 399 March 7, 2006 The wide-mouthed frog protocol, in a slightly different form, with only the first two messages, and time stamps: A S : A, {T a, B, K ab } Kas S B : {T s, A, K ab
More informationSemi-Automatic Distributed Synthesis
Semi-Automatic Distributed Synthesis Bernd Finkbeiner and Sven Schewe Universität des Saarlandes, 66123 Saarbrücken, Germany {finkbeiner schewe}@cs.uni-sb.de Abstract. We propose a sound and complete compositional
More informationMath 299 Supplement: Modular Arithmetic Nov 8, 2013
Math 299 Supplement: Modular Arithmetic Nov 8, 2013 Numbers modulo n. We have previously seen examples of clock arithmetic, an algebraic system with only finitely many numbers. In this lecture, we make
More informationDecentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication 1
Decentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication 1 Stavros Tripakis 2 VERIMAG Technical Report TR-2004-26 November 2004 Abstract We introduce problems of decentralized
More information6.852: Distributed Algorithms Fall, Class 10
6.852: Distributed Algorithms Fall, 2009 Class 10 Today s plan Simulating synchronous algorithms in asynchronous networks Synchronizers Lower bound for global synchronization Reading: Chapter 16 Next:
More informationModelling and Analysing Variability in Product Families
Modelling and Analysing Variability in Product Families Maurice H. ter Beek ISTI CNR, Pisa, Italy joint work with P. Asirelli A. Fantechi S. Gnesi ISTI CNR University of Florence ISTI CNR University of
More informationMSR 3.0: The Logical Meeting Point of Multiset Rewriting and Process Algebra. Iliano Cervesato. ITT Industries, NRL Washington, DC
MSR 3.0: The Logical Meeting Point of Multiset Rewriting and Process Algebra Iliano Cervesato iliano@itd.nrl.navy.mil ITT Industries, inc @ NRL Washington, DC http://theory.stanford.edu/~iliano ISSS 2003,
More informationFormal Verification of Mobile Network Protocols
Dipartimento di Informatica, Università di Pisa, Italy milazzo@di.unipi.it Pisa April 26, 2005 Introduction Modelling Systems Specifications Examples Algorithms Introduction Design validation ensuring
More informationModels of Concurrency
Models of Concurrency GERARDO SCHNEIDER UPPSALA UNIVERSITY DEPARTMENT OF INFORMATION TECHNOLOGY UPPSALA, SWEDEN Thanks to Frank Valencia Models of Concurrency p.1/57 Concurrency is Everywhere Concurrent
More informationFormal Methods in Software Engineering
Formal Methods in Software Engineering Modeling Prof. Dr. Joel Greenyer October 21, 2014 Organizational Issues Tutorial dates: I will offer two tutorial dates Tuesdays 15:00-16:00 in A310 (before the lecture,
More informationSupervisory Control: Advanced Theory and Applications
Supervisory Control: Advanced Theory and Applications Dr Rong Su S1-B1b-59, School of EEE Nanyang Technological University Tel: +65 6790-6042, Email: rsu@ntu.edu.sg EE6226, Discrete Event Systems 1 Introduction
More informationFinite State Machines 2
Finite State Machines 2 Joseph Spring School of Computer Science 1COM0044 Foundations of Computation 1 Discussion Points In the last lecture we looked at: 1. Abstract Machines 2. Finite State Machines
More information7. Queueing Systems. 8. Petri nets vs. State Automata
Petri Nets 1. Finite State Automata 2. Petri net notation and definition (no dynamics) 3. Introducing State: Petri net marking 4. Petri net dynamics 5. Capacity Constrained Petri nets 6. Petri net models
More informationThe Discrete EVent System specification (DEVS) formalism
The Discrete EVent System specification (DEVS) formalism Hans Vangheluwe The DEVS formalism was conceived by Zeigler [Zei84a, Zei84b] to provide a rigourous common basis for discrete-event modelling and
More informationProcess Algebras and Concurrent Systems
Process Algebras and Concurrent Systems Rocco De Nicola Dipartimento di Sistemi ed Informatica Università di Firenze Process Algebras and Concurrent Systems August 2006 R. De Nicola (DSI-UNIFI) Process
More informationWeighted Context-Free Grammars over Bimonoids
Weighted Context-Free Grammars over Bimonoids George Rahonis and Faidra Torpari Aristotle University of Thessaloniki, Greece WATA 2018 Leipzig, May 22, 2018 Faidra Torpari (Aristotle University of Thessaloniki)
More informationA simple procedure for finding guessing attacks (Extended Abstract)
A simple procedure for finding guessing attacks (Extended Abstract) Ricardo Corin 1 and Sandro Etalle 1,2 1 Dept. of Computer Science, University of Twente, The Netherlands 2 CWI, Center for Mathematics
More informationOn Supervisory Control of Concurrent Discrete-Event Systems
On Supervisory Control of Concurrent Discrete-Event Systems Yosef Willner Michael Heymann March 27, 2002 Abstract When a discrete-event system P consists of several subsystems P 1,..., P n that operate
More informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
More informationA Compositional Approach to Bisimulation of Arenas of Finite State Machines
A Compositional Approach to Bisimulation of Arenas of Finite State Machines Giordano Pola, Maria D. Di Benedetto and Elena De Santis Department of Electrical and Information Engineering, Center of Excellence
More informationComputer-Aided Program Design
Computer-Aided Program Design Spring 2015, Rice University Unit 3 Swarat Chaudhuri February 5, 2015 Temporal logic Propositional logic is a good language for describing properties of program states. However,
More informationRecent results on Timed Systems
Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.
More informationA Brief Introduction to Model Checking
A Brief Introduction to Model Checking Jan. 18, LIX Page 1 Model Checking A technique for verifying finite state concurrent systems; a benefit on this restriction: largely automatic; a problem to fight:
More informationDISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES
DISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES Maxim Gromov 1, Khaled El-Fakih 2, Natalia Shabaldina 1, Nina Yevtushenko 1 1 Tomsk State University, 36 Lenin Str.. Tomsk, 634050, Russia gromov@sibmail.com,
More informationExtending Dolev-Yao with Assertions
Extending Dolev-Yao with Assertions Vaishnavi Sundararajan Chennai Mathematical Institute FOSAD 2015 August 31, 2015 (Joint work with R Ramanujam and S P Suresh) Vaishnavi S Extending Dolev-Yao with Assertions
More informationModels and analysis of security protocols 1st Semester Security Protocols Lecture 6
Models and analysis of security protocols 1st Semester 2010-2011 Security Protocols Lecture 6 Pascal Lafourcade Université Joseph Fourier, Verimag Master: October 18th 2010 1 / 46 Last Time (I) Symmetric
More informationInductive Data Flow Graphs
Inductive Data Flow Graphs Azadeh Farzan University of Toronto Zachary Kincaid Andreas Podelski University of Freiburg Abstract The correctness of a sequential program can be shown by the annotation of
More informationRefinement and Asynchronous Composition of Modal Petri Nets
Refinement and Asynchronous Composition of Modal Petri Nets Dorsaf Elhog-Benzina 1, Serge Haddad 1, and Rolf Hennicker 2 1 LSV, CNRS & Ecole Normale Supérieure de Cachan 94235 CACHAN, 61 avenue du Président
More informationGenerating Linear Temporal Logic Formulas for Pattern-Based Specifications
Generating Linear Temporal Logic Formulas for Pattern-Based Specifications Salamah Salamah, Vladik Kreinovich, and Ann Q. Gates Dept. of Computer Science, University of Texas at El Paso El Paso, TX 79968,
More informationRobustness Analysis of Networked Systems
Robustness Analysis of Networked Systems Roopsha Samanta The University of Texas at Austin Joint work with Jyotirmoy V. Deshmukh and Swarat Chaudhuri January, 0 Roopsha Samanta Robustness Analysis of Networked
More information6.852: Distributed Algorithms Fall, Class 8
6.852: Distributed Algorithms Fall, 2009 Class 8 Today s plan Basic asynchronous system model, continued Hierarchical proofs Safety and liveness properties Asynchronous networks Asynchronous network algorithms:
More informationFinite-State Machines (Automata) lecture 12
Finite-State Machines (Automata) lecture 12 cl a simple form of computation used widely one way to find patterns 1 A current D B A B C D B C D A C next 2 Application Fields Industry real-time control,
More informationScalable and Accurate Verification of Data Flow Systems. Cesare Tinelli The University of Iowa
Scalable and Accurate Verification of Data Flow Systems Cesare Tinelli The University of Iowa Overview AFOSR Supported Research Collaborations NYU (project partner) Chalmers University (research collaborator)
More informationMethods for the specification and verification of business processes MPB (6 cfu, 295AA)
Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Roberto Bruni http://www.di.unipi.it/~bruni 20 - Workflow modules 1 Object We study Workflow modules to model interaction
More informationComplex Systems Design & Distributed Calculus and Coordination
Complex Systems Design & Distributed Calculus and Coordination Concurrency and Process Algebras: Theory and Practice Francesco Tiezzi University of Camerino francesco.tiezzi@unicam.it A.A. 2014/2015 F.
More informationAsynchronous Communication 2
Asynchronous Communication 2 INF4140 22.11.12 Lecture 11 INF4140 (22.11.12) Asynchronous Communication 2 Lecture 11 1 / 37 Overview: Last time semantics: histories and trace sets specification: invariants
More informationSemantic Families for Cyber-physical Systems
Semantic Families for Cyber-physical Systems Jan Peleska University of Bremen Verified Systems International GmbH jp@cs.uni-bremen.de 2015-12-07 BCS FACS - Annual Peter Landin Semantics Seminar 2015 Overview
More informationPRISM An overview. automatic verification of systems with stochastic behaviour e.g. due to unreliability, uncertainty, randomisation,
PRISM An overview PRISM is a probabilistic model checker automatic verification of systems with stochastic behaviour e.g. due to unreliability, uncertainty, randomisation, Construction/analysis of probabilistic
More informationSemi-asynchronous. Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER
Semi-asynchronous Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER 2017 NC A&T State University http://www.ncat.edu/ Alejandro White Semi-asynchronous http://techlav.ncat.edu/
More informationContracts-refinement proof system for component-based embedded systems
Contracts-refinement proof system for component-based embedded systems Alessandro Cimatti a, Stefano Tonetta a a Fondazione Bruno Kessler, Trento, Italy Abstract Contract-based design is an emerging paradigm
More informationSynthesizing Reactive Systems from Hyperproperties
Synthesizing Reactive Systems from Hyperproperties Bernd Finkbeiner, Christopher Hahn, Philip Lukert, Marvin Stenger, and Leander Tentrup Reactive Systems Group Saarland University lastname@react.uni-saarland.de
More informationOn Equilibria of Distributed Message-Passing Games
On Equilibria of Distributed Message-Passing Games Concetta Pilotto and K. Mani Chandy California Institute of Technology, Computer Science Department 1200 E. California Blvd. MC 256-80 Pasadena, US {pilotto,mani}@cs.caltech.edu
More informationStreams and Coalgebra Lecture 2
Streams and Coalgebra Lecture 2 Helle Hvid Hansen and Jan Rutten Radboud University Nijmegen & CWI Amsterdam Representing Streams II, Lorentz Center, Leiden, January 2014 Tutorial Overview Lecture 1 (Hansen):
More informationTime-Bounding Needham-Schroeder Public Key Exchange Protocol
Time-Bounding Needham-Schroeder Public Key Exchange Protocol Max Kanovich, Queen Mary, University of London, UK University College London, UCL-CS, UK Tajana Ban Kirigin, University of Rijeka, HR Vivek
More informationFlat counter automata almost everywhere!
Flat counter automata almost everywhere! Jérôme Leroux and Grégoire Sutre Projet Vertecs, IRISA / INRIA Rennes, FRANCE Équipe MVTsi, CNRS / LABRI, FRANCE Counter-automata verification A simple counter-automata:
More informationCS61c: Representations of Combinational Logic Circuits
CS61c: Representations of Combinational Logic Circuits J. Wawrzynek March 5, 2003 1 Introduction Recall that synchronous systems are composed of two basic types of circuits, combination logic circuits,
More informationAn Automatic Test Framework for Interactive Music Systems
An Automatic Test Framework for Interactive Music Systems Florent Jacquemard, Clément Poncelet To cite this version: Florent Jacquemard, Clément Poncelet. An Automatic Test Framework for Interactive Music
More informationFinally the Weakest Failure Detector for Non-Blocking Atomic Commit
Finally the Weakest Failure Detector for Non-Blocking Atomic Commit Rachid Guerraoui Petr Kouznetsov Distributed Programming Laboratory EPFL Abstract Recent papers [7, 9] define the weakest failure detector
More informationOn closures of lexicographic star-free languages. E. Ochmański and K. Stawikowska
On closures of lexicographic star-free languages E. Ochmański and K. Stawikowska Preprint No 7/2005 Version 1, posted on April 19, 2005 On closures of lexicographic star-free languages Edward Ochma ski
More informationDifferential Privacy for Probabilistic Systems. Michael Carl Tschantz Anupam Datta Dilsun Kaynar. May 14, 2009 CMU-CyLab
Differential Privacy for Probabilistic Systems Michael Carl Tschantz Anupam Datta Dilsun Kaynar May 14, 2009 CMU-CyLab-09-008 CyLab Carnegie Mellon University Pittsburgh, PA 15213 Differential Privacy
More informationIntroduction to Model Checking. Debdeep Mukhopadhyay IIT Madras
Introduction to Model Checking Debdeep Mukhopadhyay IIT Madras How good can you fight bugs? Comprising of three parts Formal Verification techniques consist of three parts: 1. A framework for modeling
More informationLayered Composition for Timed Automata
Layered Composition for Timed Automata Ernst-Rüdiger Olderog and Mani Swaminathan Department of Computing Science University of Oldenburg, Germany {olderog, mani.swaminathan}@informatik.uni-oldenburg.de
More informationAutomated Verification of Privacy in Security Protocols:
Automated Verification of Privacy in Security Protocols: Back and Forth Between Theory & Practice LSV, ENS Paris-Saclay, Université Paris-Saclay, CNRS April 21st 2017 PhD advisors: David Baelde & Stéphanie
More informationCS256/Winter 2009 Lecture #1. Zohar Manna. Instructor: Zohar Manna Office hours: by appointment
CS256/Winter 2009 Lecture #1 Zohar Manna FORMAL METHODS FOR REACTIVE SYSTEMS Instructor: Zohar Manna Email: manna@cs.stanford.edu Office hours: by appointment TA: Boyu Wang Email: wangboyu@stanford.edu
More informationHierarchy among Automata on Linear Orderings
Hierarchy among Automata on Linear Orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 Abstract In a preceding paper, automata and rational
More informationDelayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds Michele Ciampi DIEM Università di Salerno ITALY mciampi@unisa.it Rafail Ostrovsky UCLA Los Angeles rafail@cs.ucla.edu
More informationSeparating regular languages by piecewise testable and unambiguous languages
Separating regular languages by piecewise testable and unambiguous languages Thomas Place, Lorijn van Rooijen, Marc Zeitoun LaBRI Univ. Bordeaux CNRS September, 2013 Highlights of Logic, Games and Automata
More informationSoftware Verification with Abstraction-Based Methods
Software Verification with Abstraction-Based Methods Ákos Hajdu PhD student Department of Measurement and Information Systems, Budapest University of Technology and Economics MTA-BME Lendület Cyber-Physical
More informationCompositionality for Probabilistic Automata
Compositionality for Probabilistic Automata Nancy Lynch 1, Roberto Segala 2, and Frits Vaandrager 3 1 MIT Laboratory for Computer Science Cambridge, MA 02139, USA lynch@theory.lcs.mit.edu 2 Dipartimento
More informationModels for Efficient Timed Verification
Models for Efficient Timed Verification François Laroussinie LSV / ENS de Cachan CNRS UMR 8643 Monterey Workshop - Composition of embedded systems Model checking System Properties Formalizing step? ϕ Model
More informationConsistent Global States of Distributed Systems: Fundamental Concepts and Mechanisms. CS 249 Project Fall 2005 Wing Wong
Consistent Global States of Distributed Systems: Fundamental Concepts and Mechanisms CS 249 Project Fall 2005 Wing Wong Outline Introduction Asynchronous distributed systems, distributed computations,
More informationAutomated Compositional Analysis for Checking Component Substitutability
Automated Compositional Analysis for Checking Component Substitutability Nishant Sinha December 2007 Electrical and Computer Engineering Department Carnegie Mellon University Pittsburgh, PA 15213 Thesis
More informationCompositionality in SLD-derivations and their abstractions Marco Comini, Giorgio Levi and Maria Chiara Meo Dipartimento di Informatica, Universita di
Compositionality in SLD-derivations and their abstractions Marco Comini Giorgio Levi and Maria Chiara Meo Dipartimento di Informatica Universita di Pisa Corso Italia 40 56125 Pisa Italy fcomini levi meog@di.unipi.it
More information