Sciweavers

835 search results - page 60 / 167
» Structural Recursion as a Query Language
Sort
View
COMPASS
1994
14 years 29 days ago
Equations for Describing Dynamic Nets of Communicating Systems
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical sys...
Manfred Broy
APLAS
2010
ACM
13 years 9 months ago
Verification of Tree-Processing Programs via Higher-Order Model Checking
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi
WWW
2008
ACM
14 years 9 months ago
Xml data dissemination using automata on top of structured overlay networks
We present a novel approach for filtering XML documents using nondeterministic finite automata and distributed hash tables. Our approach differs architecturally from recent propos...
Iris Miliaraki, Zoi Kaoudi, Manolis Koubarakis
EDBT
2008
ACM
158views Database» more  EDBT 2008»
14 years 9 months ago
Expressive query specification through form customization
A form-based query interface is usually the preferred means to provide an unsophisticated user access to a database. Not only is such an interface easy to use, requiring no techni...
Magesh Jayapandian, H. V. Jagadish
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 9 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup