ICTAC2023: 20TH INTERNATIONAL COLLOQUIUM ON THEORETICAL ASPECTS OF COMPUTING

This page contains an index consisting of author-provided keywords.

A
algebraic data types	Simplifying process parameters by unfolding algebraic data types
algorithmic complexity	On the complexity of reasoning in Kleene algebras with commutativity conditions
Algorithms	Algorithms for Checking Intersection Non-emptiness of Regular Expressions
ambiguity	Closure and Decision Properties for Higher-Dimensional Automata
Artificial neural networks
attack tree	Learning Attack Trees by Genetic Algorithms
attack-defense tree	Learning Attack Trees by Genetic Algorithms
automata theory	Closure and Decision Properties for Higher-Dimensional Automata
B
bisimulation equivalence	Realisability of Global Models of Interaction
Blame analysis	Synchronous Agents, Verification, and Blame — A Deontic View
bounded model-checking	A Dynamic Temporal Logic for Quality of Service in Choreographic Models
C
Call-by-value	Strong Call-by-Value and Multi Types
card-based cryptography	The Landscape of Computing Symmetric $n$-Variable Functions with $2n$ Cards
chemistry	A Categorical Approach to Synthetic Chemistry
choreographic model	A Dynamic Temporal Logic for Quality of Service in Choreographic Models
choreography automata	Realisability of Global Models of Interaction
closure property	Closure and Decision Properties for Higher-Dimensional Automata
communicating components	Realisability of Global Models of Interaction
commutativity conditions	On the complexity of reasoning in Kleene algebras with commutativity conditions
concurrency theory	Closure and Decision Properties for Higher-Dimensional Automata
Coq	Interactive Matching Logic Proofs in Coq
CSP
D
Data-Autonomous	An Autonomous Data Language
decision property	Closure and Decision Properties for Higher-Dimensional Automata
Denotational semantics	Denotational Semantics for Symbolic Execution
Deontic logic	Synchronous Agents, Verification, and Blame — A Deontic View
distributed algorithms	Store Locally, Prove Globally
dynamic temporal logic	A Dynamic Temporal Logic for Quality of Service in Choreographic Models
E
Enriched category	Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad
Event-B	Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling
Evolution Planning	Modular Soundness Checking of Feature Model Evolution Plans
F
fault tolerance	Store Locally, Prove Globally
formal methods	Learning Attack Trees by Genetic Algorithms Efficient Reactive Synthesis Using Mode Decomposition Denotational Semantics for Symbolic Execution
formal semantics	Store Locally, Prove Globally Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling
functional languages	Towards the Complexity Analysis of Programming Language Proof Methods
G
global interaction model	Realisability of Global Models of Interaction
graph game	A game-theoretic approach to indistinguishability of winning objectives as user privacy
H
higher-dimensional automaton	Closure and Decision Properties for Higher-Dimensional Automata
I
interaction-based system	Realisability of Global Models of Interaction
Interactive reasoning	Interactive Matching Logic Proofs in Coq
Intersection Non-emptiness Problem	Algorithms for Checking Intersection Non-emptiness of Regular Expressions
Intersection types	Strong Call-by-Value and Multi Types
Interval-based Feature Models	Modular Soundness Checking of Feature Model Evolution Plans
Isabelle
K
Kleene algebra	On the complexity of reasoning in Kleene algebras with commutativity conditions
L
Lambda calculus	Strong Call-by-Value and Multi Types
M
machine learning	Learning Attack Trees by Genetic Algorithms
Marabou
Matching logic	Interactive Matching Logic Proofs in Coq
message-passing systems	A Dynamic Temporal Logic for Quality of Service in Choreographic Models
Model checking	Synchronous Agents, Verification, and Blame — A Deontic View Simplifying process parameters by unfolding algebraic data types
Monad	Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad
Muller objective	A game-theoretic approach to indistinguishability of winning objectives as user privacy
Multi-agent systems	Synchronous Agents, Verification, and Blame — A Deontic View
O
O-indistinguishable strategy	A game-theoretic approach to indistinguishability of winning objectives as user privacy
objective-indistinguishability equilibrium	A game-theoretic approach to indistinguishability of winning objectives as user privacy
Operational Semantics	Modular Soundness Checking of Feature Model Evolution Plans An Autonomous Data Language
P
pomset with interfaces	Closure and Decision Properties for Higher-Dimensional Automata
process algebra	Simplifying process parameters by unfolding algebraic data types
Programming Language	An Autonomous Data Language
Programming semantics	Denotational Semantics for Symbolic Execution
proof methods	Towards the Complexity Analysis of Programming Language Proof Methods
Q
quality of service	A Dynamic Temporal Logic for Quality of Service in Choreographic Models
Quantale	Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad
quantitative attributes	A Dynamic Temporal Logic for Quality of Service in Choreographic Models
R
Reactive Synthesis	Efficient Reactive Synthesis Using Mode Decomposition
Regular Expression	Algorithms for Checking Intersection Non-emptiness of Regular Expressions
Requirements Engineering	Efficient Reactive Synthesis Using Mode Decomposition
retrosynthesis	A Categorical Approach to Synthetic Chemistry
Robot Systems	TOOL PAPER: Tessla-ROS-Bridge - Runtime Verification of Robotic Systems
Robustness	Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad
ROS	TOOL PAPER: Tessla-ROS-Bridge - Runtime Verification of Robotic Systems
Run-To-Completion	Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling
Runtime Verification	TOOL PAPER: Tessla-ROS-Bridge - Runtime Verification of Robotic Systems
S
SCXML	Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling
secure multi-party computation	The Landscape of Computing Symmetric $n$-Variable Functions with $2n$ Cards
security	Learning Attack Trees by Genetic Algorithms
semi-decidability	A Dynamic Temporal Logic for Quality of Service in Choreographic Models
Sequent calculus	Interactive Matching Logic Proofs in Coq
Software Product Line	Modular Soundness Checking of Feature Model Evolution Plans
Statechats	Formal Language Semantics for Triggered Enable Statecharts with a Run-to-Completion Scheduling
static analysis	Simplifying process parameters by unfolding algebraic data types
string diagrams	A Categorical Approach to Synthetic Chemistry
Strong evaluation	Strong Call-by-Value and Multi Types
Symbolic execution	Denotational Semantics for Symbolic Execution
symmetric function	The Landscape of Computing Symmetric $n$-Variable Functions with $2n$ Cards
T
team automata	Realisability of Global Models of Interaction
Theorem proving
Topology	Robustness in Metric Spaces over Continuous Quantales and the Hausdorff-Smyth Monad
type soundness	Towards the Complexity Analysis of Programming Language Proof Methods
V
verification	Store Locally, Prove Globally

Disclaimer | Powered by EasyChair Smart Program