906 search results - page 16 / 182 » Linking Theories of Concurrency |
79
Voted
IJCAI
1993
14 years 11 months ago
1993
Gelfond and Lifschitz introduce a declarative language A for describing effects of actions and define a translation of theories in this language into extended logic programs(ELP, ...
107
click to vote
PLDI
2011
ACM
14 years 14 days ago
2011
ACM
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
70
Voted
FOSSACS
2000
Springer
15 years 1 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
94
Voted
ACSD
2004
IEEE
15 years 1 months ago
2004
IEEE
In this paper we introduce the notion of weak endochrony, which extends to a synchronous setting the classical theory of Mazurkiewicz traces. The notion is useful in the synthesis ...
ASIACRYPT
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we show that two variants of Stern's identification scheme [IEEE Transaction on Information Theory '96] are provably secure against concurrent attack unde...