DOCSLIB.ORG

Toward Online Verification of Client Behavior in Distributed Applications Robby Cochran Mike Reiter

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Toward Online Verification of Client Behavior in Distributed Applications Robby Cochran Mike Reiter Toward Online Verification of Client Behavior in Distributed Applications Robby Cochran Mike Reiter University of North Carolina at Chapel Hill NDSS 2013 CLIENT SERVER Is this message from an unmodified client? VERIFIER 2 Goals . Detect if client messages are consistent with the sanctioned client software … • Adversary might modify binary/memory • or rewrite message on the wire . … Much more quickly than previous work . Ideally we would do so online… 3 CLIENT SERVER CONTROL FLOW MODEL OF CLIENT [Giffin et al. 2002] [Guha et al. 2009] 4 CLIENT SERVER USER CLIENT INPUT REPLICA [Vikram et al. 2009] 5 CLIENT SERVER OFFLINE MESSAGE LOG VERIFIER [Bethea et al. 2010] 6 CLIENT SERVER ONLINE MESSAGE QUEUE VERIFIER 7 Introduction . Existing techniques to verify client behavior • Imprecise • Increase bandwidth usage • Computationally expensive . Our method • Precise: no false negatives and no false positives • No additional bandwidth required • Validates most legitimate behavior faster than previous techniques 8 Overview . Introduction . Symbolic Execution . Key Insight #1: Common Case Optimization . Key Insight #2: Guided Search with History . Case Studies . Conclusion 9 Symbolic Execution [Boyer 1975] . A way of deriving X the effects of a given program on a X <= 0 X > 0 given system X > 10 0 < X < 10 • Constraints on input are constructed based on each execution path . Built on top of KLEE [Cadar et al. 2008] 10 Symbolic Environment How can we use symbolic execution to verify a message? 1 loc = 0 2 while true do 3 key = symbolicReadKeyreadKey() () 4 if key == ESC then 5 sendQuitMsg() 6 else if key == UP then 7 loc = loc + 1 8 else if key == DN then 9 loc = loc – 1 10 end if 11 sendMsg(loc) 12 end while 11 Symbolic Environment Symbolic State Execution Prefix loc == 0 ∧ 1,2,3,4,5 1 loc = 0 key == ESC 2 while true do 3 key = symbolicReadKey() 4 if key == ESC then 5 sendQuitMsg() 6 else if key == UP then 7 loc = loc + 1 8 else if key == DN then 9 loc = loc – 1 10 end if 11 sendMsg(loc) 12 end while 12 Symbolic Environment Symbolic State Execution Prefix loc == 0 ∧ 1,2,3,4,5 1 loc = 0 key == ESC 2 while true do 3 key = symbolicReadKey() loc == 1 4 if key == ESC then 1,2,3,4,6, 5 sendQuitMsg() ∧ key != ESC 6 else if key == UP then ∧ key == UP 7,11 7 loc = loc + 1 8 else if key == DN then 9 loc = loc – 1 10 end if 11 sendMsg(loc) 12 end while 13 Symbolic Environment Symbolic State Execution Prefix loc == 0 ∧ 1,2,3,4,5 1 loc = 0 key == ESC 2 while true do 3 key = symbolicReadKey() loc == 1 4 if key == ESC then 1,2,3,4,6, 5 sendQuitMsg() ∧ key != ESC 6 else if key == UP then ∧ key == UP 7,11 7 loc = loc + 1 8 else if key == DN then loc == -1 9 loc = loc – 1 10 end if ∧ key != ESC 1,2,3,4,6, 11 sendMsg(loc) ∧ key != UP 8,9,11 12 end while ∧ key == DN 14 Checking a Client Message Symbolic State Execution Prefix Client Message: msg0 loc == 0 <location>1</location> ∧ 1,2,3,4,5 key == ESC Satisfiability Modulo loc == 1 STP Theory Solver 1,2,3,4,6, [Ganesh et al. 2007] ∧ key != ESC ∧ key == UP 7,11 loc == -1 Check consistency ∧ key != ESC 1,2,3,4,6, of message with ∧ key != UP 8,9,11 formulas generated ∧ key == DN via symbolic execution. 15 Verifying Client Messages Iteratively find execution prefix ∏ Network I/O Event consistent with msg0, msg1, …, msgn Client Server msg0 msg1 msg2 msg3 msg4 16 Verifying Client Messages Key Insight #1: Optimize for the common case of a legitimate client. Legitimate Not Legitimate Verification Time Bethea et al. 2010 NDSS 2013 17 Verification: Node Selection Key Insight #2: Correlate message contents with previously executed paths . Build training corpus of “execution fragments” . Select next node to explore 0 1 using training data 0 1 0 1 0 18 Building Training Corpus Trace1 Trace2 Trace3 Execute client software msg1,0 msg2,0 msg3,0 to generate a set of message traces. π1,1 π2,1 π3,1 msg msg1,1 msg2,1 3,1 π Split each trace into a 1,2 π 2,2 π3,2 set of execution msg1,2 msg2,2 msg3,2 fragments πi,j π π 1,3 π2,3 3,3 msg1,3 msg2,3 msg3,3 Associate each πi,j with π the set of messages it 1,4 π2,4 π3,4 msg1,4 msg is consistent with. 2,4 msg3,4 19 Clustering Training Data Cluster execution π1,1 π6,1 π2,1 π4,1 fragments by edit π2,4 π π π5,1 2,3 ππ1,2 distance using k-medoids ππ3,2 π3,1 1,2 3,2 π clustering. π5,2 π4,2 2,2 π6,2 π3,3 π3,3 π1,3 π3,4 π5,3 π5,3 π6,4 π6,3 π4,3 π1,4 π5,4 π1,4 π5,4 π4,4 Cluster messages by edit msg4,3 distance using k-medoids msg3,4 msgmsg1,1 1,1 msg4,2 clustering. msgmsg3,1 msg6,0 3,1 msg3,2 msg2,1 msg2,3 msg6,3 msgmsg1,01,0 msg3,0 msg2,0 msgmsg1,21,2 msgmsg2,22,2 msg2,4 msg5,4 msg5,0 msgmsg1,31,3 msg1,4 msg3,3 20 Using the Clusters π msgn 4,2 Map message medoids msg1, π3,2 to execution fragment 1 π1,2 medoids. msg3, 1 π3,3 Find message medoid msg1, π closest to msg via edit msg0 5,3 n 1, π distance. 2 1,4 msg2, π5,4 2 Use associated π2,1 execution fragment medoids to guide search. 21 Case Studies . Networked games are popular! • Some > 10 million subscribers • Gaming industry revenues of $67 billion (2012) . Cheaters reduce the quality of the game for honest players • Our technique detects any cheat that requires a modification to the client binary or memory 22 Case Studies . XPilot . TetriNET • Open-source • Text-based multiplayer multiplayer 2D shooter Tetris game • 150000 lines of C • 5000 lines of C • Little client-side state • More ambiguity at server about client state 23 Measuring Performance CLIENT SERVER ONLINE Verification MESSAGE QUEUE Time 3 2 VERIFIER 1 Verification Delay Time 24 XPilot Results . 40-fold cross validation . 4000 points per bin . Average: 32 messages/ second . Average verification time < 100ms . Average delay at end of Delay queue is less than 5 min . 100x faster than previous work 25 TetriNET Results . 20-fold cross validation . Average game 6.5 minutes . 20x20 = 400 points per bin . Average verification time < 100ms . Average Delay at end of Delay queue is less than 2 min . See paper for a variation that often keeps up with gameplay with a small increase in bandwidth 26 Conclusion . Key Insights • Optimize for the common case legitimate client • Use a search heuristic that correlates message contents with previously executed paths • Optimize symbolic execution components for our specific needs (see paper) . Contribution: Precise client checking algorithm • Dramatically improves performance over previous work with similar design goals • In some cases, verification comes very close to keeping pace with the application (see paper) 27 Questions? .
Load more

Recommended publications
  • Tetrinetclient – Build a Tetrinet Client 2-LINER Description
    TetrinetClient – Build a tetrinet client 2-LINER description: Design and develop a Tetrinet Client that is compatible with the current ToThePoint Tetrinet Server and additionally add more/new game-aspects to it [Description of the assignment] • A lot of our Pointers are fans of Tetrinet (a multiplayer Tetris variant). One of us was so obsessed that he started developing his own Tetrinet Server. • What once started as a fun-project has now grown to a veritable server with features such as single-player challenges, many game types, badges, … and this is all compatible with old clients from 1997. • Now that we have this server, we’re only lacking our own client implementation. • Your assignment will be the design and development of a new modern client that meets the needs of the current Tetrinet protocol. Afterwards, both the server as the client can be expanded with new game-aspects. [Goals] • Functional analysis and design of a Tetrinet Client • Technical implementation of a Tetrinet Client according to the existing protocol • Adding new game-aspects in both client and server [What will you gain?] • You’ll gain experience and knowledge in Javascript frameworks such as Phaser.io and Pix.js • You’ll learn to build a UI on an existing backend application • You’ll experience working on an existing codebase [What do you need?] • Basic knowledge of Javascript. Knowledge of Phaser.io and/or pixjs is a plus • Basic knowledge of Java • Of course you have experience in playing Tetris [Location of the assignment] • Veldkant 33B, 2550 Kontich [Your Mentor] • Lars Van Herk – OneDot Business Unit Manager / Tech Lead • Johan Siebens - OnTheSpot Business Unit Manager / Tech Lead vd Tetrinet Server [Technologies you’ll be using] • Javascript • Phaser.io • Pixijs • Java • Spring Boot • Akka .
    [Show full text]
  • List of TCP and UDP Port Numbers 1 List of TCP and UDP Port Numbers
    List of TCP and UDP port numbers 1 List of TCP and UDP port numbers This is a list of Internet socket port numbers used by protocols of the Transport Layer of the Internet Protocol Suite for the establishment of host-to-host communications. Originally, these ports number were used by the Transmission Control Protocol (TCP) and the User Datagram Protocol (UDP), but are also used for the Stream Control Transmission Protocol (SCTP), and the Datagram Congestion Control Protocol (DCCP). SCTP and DCCP services usually use a port number that matches the service of the corresponding TCP or UDP implementation if they exist. The Internet Assigned Numbers Authority (IANA) is responsible for maintaining the official assignments of port numbers for specific uses.[1] However, many unofficial uses of both well-known and registered port numbers occur in practice. Table legend Use Description Color Official Port is registered with IANA for the application white Unofficial Port is not registered with IANA for the application blue Multiple use Multiple applications are known to use this port. yellow Well-known ports The port numbers in the range from 0 to 1023 are the well-known ports. They are used by system processes that provide widely used types of network services. On Unix-like operating systems, a process must execute with superuser privileges to be able to bind a network socket to an IP address using one of the well-known ports. Port TCP UDP Description Status 0 UDP Reserved Official 1 TCP UDP TCP Port Service Multiplexer (TCPMUX) Official [2] [3]
    [Show full text]
  • Project Multitris Group 23 Marcus Dicander Måns Olson Tomas Alaeus Daniel Boström Oscar Olsson
    Project Multitris Group 23 Marcus Dicander Måns Olson Tomas Alaeus Daniel Boström Oscar Olsson 1 Requirements Document (RD) Table of Contents 1. Preface..............................................................................................................................................3 1.1. Expected readership..............................................................................................................................3 1.2. Version history.....................................................................................................................................3 2. Introduction......................................................................................................................................3 2.1. User base and project goal....................................................................................................................3 2.2. Main system uses..................................................................................................................................3 2.3. System environment and context..........................................................................................................4 2.4. The scope of the system........................................................................................................................5 2.5. Main factors..........................................................................................................................................5 2.6. Technologies and risks.........................................................................................................................5
    [Show full text]
  • List of TCP and UDP Port Numbers - Wikipedia, the Free Encyclopedia List of TCP and UDP Port Numbers from Wikipedia, the Free Encyclopedia
    8/21/2014 List of TCP and UDP port numbers - Wikipedia, the free encyclopedia List of TCP and UDP port numbers From Wikipedia, the free encyclopedia This is a list of Internet socket port numbers used by protocols of the Transport Layer of the Internet Protocol Suite for the establishment of host-to-host connectivity. Originally, port numbers were used by the Network Control Program (NCP) which needed two ports for half duplex transmission. Later, the Transmission Control Protocol (TCP) and the User Datagram Protocol (UDP) needed only one port for bidirectional traffic. The even numbered ports were not used, and this resulted in some even numbers in the well-known port number range being unassigned. The Stream Control Transmission Protocol (SCTP) and the Datagram Congestion Control Protocol (DCCP) also use port numbers. They usually use port numbers that match the services of the corresponding TCP or UDP implementation, if they exist. The Internet Assigned Numbers Authority (IANA) is responsible for maintaining the official assignments of port numbers for specific uses.[1] However, many unofficial uses of both well-known and registered port numbers occur in practice. Contents 1 Table legend 2 Well-known ports 3 Registered ports 4 Dynamic, private or ephemeral ports 5 See also 6 References 7 External links Table legend Use Description Color Official Port is registered with IANA for the application[1] White Unofficial Port is not registered with IANA for the application Blue Multiple use Multiple applications are known to use this port. Yellow Well-known ports The port numbers in the range from 0 to 1023 are the well-known ports or system ports.[2] They are used by system processes that provide widely used types of network services.
    [Show full text]
  • Ludocapital: the Political Economy of Digital Play
    UC Irvine UC Irvine Electronic Theses and Dissertations Title Ludocapital: The Political Economy of Digital Play Permalink https://escholarship.org/uc/item/0985k4rw Author Jordan, Will Gregory Publication Date 2014 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California UNIVERSITY OF CALIFORNIA, IRVINE Ludocapital: The Political Economy of Digital Play DISSERTATION submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in Comparative Literature by Will Gregory Jordan Dissertation Committee: Associate Professor Eyal Amiran, Chair Professor James Steintrager Professor David Theo Goldberg 2014 © 2014 Will Gregory Jordan DEDICATION To my parents, who kept us playing and thinking ii TABLE OF CONTENTS Page ACKNOWLEDGMENTS iv CURRICULUM VITAE vi ABSTRACT OF THE DISSERTATION vii Introduction 1 1 Play and Freedom 25 1.1 Play and Procedurality ............................. 29 1.2 Aesthetics of game-playing ........................... 38 1.3 Digital play and the Ludic Posthuman .................... 45 1.4 Case Studies ................................... 52 1.5 Conclusions ................................... 64 2 Specters of Play: Hauntology of Tetris® 67 2.1 Tetris as Symbolic Game Object ........................ 72 2.2 Tetris as Cultural Commodity ......................... 84 2.3 The Idealization of Property in the Digital Age . 96 2.4 Conclusions ...................................115 3 Procedural Literacy: Toward a Programming Public 124 3.1 Procedural
    [Show full text]
  • Network Tetris an Interactive Peer to Peer Approach
    Michael Kotovsky Operating Systems Project Comp512, Spring 2008 Penn State Harrisburg Network Tetris An interactive peer to peer approach Table of Contents Introduction & History of Tetris..................................................................................................... 3 Project Goals................................................................................................................................... 4 Design Decisions ............................................................................................................................ 5 Implementation ............................................................................................................................... 6 An Event Driven Game................................................................................................................... 8 The flow of Logic ....................................................................................................................... 8 Description of an Event ............................................................................................................ 10 Lifecycle of an Event................................................................................................................ 10 Rollbacks....................................................................................................................................... 12 Lag & Screen Synchronization ..................................................................................................... 13
    [Show full text]
  • Puzzle Spill Liste : Stem P㥠Dine Favoritter
    Puzzle Spill Liste InkBall https://no.listvote.com/lists/games/inkball-1340777 gbrainy https://no.listvote.com/lists/games/gbrainy-307397 KAtomic https://no.listvote.com/lists/games/katomic-6325571 Bit Generations https://no.listvote.com/lists/games/bit-generations-3266978 Ribbon Hero 2 https://no.listvote.com/lists/games/ribbon-hero-2-7322259 Ribbon Hero https://no.listvote.com/lists/games/ribbon-hero-7322258 KidÅ ​ Gekidan Haro Ichiza: Haro no Puyo https://no.listvote.com/lists/games/kid%C5%8D-gekidan-haro-ichiza%3A-haro- Puyo no-puyo-puyo-3196415 Rocky and Bullwinkle https://no.listvote.com/lists/games/rocky-and-bullwinkle-7356048 Perestroika https://no.listvote.com/lists/games/perestroika-1989723 Mr. Driller https://no.listvote.com/lists/games/mr.-driller-3276305 Clubhouse Games https://no.listvote.com/lists/games/clubhouse-games-233753 Action Force https://no.listvote.com/lists/games/action-force-4677096 Tower of Babel https://no.listvote.com/lists/games/tower-of-babel-2877818 Picross 2 https://no.listvote.com/lists/games/picross-2-3382548 Lights, Camera, Curses https://no.listvote.com/lists/games/lights%2C-camera%2C-curses-4042889 Hitori https://no.listvote.com/lists/games/hitori-971467 https://no.listvote.com/lists/games/dr.-seuss%27-fix-up-the-mix-up-puzzler- Dr. Seuss' Fix-Up the Mix-Up Puzzler 5304376 Dr. Mario: Miracle Cure https://no.listvote.com/lists/games/dr.-mario%3A-miracle-cure-20031702 Magical Tetris Challenge https://no.listvote.com/lists/games/magical-tetris-challenge-3043129 Puzzle Bobble 3 https://no.listvote.com/lists/games/puzzle-bobble-3-784447
    [Show full text]
  • Internships Overview 2018-2019
    INTERNSHIPS OVERVIEW 2018-2019 TITLE INTERNSHIP: CentralPoint 2-LINER description: Build a lightweight single-sign-on-application that can support both username + password as social media log ins (Facebook, LinkedIn, GitHub, Google, …). This central SSO application will centrally authenticate the microservices-based intranet landscape of ToThePoint. EXTRA INFO: • Description of the task • Within ToThePoint we use a whole array of applications (self-contained systems) that are all integrated with the frontend and are supported within our ToThePoint intranet • These applications will all use their own authentication procedure with standard username and password. We want those applications to handle the authentication through a single-sign-on platform so we can enhance the user experience and also differentiate between users within our multiple applications. • Your main assignment during this internship will be the creation of a lightweight authentication-platform (both design and development), from which both log in methods are supported. • This platform should also be self-contained. • Goals • Functional analysis • Design of a responsive UI • Development of both backend and frontend following the self-contained systems architecture (Take note of Stefan Tilkov’s talk about SCS on http://scs- architecture.org) • The creation of a continuous deployment pipeline. • Deployment with Docker on a Google cloud-hosted Kubernetes cluster • What will you learn? • You will experience how to design, develop and put in production an end-to-end enterprise-grade
    [Show full text]
  • Toward Online Verification of Client Behavior in Distributed Applications
    Toward Online Verification of Client Behavior in Distributed Applications Robert A. Cochran Michael K. Reiter Department of Computer Science Department of Computer Science University of North Carolina University of North Carolina Chapel Hill, NC, USA Chapel Hill, NC, USA [email protected] [email protected] Abstract models (but that may still manipulate application state) can escape detection, in a manner analogous to mimicry attacks Existing techniques for a server to verify the correctness on intrusion-detection systems [28, 22]. Greater precision of client behavior in a distributed application suffer from has been achieved, but with greater expense. For example, imprecision, increased bandwidth consumption, or signifi- the Ripley system [25] replays each client on the server in cant computational expense. We present a novel method for order to validate the client’s requests, but this incurs the a server to efficiently search for a code path through the bandwidth overhead of transmitting all client-side inputs client that “explains” each client message, even though the (user inputs, timer values, etc.) to the server to permit re- server does not know local inputs to the client that might play and the computational overhead of replaying the client have caused the message. This method gives rise to a pre- on the server side. An approach by Bethea et al. [2] omits cise client verification technique that consumes no addi- transmitting client-side inputs, thus not incurring bandwidth tional bandwidth and that validates most legitimate client overheads, but then must search for whether there exist in- messages much faster than previous such techniques.
    [Show full text]
  • Makes People Talk Johan Larsson Johan Skårman Göteborg, Sweden 2002
    Master thesis in Mobile Informatics Collaborative Games – Makes People Talk Johan Larsson Johan Skårman Göteborg, Sweden 2002 Collaborative Games – Makes People Talk Teenagers’ use of mobile face-to-face collaborative computer games JOHAN LARSSON JOHAN SKÅRMAN © JOJOSOFT, 2002. The report is available at: www.scoreman.com/jojosoft Report no xxxx:xx Department of Applied Information Technology IT University of Göteborg Göteborg University and Chalmers University of Technology P O Box 8718 SE – 402 75 Göteborg Sweden Telephone + 46 (0)31-772 4895 [Tryckeriets namn] Göteborg, Sweden 2002 REPORT NO. xxxx/xxxx Collaborative Games – Makes People Talk Teenagers’ use of mobile face-to-face collaborative computer games JOHAN LARSSON JOHAN SKÅRMAN www.scoreman.com/jojosoft Department of Applied Information Technology IT UNIVERSITY OF GÖTEBORG GÖTEBORG UNIVERSITY AND CHALMERS UNIVERSITY OF TECHNOLOGY Göteborg, Sweden 2002 Collaborative Games – Makes People Talk Teenagers’ use of mobile face-to-face collaborative computer games JOHAN LARSSON JOHAN SKÅRMAN Department of Applied Information Technology Göteborg University and Chalmers University of Technology Abstract Our main purpose was to explore how teenagers used mobile face-to-face collaborative computer games. In this report we therefore describe the development and use of what we call mobile face-to-face collaborative computer games. These games are played among co-located people on a handheld devices connected in an ad hoc network. The research was conducted in three phases: the workshop phase, the development phase and finally the evaluation phase. In the first phase we studied three traditional games, both on a theoretical level and empirically. The aim was to identify the design patterns that made people collaborate and interact face-to-face.
    [Show full text]
  • Pure Tetris Strategy Guide by Spindizzy
    http://www.tetridome.com/filemgmt/filemgmt_data/files/pure.htm Pure Tetris strategy guide by spindizzy I have never seen a guide written specifically for pure TetriNET, and since this is our clan's speciality, I considered it my obligation. This guide is not written for total beginners. I assume you already know your way around the blocks. Maybe it isn't very helpful for experienced players either. At least I had fun writing it. Starting out Starting out is not as critical in pure setting as in 1:1 setting. In specials 1v1, it is in the first ten seconds of the game that the outcome of at least 50% of the games are decided. This is not the case in classic Tetris. However, the start is the easiest part to learn in pure, and without a good opening a poor player will always lose. We will discuss this first. Handling the Z's Any good 1:1 player know not to slide blocks under each other, especially not in the start since you have a long way to move the block. In my opinion, this is also true for pure Tetris. Sliding blocks is a dangerous thing to do and it slows you down. If caught by a line-add from an opponent, slides in the start can ruin your first tetris. The more opponents, the more dangerous the slide, because the risk for a line-add increases with the number of opponents. A great number of players do slides in 1v1 pure in the startup, even very skilled players.
    [Show full text]
  • Projet Informatique TETRIS
    Année 2018-2019 Projet informatique TETRIS B. Monsuez B. Monsuez Projet informatique TETRIS But du projet Il s’agit d’implanter complètement le jeu TETRIS et d’étendre ce jeu à de nouvelles variantes soit en implantant la possibilité d’un jeu multijoueurs à la manière de TETRIS DS (https://fr.wikipedia.org/wiki/Tetris_DS) ou TETRIS ULTIMATE () ou au contraire en 3D de type BLOCKOUT.. Pour gérer l’affichage graphique, nous suggérons soit le recours aux bibliothèques GTK ou wxWindows sous C++. Tâches demandées Vous vous trouvez dans la situation où vous devez réaliser une analyse quant à la faisabilité du logiciel, proposer une architecture de ce logiciel et ensuite implanter un démonstrateur reposant sur cette analyse. 1. Analysez le problème, sachant qu’il est souhaitable d’avoir une solution évolutive, permettant d’ajouter au fur et à mesure des fonctionnalités au logiciel, notamment progressivement d’étendre les règles du jeu. Il est notamment demandé de faire : a. Une analyse d’usage du logiciel (use case analysis) b. Une analyse fonctionnelle du logiciel c. Une architecture gros grains du logiciel 2. Réalisez un démonstrateur pour valider l’approche et les choix techniques et s’assurer que ces derniers sont pertinents. Dans le cas d’une approche évolutive, il sera possible tout d’abord d’implanter un noyau applicatif (nombre restreint de pièces, mouvement limités aux déplacer latéraux ou aux rotations dans un sens seulement) et ensuite d’ajouter les éléments supplémentaires (pièces supplémentaires, calcul du score, gestion des joueurs). Il est notamment demandé de faire : a. Une description du modèle d’architecture b.
    [Show full text]