240 search results - page 19 / 48 » Infinite trace equivalence |
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
BIRTHDAY
2008
Springer
13 years 10 months ago
2008
Springer
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
We derive a number of well known deterministic latent variable models such as PCA, ICA, EPCA, NMF and PLSA as variational EM approximations with point posteriors. We show that the...
DCC
2005
IEEE
14 years 8 months ago
2005
IEEE
Identifiable parent property (IPP) codes are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we consider explicit constru...
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...