40 search results - page 5 / 8 » Combinatory Formulations of Concurrent Languages |
74
Voted
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
158
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
POPL
2009
ACM
15 years 4 months ago
2009
ACM
Speculative execution is an important technique that has historically been used to extract concurrency from sequential programs. While techniques to support speculation work well ...
COORDINATION
2009
Springer
15 years 10 months ago
2009
Springer
A future is a well-known programming construct used to introduce concurrency to sequential programs. Computations annotated as futures are executed asynchronously and run concurren...
164
click to vote
POPL
2007
ACM
15 years 10 months ago
2007
ACM
Pushdown Systems (PDSs) has become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for seque...