Sciweavers

4217 search results - page 21 / 844
» Computational indistinguishability logic
Sort
View
FOSSACS
2007
Springer
15 years 3 months ago
Relational Parametricity and Separation Logic
Abstract. Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new inte...
Lars Birkedal, Hongseok Yang
IJCAI
2003
14 years 11 months ago
Formal Verification of Diagnosability via Symbolic Model Checking
This paper addresses the formal verification of diagnosis systems. We tackle the problem of diagnosability: given a partially observable dynamic system, and a diagnosis system obs...
Alessandro Cimatti, Charles Pecheur, Roberto Cavad...
ENTCS
2007
104views more  ENTCS 2007»
14 years 9 months ago
Exogenous Probabilistic Computation Tree Logic
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...
Pedro Baltazar, Paulo Mateus, Rajagopal Nagarajan,...
DLOG
2009
14 years 7 months ago
A Tableaux-based Method for Computing Least Common Subsumers for Expressive Description Logics
Least Common Subsumers (LCS) have been proposed in Description Logics (DL) to capture the commonalities between two or more concepts.
Francesco M. Donini, Simona Colucci, Tommaso Di No...
TCS
2008
14 years 9 months ago
Reversible computing and cellular automata - A survey
Reversible computing is a paradigm where computing models are so defined that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. ...
Kenichi Morita