Sciweavers

1818 search results - page 234 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
107
Voted
CSL
2004
Springer
15 years 9 months ago
Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
The aim of this work is to give an alternative presentation for the multiplicative fragment of Yetter’s cyclic linear logic. The new presentation is inspired by the calculus of s...
Pietro Di Gianantonio
FIDJI
2004
Springer
15 years 9 months ago
A JMM-Faithful Non-interference Calculus for Java
We present a calculus for establishing non-interference of several Java threads running in parallel. The proof system is built atop an implemented sequential Java Dynamic Logic cal...
Vladimir Klebanov
GI
2001
Springer
15 years 8 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
Dominique Cansell, Dominique Méry, Stephan ...
COLLABORATION
1999
Springer
15 years 8 months ago
A Service-Oriented Negotiation Model between Autonomous Agents
Abstract. We present a formal model of negotiation between autonomous agents. The purpose of the negotiation is to reach an agreement about the provision of a service by one agent ...
Carles Sierra, Peyman Faratin, Nicholas R. Jenning...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
16 years 4 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur