Sciweavers

303 search results - page 52 / 61
» Unifying Theories of Confidentiality
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
14 years 10 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
ICFP
2008
ACM
14 years 9 months ago
Mixin' up the ML module system
ML modules provide hierarchical namespace management, as well as fine-grained control over the propagation of type information, but they do not allow modules to be broken up into ...
Derek Dreyer, Andreas Rossberg
ICFP
2006
ACM
14 years 9 months ago
Modelling deterministic concurrent I/O
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
Malcolm Dowse, Andrew Butterfield
ATAL
2009
Springer
14 years 4 months ago
Operational semantics of goal models in adaptive agents
Several agent-oriented software engineering methodologies address the emerging challenges posed by the increasing need of adaptive software. A common denominator of such methodolo...
Mirko Morandini, Loris Penserini, Anna Perini
ICALP
2007
Springer
14 years 4 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson