research-article

Guaranteeing Timed Opacity using Parametric Timed Model Checking

Authors:

Étienne André,

Jun SunAuthors Info & Claims

ACM Transactions on Software Engineering and Methodology (TOSEM), Volume 31, Issue 4

Article No.: 64, Pages 1 - 36

https://doi.org/10.1145/3502851

Published: 08 September 2022 Publication History

Abstract

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage occurs whenever an attacker successfully deduces confidential internal information. In this work, we consider that the attacker has access (only) to the system execution time. We address the following timed opacity problem: given a timed system, a private location and a final location, synthesize the execution times from the initial location to the final location for which one cannot deduce whether the system went through the private location. We also consider the full timed opacity problem, asking whether the system is opaque for all execution times. We show that these problems are decidable for timed automata (TAs) but become undecidable when one adds parameters, yielding parametric timed automata (PTAs). We identify a subclass with some decidability results. We then devise an algorithm for synthesizing PTAs parameter valuations guaranteeing that the resulting TA is opaque. We finally show that our method can also apply to program analysis.

References

[1]

Jeremy W. Bryans, Maciej Koutny, Laurent Mazaré, and Peter Y. A. Ryan. 2008. Opacity generalised to transition systems. International Journal of Information Security 7, 6 (2008), 421–435. DOI:

Digital Library

[2]

Rajeev Alur and David L. Dill. 1994. A theory of timed automata. Theoretical Computer Science 126, 2 (1994), 183–235. DOI:

Digital Library

[3]

Rajeev Alur, Thomas A. Henzinger, and Moshe Y. Vardi. 1993. Parametric real-time reasoning. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing.S. Rao Kosaraju, David S. Johnson, and Alok Aggarwal (Eds.), ACM, New York, NY, 592–601. DOI:

Digital Library

[4]

Étienne André and Jun Sun. 2019. Parametric timed model checking for guaranteeing timed opacity. In Proceedings of the International Symposium on Automated Technology for Verification and Analysis.Yu-Fang Chen, Chih-Hong Cheng, and Javier Esparza (Eds.), Lecture Notes in Computer Science, Vol. 11781, Springer, 115–130. DOI:

Digital Library

[5]

Volker Weispfenning. 1999. Mixed real-integer linear quantifier elimination. In Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation.Keith O. Geddes, Bruno Salvy, and Samuel S. Dooley (Eds.), Association for Computing Machinery, New York, NY, 129–136. DOI:

Digital Library

[6]

Paul C. Kocher. 1996. Timing attacks on implementations of diffie-hellman, RSA, DSS, and other systems. In Proceedings of the Annual International Cryptology Conference.Neal Koblitz (Ed.), Lecture Notes in Computer Science, Vol. 1109, Springer, 104–113. DOI:

[7]

Edward W. Felten and Michael A. Schneider. 2000. Timing attacks on web privacy. In Proceedings of the 7th ACM Conference on Computer and Communications Security.Dimitris Gritzalis, Sushil Jajodia, and Pierangela Samarati (Eds.), ACM, 25–32. DOI:

Digital Library

[8]

Andrew Bortz and Dan Boneh. 2007. Exposing private information by timing web applications. In Proceedings of the 16th International Conference on World Wide Web.Carey L. Williamson, Mary Ellen Zurko, Peter F. Patel-Schneider, and Prashant J. Shenoy (Eds.), ACM, 621–628. DOI:

Digital Library

[9]

Robert Kotcher, Yutong Pei, Pranjal Jumde, and Collin Jackson. 2013. Cross-origin pixel stealing: Timing attacks using CSS filters. In Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security.Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung (Eds.), ACM, 1055–1062. DOI:

Digital Library

[10]

Gilles Benattar, Franck Cassez, Didier Lime, and Olivier H. Roux. 2015. Control and synthesis of non-interferent timed systems. International Journal of Control 88, 2 (2015), 217–236. DOI:

[11]

Guillaume Gardey, John Mullins, and Olivier H. Roux. 2007. Non-interference control synthesis for security timed automata. Electronic Notes in Theoretical Computer Science 180, 1 (2007), 35–53. DOI:

Digital Library

[12]

Roberto Barbuti, Nicoletta De Francesco, Antonella Santone, and Luca Tesei. 2002. A notion of non-interference for timed automata. Fundamenta Informormaticae 51, 1–2 (2002), 1–11.

Digital Library

[13]

Roberto Barbuti and Luca Tesei. 2003. A decidable notion of timed non-interference. Fundamenta Informaticae 54, 2–3 (2003), 137–150.

Digital Library

[14]

Étienne André and Aleksander Kryukov. 2020. Parametric non-interference in timed automata. In Proceedings of the 25th International Conference on Engineering of Complex Computer Systems.Yi Li and Alan Liew (Eds.), 37–42. DOI:

[15]

Franck Cassez. 2009. The dark side of timed opacity. In Proceedings of the International Conference on Information Security and Assurance.Jong Hyuk Park, Hsiao-Hwa Chen, Mohammed Atiquzzaman, Changhoon Lee, Tai-Hoon Kim, and Sang-Soo Yeo (Eds.), Lecture Notes in Computer Science, Vol. 5576, Springer, 21–30. DOI:

Digital Library

[16]

Rajeev Alur, Limor Fix, and Thomas A. Henzinger. 1999. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science 211, 1–2 (1999), 253–273. DOI:

Digital Library

[17]

Ikhlass Ammar, Yamen El Touati, Moez Yeddes, and John Mullins. 2021. Bounded opacity for timed systems. Journal of Information Security and Applications 61 (2021), 1–13. DOI:

Digital Library

[18]

Goran Frehse, Colas Le Guernic, Alexandre Donzé, Scott Cotton, Rajarshi Ray, Olivier Lebeltel, Rodolfo Ripado, Antoine Girard, Thao Dang, and Oded Maler. 2011. SpaceEx: Scalable verification of hybrid systems. In Proceedings of the International Conference on Computer Aided Verification.Ganesh Gopalakrishnan and Shaz Qadeer (Eds.), Lecture Notes in Computer Science, Vol. 6806, Springer, 379–395. DOI:

[19]

Flemming Nielson, Hanne Riis Nielson, and Panagiotis Vasilikos. 2017. Information flow for timed automata. In Proceedings of the Models, Algorithms, Logics and Tools.Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare (Eds.), Lecture Notes in Computer Science, Vol. 10460, Springer, 3–21. DOI:

[20]

Panagiotis Vasilikos, Flemming Nielson, and Hanne Riis Nielson. 2018. Secure information release in timed automata. In Proceedings of the International Conference on Principles of Security and Trust.Lujo Bauer and Ralf Küsters (Eds.), Lecture Notes in Computer Science, Vol. 10804, Springer, 28–52. DOI:

[21]

Christopher Gerking, David Schubert, and Eric Bodden. 2018. Model checking the information flow security of real-time systems. In Proceedings of the International Symposium on Engineering Secure Software and Systems.Mathias Payer, Awais Rashid, and Jose M. Such (Eds.), Lecture Notes in Computer Science, Vol. 10953, Springer, 27–43. DOI:

Digital Library

[22]

Kim Guldstrand Larsen, Paul Pettersson, and Wang Yi. 1997. UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1, 1–2 (1997), 134–152. DOI:

Digital Library

[23]

Lingtai Wang and Naijun Zhan. 2018. Decidability of the initial-state opacity of real-time automata. In Proceedings of the Symposium on Real-Time and Hybrid Systems - Essays Dedicated to Professor Chaochen Zhou on the Occasion of His 80th Birthday.Cliff B. Jones, Ji Wang, and Naijun Zhan (Eds.), Lecture Notes in Computer Science, Vol. 11180, Springer, 44–60. DOI:

[24]

Lingtai Wang, Naijun Zhan, and Jie An. 2018. The opacity of real-time automata. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 37, 11 (2018), 2845–2856. DOI:

[25]

Véronique Bruyère, Emmanuel Dall’Olio, and Jean-Francois Raskin. 2008. Durations and parametric model-checking in timed automata. ACM Transactions on Computational Logic 9, 2 (2008), 12:1–12:23. DOI:

Digital Library

[26]

Amnon Rosenmann. 2019. The timestamp of timed automata. In Proceedings of the International Conference on Formal Modeling and Analysis of Timed Systems.Étienne André and Mariëlle Stoelinga (Eds.), Lecture Notes in Computer Science, Vol. 11750, Springer, 181–198. DOI:

Digital Library

[27]

Véronique Bruyère and Jean-François Raskin. 2007. Real-time model-checking: Parameters everywhere. Logical Methods in Computer Science 3, 1:7 (2007), 1–30. DOI:

[28]

Patricia Bouyer, Léo Henry, Samy Jaziri, Thierry Jéron, and Nicolas Markey. 2021. Diagnosing timed automata using timed markings. International Journal on Software Tools for Technology Transfer 23, 2 (2021), 229–253. DOI:

Digital Library

[29]

Paul Kocher, Jann Horn, Anders Fogh, Daniel Genkin, Daniel Gruss, Werner Haas, Mike Hamburg, Moritz Lipp, Stefan Mangard, Thomas Prescher, Michael Schwarz, and Yuval Yarom. 2020. Spectre attacks: Exploiting speculative execution. Communications of the ACM 63, 7 (2020), 93–101. DOI:

Digital Library

[30]

Johan Agat. 2000. Transforming out timing leaks. In Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Pprogramming Languages. 40–53. DOI:

Digital Library

[31]

David Molnar, Matt Piotrowski, David Schultz, and David A. Wagner. 2005. The program counter security model: Automatic detection and removal of control-flow side channel attacks. In Proceedings of the International Conference on Information Security and Cryptology. 156–168. DOI:

Digital Library

[32]

Bart Coppens, Ingrid Verbauwhede, Koen De Bosschere, and Bjorn De Sutter. 2009. Practical mitigations for timing-based side-channel attacks on modern x86 processors. In Proceedings of the 30th IEEE Symposium on Security and Privacy. 45–60. DOI:

Digital Library

[33]

Chao Wang and Patrick Schaumont. 2017. Security by compilation: An automated approach to comprehensive side-channel resistance. SIGLOG News 4, 2 (2017), 76–89. DOI:

Digital Library

[34]

Meng Wu, Shengjian Guo, Patrick Schaumont, and Chao Wang. 2018. Eliminating timing side-channel leaks using program repair. In Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis. 15–26. DOI:

Digital Library

[35]

Gilles Barthe, Tamara Rezk, and Martijn Warnier. 2006. Preventing timing leaks through transactional branching instructions. Electronic Notes in Theoretical Computer Science 153, 2 (2006), 33–55. DOI:

Digital Library

[36]

Chungha Sung, Brandon Paulsen, and Chao Wang. 2018. CANAL: A cache timing analysis framework via LLVM transformation. In Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis. 904–907. DOI:

Digital Library

[37]

Sudipta Chattopadhyay and Abhik Roychoudhury. 2011. Scalable and precise refinement of cache timing analysis via model checking. In Proceedings of the 32nd Real-Time Systems Symposium. 193–203. DOI:

Digital Library

[38]

Imran Hafeez Abbasi, Faiq Khalid Lodhi, Awais Mehmood Kamboh, and Osman Hasan. 2016. Formal verification of gate-level multiple side channel parameters to detect hardware trojans. In Proceedings of the International Workshop on Formal Techniques for Safety-Critical Systems.Cyrille Artho and Peter Csaba Ölveczky (Eds.), Lecture Notes in Computer Science, Vol. 694, 75–92. DOI:

[39]

Jun Zhang, Pengfei Gao, Fu Song, and Chao Wang. 2018. SCInfer: Refinement-based verification of software countermeasures against side-channel attacks. In Proceedings of the International Conference on Computer Aided Verification.157–177. DOI:

[40]

Louise A. Dennis, Marija Slavkovik, and Michael Fisher. 2016. “How did they know?” – Model-checking for analysis of information leakage in social networks. In Proceedings of the Coordination, Organizations, Institutions, and Norms in Agent Systems XII.Stephen Cranefield, Samhar Mahmoud, Julian A. Padget, and Ana Paula Rocha (Eds.), Lecture Notes in Computer Science, Vol. 10315, Springer, 42–59. DOI:

[41]

Goran Doychev, Dominik Feld, Boris Köpf, Laurent Mauborgne, and Jan Reineke. 2013. CacheAudit: A tool for the static analysis of cache side channels. In Proceedings of the USENIX Security Symposium. 431–446.

[42]

Shengjian Guo, Meng Wu, and Chao Wang. 2018. Adversarial symbolic execution for detecting concurrency-related cache timing leaks. In Proceedings of the Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering.Gary T. Leavens, Alessandro Garcia, and Corina S. Pasareanu (Eds.), ACM, 377–388. DOI:

Digital Library

[43]

Duc-Hiep Chu, Joxan Jaffar, and Rasool Maghareh. 2016. Precise cache timing analysis via symbolic execution. In Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium. IEEE Computer Society, 293–304. DOI:

[44]

Thomas Hune, Judi Romijn, Mariëlle Stoelinga, and Frits W. Vaandrager. 2002. Linear parametric model checking of timed automata. Journal of Logic and Algebraic Programming 52–53 (2002), 183–220. DOI:

[45]

Thomas A. Henzinger, Zohar Manna, and Amir Pnueli. 1991. Temporal proof methodologies for real-time systems. In Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Pprogramming Languages.David S. Wise (Ed.), ACM, 353–366. DOI:

Digital Library

[46]

Aleksandra Jovanović, Didier Lime, and Olivier H. Roux. 2015. Integer parameter synthesis for real-time systems. IEEE Transactions on Software Engineering 41, 5 (2015), 445–461. DOI:

Digital Library

[47]

Étienne André, Thomas Chatain, Emmanuelle Encrenaz, and Laurent Fribourg. 2009. An inverse method for parametric timed automata. International Journal of Foundations of Computer Science 20, 5 (2009), 819–836. DOI:

[48]

Alexander Schrijver. 1999. Theory of Linear and Integer Programming. Wiley.

[49]

Étienne André. 2021. IMITATOR 3: Synthesis of timing parameters beyond decidability. In Proceedings of the International Conference on Computer Aided Verification.Rustan Leino and Alexandra Silva (Eds.), Lecture Notes in Computer Science, Vol. 12759, Springer, 1–14. DOI:

Digital Library

[50]

Étienne André. 2019. What’s decidable about parametric timed automata? International Journal on Software Tools for Technology Transfer 21, 2 (2019), 203–219. DOI:

Digital Library

[51]

Joseph S. Miller. 2000. Decidability and complexity results for timed automata and semi-linear hybrid automata. In Proceedings of the International Workshop on Hybrid Systems: Computation and Control.Nancy A. Lynch and Bruce H. Krogh (Eds.), Lecture Notes in Computer Science, Vol. 1790, Springer, 296–309. DOI:

[52]

Laurent Doyen. 2007. Robust parametric reachability for timed automata. Information Processing Letters 102, 5 (2007), 208–213. DOI:

Digital Library

[53]

Nikola Beneš, Peter Bezděk, Kim Gulstrand Larsen, and Jiří Srba. 2015. Language emptiness of continuous-time parametric timed automata. In Proceedings of the International Colloquium on Automata, Languages, and Programming.Magnús M. Halldórsson, Kazuo Iwama, Naoki Kobayashi, and Bettina Speckmann (Eds.), Lecture Notes in Computer Science, Vol. 9135, Springer, 69–81. DOI:

Digital Library

[54]

Marvin L. Minsky. 1967. Computation: Finite and Infinite Machines. Prentice-Hall, Inc., Upper Saddle River, NJ.

Digital Library

[55]

Laura Bozzelli and Salvatore La Torre. 2009. Decision problems for lower/upper bound parametric timed automata. Formal Methods in System Design 35, 2 (2009), 121–151. DOI:

Digital Library

[56]

Étienne André and Didier Lime. 2017. Liveness in L/U-parametric timed automata. In Proceedings of the 17th International Conference on Application of Concurrency to System Design.Alex Legay and Klaus Schneider (Eds.), IEEE, 9–18. DOI:

[57]

Étienne André, Didier Lime, and Mathias Ramparison. 2018. TCTL model checking lower/upper-bound parametric timed automata without invariants. In Proceedings of the International Conference on Formal Modeling and Analysis of Timed Systems.David N. Jansen and Pavithra Prabhakar (Eds.), Lecture Notes in Computer Science, Vol. 11022, Springer, 1–17. DOI:

[58]

Étienne André, Didier Lime, and Nicolas Markey. 2020. Language preservation problems in parametric timed automata. Logical Methods in Computer Science 16, 1 (2020), 5:1–5:31. DOI:

[59]

Roberto Bagnara, Patricia M. Hill, and Enea Zaffanella. 2008. The parma polyhedra library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Science of Computer Programming 72, 1–2 (2008), 3–21. DOI:

Digital Library

[60]

Étienne André, Vincent Bloemen, Laure Petrucci, and Jaco van de Pol. 2019. Minimal-time synthesis for parametric timed automata. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems.Tomáš Vojnar and Lijun Zhang (Eds.), Lecture Notes in Computer Science, Vol. 11428, Springer, 211–228. DOI:

[61]

Gilles Barthe, Pedro R. D’Argenio, and Tamara Rezk. 2011. Secure information flow by self-composition. Mathematical Structures in Computer Science 21, 6 (2011), 1207–1252. DOI:

Digital Library

[62]

Didier Lime, Olivier H. Roux, Charlotte Seidner, and Louis-Marie Traonouez. 2009. Romeo: A parametric model-checker for petri nets with stopwatches. In Proceedings of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems.Stefan Kowalewski and Anna Philippou (Eds.), Lecture Notes in Computer Science, Vol. 5505, Springer, 54–57. DOI:

Digital Library

[63]

Mingsong Lv, Wang Yi, Nan Guan, and Ge Yu. 2010. Combining abstract interpretation with model checking for timing analysis of multicore software. In Proceedings of the 31st IEEE Real-Time Systems Symposium. IEEE Computer Society, 339–349. DOI:

Digital Library

[64]

Daniel Bundala and Joël Ouaknine. 2014. Advances in parametric real-time reasoning. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science.Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, and Zoltán Ésik (Eds.), Lecture Notes in Computer Science, Vol. 8634, Springer, 123–134. DOI:

[65]

Stefan Göller and Mathieu Hilaire. 2021. Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete. In Proceedings of the STACS.Markus Bläser and Benjamin Monmege (Eds.), Vol. 187, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 36:1–36:18. DOI:

Cited By

André ÉLefaucheux ELime DMarinho DSun J(2023)Configuring Timing Parameters to Ensure Execution-Time Opacity in Timed AutomataElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.392.1392(1-26)Online publication date: 31-Oct-2023
https://doi.org/10.4204/EPTCS.392.1
André ÉLefaucheux EMarinho D(2023)Expiring opacity problems in parametric timed automata2023 27th International Conference on Engineering of Complex Computer Systems (ICECCS)10.1109/ICECCS59891.2023.00020(89-98)Online publication date: 14-Jun-2023
https://doi.org/10.1109/ICECCS59891.2023.00020
Gruska D(2023)Security EnforcingConcurrency, Specification and Programming10.1007/978-3-031-26651-5_6(123-143)Online publication date: 5-May-2023
https://doi.org/10.1007/978-3-031-26651-5_6
Show More Cited By

Index Terms

Guaranteeing Timed Opacity using Parametric Timed Model Checking
1. Security and privacy
  1. Formal methods and theory of security
    1. Logic and verification
2. Theory of computation
  1. Formal languages and automata theory
    1. Automata extensions
      1. Quantitative automata
  2. Logic
    1. Logic and verification
    2. Verification by model checking

Recommendations

Interrupt Timed Automata: verification and expressiveness

We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.

While the reachability problem is undecidable for ...
Alternating timed automata

A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages that is closed under boolean operations and which has an ...
Undecidable problems about timed automata
FORMATS'06: Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems

We solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Software Engineering and Methodology

ACM Transactions on Software Engineering and Methodology Volume 31, Issue 4

October 2022

867 pages

ISSN:1049-331X

EISSN:1557-7392

DOI:10.1145/3543992

Editor:
Mauro Pezzè
USI Università della Svizzera italiana and SIT Schaffhausen Institute of Technology, Switzerland

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 September 2022

Online AM: 09 July 2022

Accepted: 01 November 2021

Revised: 01 August 2021

Received: 01 December 2020

Published in TOSEM Volume 31, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Refereed

Funding Sources

ANR national research program PACS
ANR-NRF research program ProMiS
ERATO HASUO Metamathematics for Systems Design Project

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
223
Total Downloads

Downloads (Last 12 months)70
Downloads (Last 6 weeks)6

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

André ÉLefaucheux ELime DMarinho DSun J(2023)Configuring Timing Parameters to Ensure Execution-Time Opacity in Timed AutomataElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.392.1392(1-26)Online publication date: 31-Oct-2023
https://doi.org/10.4204/EPTCS.392.1
André ÉLefaucheux EMarinho D(2023)Expiring opacity problems in parametric timed automata2023 27th International Conference on Engineering of Complex Computer Systems (ICECCS)10.1109/ICECCS59891.2023.00020(89-98)Online publication date: 14-Jun-2023
https://doi.org/10.1109/ICECCS59891.2023.00020
Gruska D(2023)Security EnforcingConcurrency, Specification and Programming10.1007/978-3-031-26651-5_6(123-143)Online publication date: 5-May-2023
https://doi.org/10.1007/978-3-031-26651-5_6
Arcile JAndré É(2022)Timed Automata as a Formalism for Expressing Security: A Survey on Theory and PracticeACM Computing Surveys10.1145/353496755:6(1-36)Online publication date: 7-Dec-2022
https://dl.acm.org/doi/10.1145/3534967

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Full Text

View this article in Full Text.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View full text|Download PDF

View Issue’s Table of Contents