Sciweavers

2152 search results - page 130 / 431
» On Automating the Calculus of Relations
Sort
View
114
Voted
LICS
2009
IEEE
15 years 7 months ago
Psi-calculi: Mobile Processes, Nominal Data, and Logic
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted be...
Jesper Bengtson, Magnus Johansson, Joachim Parrow,...
76
Voted
CSL
2007
Springer
15 years 7 months ago
Not Enough Points Is Enough
Models of the untyped λ-calculus may be defined either as applicative structures satisfying a bunch of first order axioms, known as “λ-models”, or as (structures arising fr...
Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzon...
84
Voted
IFM
2007
Springer
101views Formal Methods» more  IFM 2007»
15 years 7 months ago
Translating FSP into LOTOS and Networks of Automata
Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of th...
Gwen Salaün, Jeff Kramer, Frédé...
LICS
2005
IEEE
15 years 6 months ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe
CSL
2005
Springer
15 years 6 months ago
Permutative Logic
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet