Sciweavers

5608 search results - page 258 / 1122
» On the Theory of Matchgate Computations
Sort
View
POPL
2004
ACM
16 years 7 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
AMAI
2004
Springer
16 years 2 days ago
Deductive Algorithmic Knowledge
The framework of algorithmic knowledge assumes that agents use algorithms to compute the facts they explicitly know. In many cases of interest, a logical theory, rather than a par...
Riccardo Pucella
BIRTHDAY
2000
Springer
15 years 11 months ago
Discrete time process algebra with silent step
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
Jos C. M. Baeten, Jan A. Bergstra, Michel A. Renie...
LICS
1998
IEEE
15 years 11 months ago
On Proofs about Threshold Circuits and Counting Hierarchies
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
Jan Johannsen, Chris Pollett
BIRTHDAY
2006
Springer
15 years 10 months ago
Reasoning About Web Services in a Temporal Action Logic
The paper presents an approach to reasoning about Web services in a temporal action theory. Web services are described by specifying their interaction protocols in an action theory...
Alberto Martelli, Laura Giordano