1 option
Theoretical Aspects of Computing - ICTAC 2021 : 18th International Colloquium, Virtual Event, Nur-Sultan, Kazakhstan, September 8-10, 2021, Proceedings / edited by Antonio Cerone, Peter Csaba Ölveczky.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 12819
- Theoretical Computer Science and General Issues, 2512-2029 ; 12819
- Language:
- English
- Subjects (All):
- Computer science.
- Microprogramming.
- Computer input-output equipment.
- Application software.
- Computer Science Logic and Foundations of Programming.
- Control Structures and Microprogramming.
- Input/Output and Data Communications.
- Computer and Information Systems Applications.
- Local Subjects:
- Computer Science Logic and Foundations of Programming.
- Control Structures and Microprogramming.
- Input/Output and Data Communications.
- Computer and Information Systems Applications.
- Physical Description:
- 1 online resource (XIV, 405 pages) : 98 illustrations, 46 illustrations in color.
- Edition:
- 1st ed. 2021.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2021.
- System Details:
- text file PDF
- Summary:
- This book constitutes the proceedings of the 18th International Colloquium on Theoretical Aspects of Computing, ICTAC 2021, organized by the Nazarbayev University, Nur-Sultan, Kazakhstan. The event was supposed to take place in Nur-Sultan, Kazakhstan, but due to COVID-19 pandemic is was held virtually. The 15 papers presented in this volume were carefully reviewed and selected from 40 submissions. The book also contains one invited talk in full paper length. The book deals with challenges in both theoretical aspects of computing and the exploitation of theory through methods and tools for system development. The 20 full papers presented in this volume were carefully reviewed and selected from 55 submissions. The papers cover a wide variety of topics, including: getting the best price for selling your personal data; attacking Bitcoin; optimizing various forms of model checking; synthesizing and learning algorithms; formalizing and verifying contracts, languages, and compilers; analyzing the correctness and complexity of programs and distributed systems; and finding connections from proofs in propositional logic to quantum programming languages.
- Contents:
- Concurrency and Objects Matter! Disentangling the Fabric of Real Operational Processes to Create Digital Twins
- Qualitative-Quantitative Reasoning: thinking informally about formal things
- Model Checking and Machine Learning Joining Forces in Uppaal
- Databases and Distributed Transactions Some Aspects of the Database Resilience
- On the Correctness Problem for Serializability
- Efficient Model Checking Methods A Set Automaton to Locate All Pattern Matches in a Term
- Groote Accelerating SpMV Multiplication in Probabilistic Model Checkers using GPUs
- A divide and conquer approach to conditional stable model checking
- Formalization and Verification in Coq and Isabelle Certifying Choreography Compilation
- Mechanically Verified Theory of Contracts
- A Complete Semantics of K and Its Translation to Isabelle
- Quantum Computing A New Connective in Natural Deduction, and its Application to Quantum Computing
- Security and Privacy An Incentive Mechanism for Trading Personal Data in Data Markets
- Palamidessi Assessing Security of Crypto-Currencies with Attack-Defense Trees: Proof of Concept and Future Directions
- Compositional Analysis of Protocol Equivalence in the Applied π-calculus using Quasi-Open Bisimilarity
- Card-based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations
- Ono Normalising Lustre Preserves Security
- Synthesis and Learning Learning Probabilistic Automata using Residuals
- Deductive Synthesis of Sorting Algorithms in Theorema
- Reactive Synthesis from Visibly Register Pushdown Automata
- Systems Calculi and Analysis ComplexityParser: an automatic tool for certifying poly-time complexity of Java programs
- A Calculus for Attribute-based Memory Updates
- A Proof Method for Local Sufficient Completeness of Term Rewriting Systems.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-030-85315-0
- 9783030853150
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.