Sciweavers

26496 search results - page 5108 / 5300
» An Approach to Computing Ethics
Sort
View
POPL
2008
ACM
16 years 6 months ago
High-level small-step operational semantics for transactions
Software transactions have received significant attention as a way to simplify shared-memory concurrent programming, but insufficient focus has been given to the precise meaning o...
Katherine F. Moore, Dan Grossman
POPL
2006
ACM
16 years 6 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
CADE
2007
Springer
16 years 6 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
16 years 6 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
VLDB
2003
ACM
147views Database» more  VLDB 2003»
16 years 6 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
« Prev « First page 5108 / 5300 Last » Next »