Sciweavers

909 search results - page 91 / 182
» Temporal Logic Case Study
Sort
View
BIRTHDAY
1997
Springer
14 years 1 months ago
Syntax vs. Semantics on Finite Structures
Abstract. Logic preservation theorems often have the form of a syntax/semantics correspondence. For example, the Los-Tarski theorem asserts that a rst-order sentence is preserved b...
Natasha Alechina, Yuri Gurevich
TJS
2008
98views more  TJS 2008»
13 years 8 months ago
Mapping functions and data redistribution for parallel files
A parallel file may be physically stored on several independent disks and logically partitioned by several processors. This paper presents general algorithms for mapping between t...
Florin Isaila, Walter F. Tichy
FSTTCS
2004
Springer
14 years 2 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
EDBT
2000
ACM
14 years 17 days ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
CSAC
2004
13 years 10 months ago
CoMex - A Mechanism for Coordination of Task Execution in Group Work
CoMex (Coordination Mechanism) is a system to coordinate the execution of tasks accessing coordinable entities. It uses coordination rules to describe the temporal and logical orde...
Hilda Tellioglu