Sciweavers

2436 search results - page 434 / 488
» Comonadic Notions of Computation
Sort
View
IFIP
2004
Springer
15 years 11 months ago
New-HOPLA: A Higher-order Process Language with Name Generation
Abstract This paper introduces new-HOPLA, a concise but powerful language for higherorder nondeterministic processes with name generation. Its origins as a metalanguage for domain ...
Glynn Winskel, Francesco Zappa Nardelli
ISAAC
2004
Springer
170views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Spanners, Weak Spanners, and Power Spanners for Wireless Networks
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
LATIN
2004
Springer
15 years 11 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
PRICAI
2004
Springer
15 years 11 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
SPIN
2004
Springer
15 years 11 months ago
Verifying Commit-Atomicity Using Model-Checking
The notion that certain procedures are atomic provides a valuable partial specification for many multithreaded software systems. Several existing tools verify atomicity by showing...
Cormac Flanagan