318 search results - page 55 / 64 » Formal Description of Autopoiesis Based on the Theory of Cat... |
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
POPL
2008
ACM
14 years 8 months ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
ICFP
2004
ACM
14 years 8 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
VEE
2006
ACM
14 years 2 months ago
2006
ACM
The Pi-calculus is a formalism to model and reason about highly concurrent and dynamic systems. Most of the expressive power of the language comes from the ability to pass communi...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we combine existing work in the area of social laws with a framework for reasoning about knowledge in multi-agent systems. The unifying framework in which this is do...