Sciweavers

338 search results - page 36 / 68
» Locally checkable proofs
Sort
View
ECEASST
2010
14 years 8 months ago
Parallelism and Concurrency Theorems for Rules with Nested Application Conditions
Abstract. We present Local Church-Rosser, Parallelism, and Concurrency Theorems for rules with nested application conditions in the framework of weak adhesive HLR categories includ...
Hartmut Ehrig, Annegret Habel, Leen Lambers
STACS
2010
Springer
15 years 9 months ago
Named Models in Coalgebraic Hybrid Logic
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...
Lutz Schröder, Dirk Pattinson
IROS
2009
IEEE
114views Robotics» more  IROS 2009»
15 years 8 months ago
A Distributed boundary detection algorithm for multi-robot systems
— We describe a distributed boundary detection algorithm suitable for use on multi-robot systems with dynamic network topologies. We assume that each robot has access to its loca...
James McLurkin, Erik D. Demaine
SIAMJO
2008
110views more  SIAMJO 2008»
15 years 1 months ago
Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
We provide a rule to calculate the subdifferential of the pointwise supremum of an arbitrary family of convex functions defined on a real locally convex topological vector space. ...
Abderrahim Hantoute, Marco A. López, Consta...
APPROX
2008
Springer
90views Algorithms» more  APPROX 2008»
15 years 4 months ago
Tensor Products of Weakly Smooth Codes Are Robust
: We continue the study of robustly testable tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via...
Eli Ben-Sasson, Michael Viderman