Theoretical Aspects of Computing – ICTAC 2014

1. Front Matter

   PDF

2. From Universal Logic to Computer Science, and Back

   • Răzvan Diaconescu

   Pages 1-16

3. Event Analytics

   • Jin Song Dong, Jun Sun, Yang Liu, Yuan-Fang Li

   Pages 17-24

4. A Logical Descriptor for Regular Languages via Stone Duality

   • Stefano Aguzzoli, Denisa Diaconescu, Tommaso Flaminio

   Pages 25-42

5. On Clock-Aware LTL Properties of Timed Automata

   • Peter Bezděk, Nikola Beneš, Vojtěch Havel, Jiří Barnat, Ivana Černá

   Pages 43-60

6. Linguistic Mechanisms for Context-Aware Security

   • Chiara Bodei, Pierpaolo Degano, Letterio Galletta, Francesco Salvatori

   Pages 61-79

7. Partial Models and Weak Equivalence

   • Adilson Luiz Bonifacio, Arnaldo Vieira Moura

   Pages 80-96

8. Probabilistic Recursion Theory and Implicit Computational Complexity

   • Ugo Dal Lago, Sara Zuppiroli

   Pages 97-114

9. Heterogeneous Timed Machines

   • Benoît Delahaye, José Luiz Fiadeiro, Axel Legay, Antónia Lopes

   Pages 115-132

10. Refinement of Structured Interactive Systems

    • Denisa Diaconescu, Luigia Petre, Kaisa Sere, Gheorghe Stefanescu

    Pages 133-150

11. Reasoning Algebraically About Refinement on TSO Architectures

    • Brijesh Dongol, John Derrick, Graeme Smith

    Pages 151-168

12. Structural Refinement for the Modal nu-Calculus

    • Uli Fahrenberg, Axel Legay, Louis-Marie Traonouez

    Pages 169-187

13. Precise Interprocedural Side-Effect Analysis

    • Manuel Geffken, Hannes Saffrich, Peter Thiemann

    Pages 188-205

14. Expressiveness via Intensionality and Concurrency

    • Thomas Given-Wilson

    Pages 206-223

15. Optimally Streaming Greedy Regular Expression Parsing

    • Niels Bjørn Bugge Grathwohl, Fritz Henglein, Ulrik Terp Rasmussen

    Pages 224-240

16. Learning Cover Context-Free Grammars from Structural Data

    • Mircea Marin, Gabriel Istrate

    Pages 241-258

17. Context-Free Sequences

    • Didier Caucal, Marion Le Gonidec

    Pages 259-276

18. Modular Reasoning for Message-Passing Programs

    • Jinjiang Lei, Zongyan Qiu

    Pages 277-294

19. Symbolic Analysis Tools for CSP

    • Liyi Li, Elsa Gunter, William Mansky

    Pages 295-313

20. A Heterogeneous Characterisation of Component-Based System Design in a Categorical Setting

    • Carlos Gustavo Lopez Pombo, Pablo F. Castro, Nazareno Aguirre, Tomas S. E. Maibaum

    Pages 314-332

This book constitutes the refereed proceedings of the 11th International Colloquium on Theoretical Aspects of Computing, ICTAC 2014 held in Bucharest, Romania, in September 2014. The 25 revised full papers presented together with three invited talks were carefully reviewed and selected from 74 submissions. The papers cover various topics such as automata theory and formal languages; principles and semantics of programming languages; theories of concurrency, mobility and reconfiguration; logics and their applications; software architectures and their models, refinement and verification; relationship between software requirements, models and code; static and dynamic program analysis and verification; software specification, refinement, verification and testing; model checking and theorem proving; models of object and component systems; coordination and feature interaction; integration of theories, formal methods and tools for engineering computing systems; service-oriented architectures: models and development methods; models of concurrency, security, and mobility; theories of distributed, grid and cloud computing; real-time, embedded, hybrid and cyber-physical systems; type and category theory in computer science; models for e-learning and education; case studies, theories, tools and experiments of verified systems; domain-specific modeling and technology: examples, frameworks and practical experience; challenges and foundations in environmental modeling and monitoring, healthcare, and disaster management.

• computational complexity and cryptography
• concurrency
• design and analysis of algorithms
• discrete mathematics
• formal languages and automata theory
• logic
• mathematics of computing
• models of computation
• randomness, geometry and discrete structures
• semantics and reasoning
• theory and algorithms for applications domains

• Institute of Computer Science, Romanian Academy, Iaşi, Romania

  Gabriel Ciobanu

• LORIA, Université de Lorraine, Vandœvre-lès-Nancy, France

  Dominique Méry

Policies and ethics