Sciweavers

247 search results - page 9 / 50
» A Computational Structure for the Propositional Calculus
Sort
View
TACS
2001
Springer
13 years 11 months 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
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
An Embedding of the BSS Model of Computation in Light Affine Lambda-Calculus
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
Patrick Baillot, Marco Pedicini
FMCAD
2007
Springer
14 years 1 months ago
Lifting Propositional Interpolants to the Word-Level
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
Daniel Kroening, Georg Weissenbacher
ICALP
2005
Springer
14 years 27 days ago
Basic Observables for a Calculus for Global Computing
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribut...
Rocco De Nicola, Daniele Gorla, Rosario Pugliese
ISCI
2006
136views more  ISCI 2006»
13 years 7 months ago
Computing with words for text processing: An approach to the text categorization
The use of the computing with words paradigm for the automatic text documents categorization problem is discussed. This specific problem of information retrieval (IR) becomes more...
Slawomir Zadrozny, Janusz Kacprzyk