831 search results - page 145 / 167 » Coalgebraic Correspondence Theory |
161
click to vote
POPL
2010
ACM
16 years 3 months ago
2010
ACM
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
168
click to vote
SIGSOFT
2009
ACM
16 years 26 days ago
2009
ACM
Web-services are broadly considered as an effective means to achieve interoperability between heterogeneous parties of a business process and offer an open platform for developing...
202
click to vote
LICS
2009
IEEE
16 years 22 days ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
129
click to vote
ATAL
2009
Springer
16 years 20 days ago
2009
Springer
We study combinatorial prediction markets where agents bet on the sum of values at any tree node in a hierarchy of events, for example the sum of page views among all the children...
154
click to vote
OOPSLA
2009
Springer
16 years 19 days ago
2009
Springer
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...