4217 search results - page 66 / 844 » Computational indistinguishability logic |
170
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic sem...
144
click to vote
APSEC
2005
IEEE
15 years 12 months ago
2005
IEEE
— In this paper, we present a temporal logic called F whose interpretation is over Input Output Symbolic Transition Systems (IOSTS). IOSTS extend transition systems to communicat...
167
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
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...
206
click to vote
CONCUR
2011
Springer
14 years 6 months ago
2011
Springer
Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs, a.k.a. probabilistic automata). A number of logical characterizations of the main behavi...
171
click to vote
FOSSACS
2005
Springer
15 years 12 months ago
2005
Springer
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...