Sciweavers

162 search results - page 5 / 33
» An Abstract Machine for a Higher-Order Distributed Process C...
Sort
View
TACS
2001
Springer
14 years 2 days ago
A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation
We propose the πD -calculus, a process calculus that can flexibly model fine-grained control of resource access in distributed computation, with a type system that statically pr...
Daisuke Hoshina, Eijiro Sumii, Akinori Yonezawa
JMLR
2012
11 years 10 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
JLP
2002
90views more  JLP 2002»
13 years 7 months ago
Combining programs and state machines
State machines consume and process actions complementary to programs issuing actions. State machines maintain a state and reply with a boolean response to each action in their int...
Jan A. Bergstra, Alban Ponse
CONCUR
2010
Springer
13 years 8 months ago
Theory by Process
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
Yuxi Fu
TCS
2008
13 years 7 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous