Sciweavers

1194 search results - page 141 / 239
» A Language for Implementing Arbitrary Logics
Sort
View
ICFP
2005
ACM
14 years 9 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
IWOMP
2007
Springer
14 years 3 months ago
Support for Fine Grained Dependent Tasks in OpenMP
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
Oliver Sinnen, Jsun Pe, Alexander Vladimirovich Ko...
ICLP
1999
Springer
14 years 1 months ago
Finding Fair Allocations for the Coalition Problem with Constraints
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
Evan Tick, Roland H. C. Yap, Michael J. Maher
CONCUR
2006
Springer
14 years 29 days ago
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
Yoshinao Isobe, Markus Roggenbach
FIDJI
2004
Springer
14 years 2 months ago
Coordinated Anonymous Peer-to-Peer Connections with MoCha
Abstract. MoCha is an exogenous coordination middleware for distributed communication based on mobile channels. Channels allow anonymous, and point-to-point communication among nod...
Juan Guillen Scholten, Farhad Arbab