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

Days: Wednesday, December 2nd Thursday, December 3rd

Wednesday, December 2nd

View this program: with abstractssession overviewtalk overview

10:15-11:30 Session 1: Welcome and Keynote 1

All times listed are in CET (GMT +1).

10:15
Welcome (abstract)
10:30
Teaching Software Verification using Snap! (abstract)
12:00-13:00 Session 2: Semantics & Proofs 1

All times listed are in CET (GMT +1).

12:00
Formal Verification of Parallel Stream Compaction and Summed-Area Table Algorithms (abstract)
12:20
CiMPG+F: A Proof Generator & Fixer-upper for CafeOBJ Specifications (abstract)
12:40
Proof-theoretic Conservative Extension of HOL with Ad-hoc Overloading (abstract)
14:00-15:00 Session 3: Semantics & Proofs 2

All times listed are in CET (GMT +1).

14:00
Implementation correctness for Replicated Data Types, categorically (abstract)
14:20
Implementing Hybrid Semantics: From Functional to Imperative (abstract)
14:40
Semantics of a Relational Lambda-Calculus (abstract)
15:30-16:30 Session 4: Keynote 2

All times listed are in CET (GMT +1).

15:30
A Flight Rule Checker for the LADEE Lunar Spacecraft (abstract)
Thursday, December 3rd

View this program: with abstractssession overviewtalk overview

10:30-11:30 Session 5: Keynote 3

All times listed are in CET (GMT +1).

10:30
Taming delays in cyber-physical systems (abstract)
12:00-13:00 Session 6: Automata & Languages 1

All times listed are in CET (GMT +1).

12:00
Qsimulation V2.0: an Optimized Quantum Simulator (abstract)
12:20
Star-freeness, First-order Definability and Aperiodicity of Structured Context-free Languages (abstract)
12:40
A Myhill-Nerode Theorem for Register Automata and Symbolic Trace Languages (abstract)
14:00-15:00 Session 7: Automata & Languages 2

All times listed are in CET (GMT +1).

14:00
Compositionality of Safe Communication in Systems of Team Automata (abstract)
14:20
The Complexity of Boolean State Separation (abstract)
14:40
On Two Characterizations of Feature Models (abstract)
15:30-16:30 Session 8: Probabilistic Programming & Concurrency

All times listed are in CET (GMT +1).

15:30
Analysis of Bayesian Networks via Prob-Solvable Loops (abstract)
15:50
Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm (abstract)
16:10
Statistical Analysis of Non-Deterministic Fork-Join Processes (abstract)
16:30-16:45 Session 9: Closing

All times listed are in CET (GMT +1).

16:30
Best Paper Award (abstract)
16:40
Concluding Remarks (abstract)