Result: Syntactic control of concurrency

Title:
Syntactic control of concurrency
Authors:
GHICA, D. R, MURAWSKI, A. S, ONG, C.-H. L
Source:
Automata, languages and programming: logic and semantics (ICALP-B 2004)Theoretical computer science. 350(2-3):234-251
Publisher Information:
Amsterdam: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 35 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Divers, Miscellaneous, Logiciel, Software, Langages de programmation, Programming languages, Contrôle concurrence, Concurrency control, Control concurrencia, Décidabilité, Decidability, Decidibilidad, Informatique théorique, Computer theory, Informática teórica, Langage procédural, Procedural language, Lenguaje procedural, Langage programmation, Programming language, Lenguaje programación, Langage rationnel, Regular language, Lenguaje racional, Simultané, Concurrent, Simultáneo, Simultanéité informatique, Concurrency, Simultaneidad informatica, Composition parallèle, Concurrence, Contrôle modèle, Model checking, Langage fini, Récursion, Système types, Sémantique abstraite, Sémantique jeux, Game semantics, Type systems
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD, United Kingdom
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17495192
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17495192
Database:
PASCAL Archive

Further Information

We consider a finitary procedural programming language (finite data-types, no recursion) extended with parallel composition and binary semaphores. Having first shown that may-equivalence of second-order open terms is undecidable we set out to find a framework in which decidability can be regained with minimum loss of expressivity. To that end we define an annotated type system that controls the number of concurrent threads created by terms and give a fully abstract game semantics for the notion of equivalence induced by typable terms and contexts. Finally, we show that the semantics of all typable terms, at any order and in the presence of iteration, has a regular-language representation and thus the restricted observational equivalence is decidable.