Sciweavers

575 search results - page 93 / 115
» A Calculus for Interaction Nets
Sort
View
ENTCS
2007
98views more  ENTCS 2007»
13 years 8 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
KER
2006
70views more  KER 2006»
13 years 8 months ago
A theoretical inter-organizational trust-based security model
This work examines the interplay of inter-personal and inter-organizational trust, two distinct but related concepts, through a theoretic inter-organizational trust-based security...
Henry Hexmoor, Seth Wilson, Sandeep Bhattaram
TCS
2008
13 years 8 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
TVCG
2008
135views more  TVCG 2008»
13 years 8 months ago
Relation-Aware Volume Exploration Pipeline
Volume exploration is an important issue in scientific visualization. Research on volume exploration has been focused on revealing hidden structures in volumetric data. While the i...
Ming-Yuen Chan, Huamin Qu, Ka-Kei Chung, Wai-Ho Ma...
ENTCS
2002
97views more  ENTCS 2002»
13 years 8 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott