264 search results - page 11 / 53 » entcs 2008 |
ENTCS
2008
13 years 6 months ago
2008
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of th...
ENTCS
2008
13 years 6 months ago
2008
This paper introduces a new algorithm dedicated to the rigorous reachability analysis of nonlinear dynamical systems. The algorithm is initially presented in the context of discre...
ENTCS
2008
13 years 6 months ago
2008
The broad availability of multi-core chips on standard desktop PCs provides strong motivation for the development of new algorithms for logic model checkers that can take advantag...
ENTCS
2008
13 years 6 months ago
2008
: We define and compare several probabilistic notions of computability for mappings from represented spaces (that are equipped with a measure or outer measure) into computable metr...
ENTCS
2008
13 years 6 months ago
2008
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...