Theoretical Aspects of Computing - ICTAC 2009

1. Front Matter

   PDF

2. Invited Papers

   1. Static Analysis of Concurrent Programs Using Ordinary Differential Equations

      • Zuohua Ding

      Pages 1-35

   2. The PlusCal Algorithm Language

      • Leslie Lamport

      Pages 36-60

   3. The Secret Art of Computer Programming

      • Annabelle K. McIver

      Pages 61-78

   4. Verification, Testing and Statistics

      • Sriram K. Rajamani

      Pages 79-79

3. Full Research Papers

   1. ν-Types for Effects and Freshness Analysis

      • Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari, Roberto Zunino

      Pages 80-95

   2. A First-Order Policy Language for History-Based Transaction Monitoring

      • Andreas Bauer, Rajeev Goré, Alwen Tiu

      Pages 96-111

   3. Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete

      • Nikola Beneš, Jan Křetínský, Kim G. Larsen, Jiří Srba

      Pages 112-126

   4. Transmission Protocols for Instruction Streams

      • J. A. Bergstra, C. A. Middelburg

      Pages 127-139

   5. A Deadlock-Free Semantics for Shared Memory Concurrency

      • Gérard Boudol

      Pages 140-154

   6. On the Expressiveness of Forwarding in Higher-Order Communication

      • Cinzia Di Giusto, Jorge A. Pérez, Gianluigi Zavattaro

      Pages 155-169

   7. On the Hairpin Completion of Regular Languages

      • Volker Diekert, Steffen Kopecki, Victor Mitrana

      Pages 170-184

   8. Context-Free Languages of Countable Words

      • Zoltán Ésik, Szabolcs Iván

      Pages 185-199

   9. Automatic Conflict Detection on Contracts

      • Stephen Fenech, Gordon J. Pace, Gerardo Schneider

      Pages 200-214

   10. A Sound Observational Semantics for Modal Transition Systems

       • Dario Fischbein, Victor Braberman, Sebastian Uchitel

       Pages 215-230

   11. Regular Expressions with Numerical Constraints and Automata with Counters

       • Dag Hovland

       Pages 231-245

   12. On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations

       • Lakshmanan Kuppusamy, Kamala Krithivasan

       Pages 246-260

   13. Integration Testing from Structured First-Order Specifications via Deduction Modulo

       • Delphine Longuet, Marc Aiguier

       Pages 261-276

   14. A Minimized Assumption Generation Method for Component-Based Software Verification

       • Pham Ngoc Hung, Toshiaki Aoki, Takuya Katayama

       Pages 277-291

   15. A Formal Approach to Heuristically Test Restorable Systems

       • Pablo Rabanal, Ismael Rodríguez, Fernando Rubio

       Pages 292-306

ThisvolumecontainsthepaperspresentedatICTAC2009:the6thInternational Colloquium on Theoretical Aspects of Computing held August 18–20, 2009 in Kuala Lumpur, Malaysia, hosted by Universiti Kebangsaan Malaysia. The ICTAC series was founded by the International Institute for Software Technology of the United Nations University (UNU-IIST). It brings together practitionersandresearchersfromacademia,industryandgovernmenttopresent results and to exchange ideas and experience addressing challenges in both t- oretical aspects of computing and in the exploitation of theory through me- ods and tools for system development. The series also promotes cooperation in research and education between participants and their institutions, from dev- oping 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), Macao SAR, China (2007, LNCS 4711), and Istanbul, Turkey (2008, LNCS 5160). This year, 81 submissions were received, distributed over 70 full research papers and 11 tool papers. Each submission was reviewed by at least three P- gram Committee members. We thank the members of the Program Committee and the other specialist referees for the e?ort and skill that they invested in the review and selection process, which was managed using EasyChair. The C- mittee decided to accept 20 papers: 17 full research papers and 3 tool papers.

• Action
• automata
• automata theory
• computer
• computer science
• formal language
• formal languages
• model checking
• modeling
• software architecture
• testing
• verification
• algorithm analysis and problem complexity

• Institut für Informatik, TU München, Garching, Germany

  Martin Leucker

• School of Computer Science and Engineering, University of New South Wales, Sydney, Australia

  Carroll Morgan

Policies and ethics