001484395 000__ 04552cam\\22005897i\4500
001484395 001__ 1484395
001484395 003__ OCoLC
001484395 005__ 20240117003323.0
001484395 006__ m\\\\\o\\d\\\\\\\\
001484395 007__ cr\un\nnnunnun
001484395 008__ 231129s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001484395 019__ $$a1410561471$$a1410592174
001484395 020__ $$a9783031479632$$q(electronic bk.)
001484395 020__ $$a3031479637$$q(electronic bk.)
001484395 020__ $$z9783031479625
001484395 020__ $$z3031479629
001484395 0247_ $$a10.1007/978-3-031-47963-2$$2doi
001484395 035__ $$aSP(OCoLC)1410957518
001484395 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP$$dOCLCO
001484395 049__ $$aISEA
001484395 050_4 $$aQA75.5$$b.I78 2023eb
001484395 08204 $$a004$$223/eng/20231129
001484395 1112_ $$aICTAC (Colloquium)$$n(20th :$$d2023 :$$cLima, Peru)
001484395 24510 $$aTheoretical aspects of computing -- ICTAC 2023 :$$b20th International Colloquium, Lima, Peru, December 4-8, 2023, Proceedings /$$cErika Ábrahám, Clemens Dubslaff, Silvia Lizeth Tapia Tarifa, editors.
001484395 2463_ $$aICTAC 2023
001484395 264_1 $$aCham :$$bSpringer,$$c2023.
001484395 300__ $$a1 online resource (xi, 440 pages) :$$billustrations (some color).
001484395 336__ $$atext$$btxt$$2rdacontent
001484395 337__ $$acomputer$$bc$$2rdamedia
001484395 338__ $$aonline resource$$bcr$$2rdacarrier
001484395 4901_ $$aLecture Notes in Computer Science,$$x1611-3349 ;$$v14446
001484395 500__ $$aIncludes index.
001484395 5050_ $$aOptimal Route Synthesis in Space DTN using Markov Decision Processes -- Modelling and Verifying Robotic Software that use Neural Networks -- A game-theoretic approach to indistinguishability of winning objectives as user privacy -- Learning Attack Trees by Genetic Algorithms -- The Landscape of Computing Symmetric $n$-Variable Functions with $2n$ Cards -- On the complexity of reasoning in Kleene algebras with commutativity conditions -- Towards the Complexity Analysis of Programming Language Proof Methods -- A Dynamic Temporal Logic for Quality of Service in Choreographic Models -- Interactive Matching Logic Proofs in Coq -- An Autonomous Data Language -- Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling -- Strong Call-by-Value and Multi Types -- Algorithms for Checking Intersection Non-emptiness of Regular Expressions -- Realisability of Global Models of Interaction -- Efficient Reactive Synthesis Using Mode Decomposition -- A Categorical Approach to Synthetic Chemistry -- Closure and Decision Properties for Higher-Dimensional Automata -- Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad -- Moggi Synchronous Agents, Verification, and Blame – A Deontic View -- Store Locally, Prove Globally -- Denotational Semantics for Symbolic Execution -- TOOL PAPER: Tessla-ROS-Bridge - Runtime Verification of Robotic Systems -- Simplifying process parameters by unfolding algebraic data types -- Modular Soundness Checking of Feature Model Evolution Plans.
001484395 506__ $$aAccess limited to authorized users.
001484395 520__ $$aThis book constitutes the proceedings of the 20th International Colloquium on Theoretical Aspects of Computing, ICTAC 2023, which took place in Lima, Peru, during December 4-8, 2023. The 20 full papers presented in this volume together with 3 invited papers and 1 tool paper were carefully reviewed and selected from 40 submissions. They were organised in the topical sections as follows: Bring Together Practitioners; Researchers from Academia; Industry; Government to Present Research Results and Exchange Experience and Ideas.
001484395 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed November 29, 2023).
001484395 650_6 $$aInformatique$$vCongrès.
001484395 650_0 $$aComputer science$$vCongresses.$$0(DLC)sh2007006411
001484395 655_0 $$aElectronic books.
001484395 7001_ $$aÁbrahám, Erika,$$eeditor.$$1https://orcid.org/0000-0002-5647-6134
001484395 7001_ $$aDubslaff, Clemens,$$eeditor.$$0(orcid)0000-0001-5718-8276$$1https://orcid.org/0000-0001-5718-8276
001484395 7001_ $$aTapia Tarifa, Silvia Lizeth,$$eeditor.$$1https://orcid.org/0000-0001-9948-2748
001484395 77608 $$iPrint version: $$z3031479629$$z9783031479625$$w(OCoLC)1401962434
001484395 830_0 $$aLecture notes in computer science ;$$v14446.$$x1611-3349
001484395 852__ $$bebk
001484395 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-47963-2$$zOnline Access$$91397441.1
001484395 909CO $$ooai:library.usi.edu:1484395$$pGLOBAL_SET
001484395 980__ $$aBIB
001484395 980__ $$aEBOOK
001484395 982__ $$aEbook
001484395 983__ $$aOnline
001484395 994__ $$a92$$bISE