Sciweavers

4757 search results - page 541 / 952
» Monads for Functional Programming
Sort
View
APAL
2008
104views more  APAL 2008»
15 years 7 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
CORR
2008
Springer
94views Education» more  CORR 2008»
15 years 6 months ago
A Toolkit for Scalable Spreadsheet Visualization
This paper presents a toolkit for spreadsheet visualization based on logical areas, semantic classes and data Logical areas, semantic classes and data modules are abstract represe...
Markus Clermont
AMAI
2006
Springer
15 years 6 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
JCS
2006
118views more  JCS 2006»
15 years 6 months ago
Enforcing Robust Declassification and Qualified Robustness
Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems release sensitive information as part of their in...
Andrew C. Myers, Andrei Sabelfeld, Steve Zdancewic
JUCS
2008
117views more  JUCS 2008»
15 years 6 months ago
Disentangling Denotational Semantics Definitions
Abstract: Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equation...
Fabio Tirelo, Roberto da Silva Bigonha, Joã...