Sciweavers

150 search results - page 15 / 15
» Parameterized Modal Satisfiability
Sort
View
99 views 111 votes 15 years 3 months ago  TIP 2008»
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...
103 views 116 votes 15 years 9 months ago  ICFEM 2009»
Abstract. We study the problem of generating a database and parameters for a given parameterized SQL query satisfying a given test condition. We introduce a formal background theor...
132 views 130 votes 15 years 8 months ago  SAS 2004»
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
52 views 98 votes 15 years 3 months ago  CSDA 2008»
We present a semi-parametric method for testing mixing distributions in the mixed Poisson model. The proposed method, which is based on the generalized method of moments, does not...
146 views 115 votes 15 years 4 months ago  BIRTHDAY 2010»
Yuri Gurevich and Itay Neeman proposed the Distributed Knowledge Authorization Language, DKAL, as an expressive, yet very succinctly expressible logic for distributed authorization...
153 views 100 votes 15 years 3 months ago  CORR 2010»
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
141 views 112 votes 15 years 3 months ago  CORR 2010»
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
112 views 109 votes 15 years 3 months ago  ENTCS 2008»
We address the problem of component reuse by describing a quotient operation. Starting from the specifications of the behaviors of the component and of the desired overall system,...
136 views 142 votes 15 years 3 months ago  ENTCS 2008»
We show how to reason, in the proof assistant Coq, about realistic programming languages using a combination of separation logic and heterogeneous multimodal logic. A heterogeneou...
97 views 121 votes 15 years 3 months ago  ACTA 2004»
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...