Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000
DOI: 10.1109/iceccs.2000.873939
|View full text |Cite
|
Sign up to set email alerts
|

Concurrent programming made easy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0
1

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 20 publications
0
2
0
1
Order By: Relevance
“…The constraints themselves are of the form X<Y, read as ``the execution time of X is less than the execution time of Y'', where X and Y are events, and < is a partial order. The constraint logic program (CLP) is defined as follows (For a complete description, see [1]. Constants range over events classes E,F,… and there is a distinguished (postfixed) functor +.…”
Section: The Programming Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…The constraints themselves are of the form X<Y, read as ``the execution time of X is less than the execution time of Y'', where X and Y are events, and < is a partial order. The constraint logic program (CLP) is defined as follows (For a complete description, see [1]. Constants range over events classes E,F,… and there is a distinguished (postfixed) functor +.…”
Section: The Programming Modelmentioning
confidence: 99%
“…Constraints are generated by the CLP only when needed to reason about the execution times of current events. A detailed description of the interpreter can be found in [1]). …”
Section: The Interpretermentioning
confidence: 99%
“…Para hacer un poco más sencilla la programación concurrente hemos desarrollado un sistema en el cual la especificación de la concurrencia en las aplicaciones se lleva a cabo de manera gráfica. Además, la especificación de la sincronización de procesos está separada del resto del código y la sincronización de procesos se basa en Tempo [2,3], un lenguaje declarativo basado en lógica de primer orden. Su sintaxis es muy simple (su único predicado predefinido es "<", que representa precedencia en ejecución).…”
Section: Introductionunclassified