Theoretical Aspects of Computing - ICTAC 2008

1. Front Matter

   PDF

2. Using Design Patterns in Formal Methods: An Event-B Approach

   • J. -R. Abrial, Thai Son Hoang

   Pages 1-2

3. A Unified Approach to Abstract Interpretation, Formal Verification and Testing of C/C++ Modules

   • Jan Peleska

   Pages 3-22

4. The Three Platonic Models of Divergence-Strict CSP

   • A. W. Roscoe

   Pages 23-49

5. Monotonic Abstraction in Action

   • Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine

   Pages 50-65

6. Non-interleaving Semantics with Causality for Nondeterministic Dataflow

   • Oana Agrigoroaiei, Gabriel Ciobanu

   Pages 66-80

7. Symbolic Reachability for Process Algebras with Recursive Data Types

   • Stefan Blom, Jaco van de Pol

   Pages 81-95

8. Inclusion Test Algorithms for One-Unambiguous Regular Expressions

   • Haiming Chen, Lei Chen

   Pages 96-110

9. Refinement of Kripke Models for Dynamics

   • Francien Dechesne, Simona Orzan, Yanjing Wang

   Pages 111-125

10. Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers

    • Carlo A. Furia, Paola Spoletini

    Pages 126-140

11. A Theory of Pointers for the UTP

    • Will Harwood, Ana Cavalcanti, Jim Woodcock

    Pages 141-155

12. Recasting Constraint Automata into Büchi Automata

    • Mohammad Izadi, Marcello M. Bonsangue

    Pages 156-170

13. A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables

    • Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells

    Pages 171-185

14. Towards Efficient Verification of Systems with Dynamic Process Creation

    • Hanna Klaudel, Maciej Koutny, Elisabeth Pelz, Franck Pommereau

    Pages 186-200

15. An Observational Model for Transactional Calculus of Services Orchestration

    • Jing Li, Huibiao Zhu, Jifeng He

    Pages 201-215

16. Everything Is PSPACE-Complete in Interaction Systems

    • Mila Majster-Cederbaum, Christoph Minnameier

    Pages 216-227

17. A New Approach for the Construction of Multiway Decision Graphs

    • Y. Mokhtari, Sa’ed Abed, O. Ait Mohamed, S. Tahar, X. Song

    Pages 228-242

18. Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs

    • Masaki Murakami

    Pages 243-257

19. Guided Test Generation from CSP Models

    • Sidney Nogueira, Augusto Sampaio, Alexandre Mota

    Pages 258-273

20. Relaxing Goodness Is Still Good

    • Gordon J. Pace, Gerardo Schneider

    Pages 274-289

Research on theoretical aspects of computing has a direct impact on the pr- tice of computer systems development. Over many decades, fundamental t- ories have emerged to describe functionality, temporal behavior and resource consumption. Theories of application domains are beginning to be exploited for modelling and analyzing intended computing systems before the expensive c- mitment is made to real programs and hardware. Recent years have seen major improvements in the cost-e?ectiveness of tools supporting the exploitation of theories through proof, model-checking and testing. Against this encouraging background, we are pleased to present papers that show something of the live- ness and diversity of research in theoretical aspects of computing today. ICTAC 2008, the 5th International Colloquium on Theoretical Aspects of Computing, was held on 1-3 September 2008 in Istanbul, Turkey, hosted by - banc? University. The ICTAC series was founded by the International Institute for SoftwareTechnologyof the United Nations University(UNU-IIST). It brings together practitioners and researchers from academia, industry and government to present results and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methodsandtoolsforsystemdevelopment. Theseriesalsopromotescooperation in research and education between participants and their institutions, from - veloping and industrial countries, in accordance with the mandate of the United Nations University. The previous ICTAC colloquia were held in Guiyang, China (2004, LNCS 3407), Hanoi, Vietnam (2005, LNCS 3722), Tunis, Tunisia (2006, LNCS 4281) and Macau SAR, China (2007, LNCS 4711).

• Automat
• automata
• automata theory
• formal language
• formal languages
• model checking
• modeling
• programming
• programming language
• real-time
• semantics
• simulation
• software architecture
• theorem proving
• verification
• algorithm analysis and problem complexity

Policies and ethics