306 search results - page 43 / 62 » Underspecified computation of normal forms |
ICDCSW
2006
IEEE
14 years 1 months ago
2006
IEEE
The extent to which a wireless multi-hop network is connected is usually measured by the probability that all the nodes form a single connected component. We find this measure, c...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
We describe a new procedure for verifying ACL2 properties about finite state machines (FSMs) using satisfiability (SAT) solving. We present an algorithm for converting ACL2 conj...
HASKELL
2006
ACM
14 years 1 months ago
2006
ACM
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
Most of current peer-to-peer designs build their own system overlays independent of the physical one. Nodes within unstructured systems form a random overlay, on the contrary, str...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...