Sciweavers

1138 search results - page 85 / 228
» First-Order Model Checking Problems Parameterized by the Mod...
Sort
View
TASE
2008
IEEE
14 years 2 months ago
PDL over Accelerated Labeled Transition Systems
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
Taolue Chen, Jaco van de Pol, Yanjing Wang
ESORICS
2008
Springer
13 years 9 months ago
Remote Integrity Check with Dishonest Storage Server
We are interested in this problem: a verifier, with a small and reliable storage, wants to periodically check whether a remote server is keeping a large file x. A dishonest server,...
Ee-Chien Chang, Jia Xu
PRL
2010
310views more  PRL 2010»
13 years 6 months ago
A Lagrangian Half-Quadratic approach to robust estimation and its applications to road scene analysis
We consider the problem of fitting linearly parameterized models, that arises in many computer vision problems such as road scene analysis. Data extracted from images usually cont...
Jean-Philippe Tarel, Pierre Charbonnier
TOCL
2008
102views more  TOCL 2008»
13 years 7 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
Helmut Seidl, Kumar Neeraj Verma
CAV
2006
Springer
129views Hardware» more  CAV 2006»
13 years 11 months ago
Languages of Nested Trees
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan