328 search results - page 37 / 66 » Proving Termination of Communicating Programs |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
ESOP
2010
Springer
14 years 5 months ago
2010
Springer
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Opportunistic scheduling in random beamforming maximizes the sum-rate by allocating resources to the users with the best channel condition, thus leveraging on multiuser diversit...
JLP
2000
13 years 7 months ago
2000
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...