ICTAC 2020: 17TH INTERNATIONAL COLLOQUIUM ON THEORETICAL ASPECTS OF COMPUTING

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

A
Ad-hoc overloading	Proof-theoretic Conservative Extension of HOL with Ad-hoc Overloading
aperiodic languages	Star-freeness, First-order Definability and Aperiodicity of Structured Context-free Languages
Automata learning	A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages
Automatic Proof Inference	CiMPG+F: A Proof Generator & Fixer-upper for CafeOBJ Specifications
B
Bayesian networks	Analysis of Bayesian Networks via Prob-Solvable Loops
best1	Best Paper Award
best2	Best Paper Award
best3	Best Paper Award
Boolean lattice	On Two Characterizations of Feature Models
Boolean Petri nets	Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm The Complexity of Boolean State Separation
Boolean state separation	The Complexity of Boolean State Separation
bounded and unbounded verification	Taming delays in cyber-physical systems
C
CafeOBJ	CiMPG+F: A Proof Generator & Fixer-upper for CafeOBJ Specifications
Classical higher-order logic	Proof-theoretic Conservative Extension of HOL with Ad-hoc Overloading
Combinatorics	Statistical Analysis of Non-Deterministic Fork-Join Processes
complexity characterization	The Complexity of Boolean State Separation
Compliance	Compositionality of Safe Communication in Systems of Team Automata
Composition	On Two Characterizations of Feature Models
Compositionality	Compositionality of Safe Communication in Systems of Team Automata
Concluding1	Concluding Remarks
Concluding2	Concluding Remarks
Concluding3	Concluding Remarks
Concurrency	Statistical Analysis of Non-Deterministic Fork-Join Processes
Configurable software	On Two Characterizations of Feature Models
confluence	Semantics of a Relational Lambda-Calculus
Conservative theory extension	Proof-theoretic Conservative Extension of HOL with Ad-hoc Overloading
cyber-physical systems	Taming delays in cyber-physical systems
D
Deductive verification	Formal Verification of Parallel Stream Compaction and Summed-Area Table Algorithms
E
Elgot Iteration	Implementing Hybrid Semantics: From Functional to Imperative
F
Feature models	On Two Characterizations of Feature Models
first-order logic	Star-freeness, First-order Definability and Aperiodicity of Structured Context-free Languages
Fixed-Parameter Algorithm	Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm
Fork-Join Process	Statistical Analysis of Non-Deterministic Fork-Join Processes
functional programming	Semantics of a Relational Lambda-Calculus
Functorial characterisation	Implementation correctness for Replicated Data Types, categorically
G
GPU verification	Formal Verification of Parallel Stream Compaction and Summed-Area Table Algorithms
H
Hybrid System	Implementing Hybrid Semantics: From Functional to Imperative
I
Implementation correctness	Implementation correctness for Replicated Data Types, categorically
input-driven languages	Star-freeness, First-order Definability and Aperiodicity of Structured Context-free Languages
Invariant Generation	Analysis of Bayesian Networks via Prob-Solvable Loops
Isabelle	Proof-theoretic Conservative Extension of HOL with Ad-hoc Overloading
K
keynote1	A Flight Rule Checker for the LADEE Lunar Spacecraft
keynote2	A Flight Rule Checker for the LADEE Lunar Spacecraft
keynote3	A Flight Rule Checker for the LADEE Lunar Spacecraft
L
Linux Distribution	On Two Characterizations of Feature Models
logic programming	Semantics of a Relational Lambda-Calculus
Loops	Statistical Analysis of Non-Deterministic Fork-Join Processes
M
monadic second-order logic	Star-freeness, First-order Definability and Aperiodicity of Structured Context-free Languages
Myhill-Nerode theorem	A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages
N
Non-Determinism	Statistical Analysis of Non-Deterministic Fork-Join Processes
O
Operational semantics	Implementation correctness for Replicated Data Types, categorically
operator precedence languages	Star-freeness, First-order Definability and Aperiodicity of Structured Context-free Languages
Optimization	Qsimulation V2.0: an Optimized Quantum Simulator
P
Prob-Solvable Loops	Analysis of Bayesian Networks via Prob-Solvable Loops
Probabilistic Program	Analysis of Bayesian Networks via Prob-Solvable Loops
Program Analysis	Analysis of Bayesian Networks via Prob-Solvable Loops
Program Semantics	Implementing Hybrid Semantics: From Functional to Imperative
Proof-theoretic conservativity	Proof-theoretic Conservative Extension of HOL with Ad-hoc Overloading
Propostional logic	On Two Characterizations of Feature Models
Q
Quantum computation	Qsimulation V2.0: an Optimized Quantum Simulator
Quantum simulator	Qsimulation V2.0: an Optimized Quantum Simulator
R
Reactive components	Compositionality of Safe Communication in Systems of Team Automata
Register automata	A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages
relational programming	Semantics of a Relational Lambda-Calculus
Replicated data types	Implementation correctness for Replicated Data Types, categorically
Restricted Occupancy Number	Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm
S
Safe communication	Compositionality of Safe Communication in Systems of Team Automata
semantics	Semantics of a Relational Lambda-Calculus
Separation logic	Formal Verification of Parallel Stream Compaction and Summed-Area Table Algorithms
Software product lines	On Two Characterizations of Feature Models
Software Verification	Teaching Software Verification using Snap!
Specification	Implementation correctness for Replicated Data Types, categorically
star-free languages	Star-freeness, First-order Definability and Aperiodicity of Structured Context-free Languages
Symbolic trace languages	A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages
Synchronisation policy	Compositionality of Safe Communication in Systems of Team Automata
synthesis	Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm Taming delays in cyber-physical systems
T
Teaching	Teaching Software Verification using Snap!
Team Automata	Compositionality of Safe Communication in Systems of Team Automata
Theorem Proving	CiMPG+F: A Proof Generator & Fixer-upper for CafeOBJ Specifications
U
Uniform random generation	Statistical Analysis of Non-Deterministic Fork-Join Processes
V
visibly-pushdown languages	Star-freeness, First-order Definability and Aperiodicity of Structured Context-free Languages
visual programming language	Teaching Software Verification using Snap!
W
Welcome1	Welcome
Welcome2	Welcome
Welcome3	Welcome
λ
λ-calculus	Semantics of a Relational Lambda-Calculus

Disclaimer | Powered by EasyChair Smart Program