4325 search results - page 251 / 865 » Incremental computation with names |
154
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterization...
138
click to vote
ISCC
2007
IEEE
16 years 27 days ago
2007
IEEE
Even though PDAs in general—but smartcards in particular—can be trusted to keep secrets, because they have meager resources, including them in security protocols is difficult...
177
click to vote
LICS
2007
IEEE
16 years 27 days ago
2007
IEEE
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is ...
158
click to vote
TARK
2007
Springer
16 years 22 days ago
2007
Springer
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...
176
click to vote
FOSSACS
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...