Sciweavers

1175 search results - page 71 / 235
» Abstract computability and algebraic specification
Sort
View
CALCO
2011
Springer
225views Mathematics» more  CALCO 2011»
12 years 7 months ago
Linearly-Used State in Models of Call-by-Value
Abstract. We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value lan...
Rasmus Ejlers Møgelberg, Sam Staton
CSR
2009
Springer
14 years 2 months ago
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
Abstract. We study structural properties of restricted width arithmetical circuits. It is shown that syntactically multilinear arithmetical circuits of constant width can be effici...
Maurice J. Jansen, B. V. Raghavendra Rao
POPL
2003
ACM
14 years 8 months ago
A generic approach to the static analysis of concurrent programs with procedures
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
Ahmed Bouajjani, Javier Esparza, Tayssir Touili
SBBD
2004
119views Database» more  SBBD 2004»
13 years 9 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
CORR
2008
Springer
119views Education» more  CORR 2008»
13 years 7 months ago
Self-stabilizing Numerical Iterative Computation
Many challenging tasks in sensor networks, including sensor calibration, ranking of nodes, monitoring, event region detection, collaborative filtering, collaborative signal proces...
Ezra N. Hoch, Danny Bickson, Danny Dolev