D’Argenio / Sokolova | Theoretical Aspects of Computing | Buch | 978-3-032-43867-6 | www.sack.de

Buch, Englisch, 477 Seiten, Format (B × H): 155 mm x 235 mm

Reihe: Lecture Notes in Computer Science

D’Argenio / Sokolova

Theoretical Aspects of Computing

23rd International Colloquium, ICTAC 2026, Bariloche, Argentina, November 11–13, 2026, Proceedings
Erscheinungsjahr 2027
ISBN: 978-3-032-43867-6
Verlag: Springer

23rd International Colloquium, ICTAC 2026, Bariloche, Argentina, November 11–13, 2026, Proceedings

Buch, Englisch, 477 Seiten, Format (B × H): 155 mm x 235 mm

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-032-43867-6
Verlag: Springer


This book constitutes the proceedings of 23rd International Colloquium on Theoretical Aspects of Computing, ICTAC 2026, which took place in Bariloche, Argentina, during November 11–13, 2026.

The 23 full papers, 3 short papers and 3 tool papers presented in this book were carefully reviewed and selected from 60 submissions. They include topics in Logic, Program analysis, Language and Automata, Verification, Stochastic Systems, Distributed Systems, and Proof Assistants.

D’Argenio / Sokolova Theoretical Aspects of Computing jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


.- Formal Analysis of Software Requirements: Boundary Conditions and Tools to Handle Them.
.- The Role of Logic in Advancing Machine Learning: Three Case Studies.
.- Theory and Applications of Satisfiability Modulo Theories (SMT) solving.
.- A Denotational Semantics for Synchronized Regular Expressions.
.- Learning Canonical Register Automata over Ordered Data Domains.
.- Variants of Higher-Dimensional Automata.
.- Automata on Graph Alphabets.
.- Nonstandard Axiomatic Semantics.
.- Computing Fixed Points using Dependency Oracles.
.- Causal Search Guided by Metamorphic Information.
.- SAT-based Consistency Checking for Structural and Behavioral SysML v2 Models.
.- UnAA-LOLA: A Stream Runtime Verification Tool Supporting Uncertainties, Assumptions and Anticipation.
.- Fuzz4PA: Building Smart Contract Behavior Abstractions using Fuzzing.
.- Towards Taming Data Comparisons in a Description Logic Setting.
.- Data Cleaning for Data Trees and Variants of Probabilistic Query Answering in an epistemic framework.
.- Verifiers and Generators: Epistemic Semantics for Intuitionistic Logic.
.- A quantum let within the lambda calculus.
.- A Taxonomy of Distance Metrics for Time-Sensitive Importance Splitting: Timer Bounds, Resampling, and the Global Age.
.- Stochastic Hybrid Automata for Power Profile Modeling in Energy Systems.
.- An Empirical Evaluation of Search-Based Algorithms for White-Box Testing of REST APIs.
.- Fine-grained Causal Reversibility for Asynchronous Channel-based Programming.
.- A Petri Net Semantics for Acyclic Safe BPMN Choreographies.
.- Encoding Lean’s Type Theory in Dedukti.
.- Proof Schemata as a Bridge to Classical Proof Theory.
.- A Direct-LLM Approach to Proof-Command and Lemma Suggestion in PVS.
.- From Empirical Traces to Formal Semantics: A MITRE ATT&CK Framework for Modeling Adversary Behavior.
.- A polynomial time algorithm for F-QLPs and F-QIPs over difference constraints.
.- Solving Approximate Agreement on continuous and discrete spaces.
.- Cyclic Equalizability Characterized by Parikh Vectors.
.- Semantics of imperative functions: games and name-passing processes.
.- Tool Support for Causal Reasoning via String Diagram Surgery.
.- Towards Synthetic Cryptography- A String Diagrammatic Approach.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.