Sciweavers

11345 search results - page 2008 / 2269
» Foundations of Computer Science
Sort
View
LICS
2005
IEEE
15 years 9 months ago
Uniform Distributed Synthesis
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
Bernd Finkbeiner, Sven Schewe
LICS
2005
IEEE
15 years 9 months ago
Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
Patrice Godefroid, Michael Huth
LICS
2005
IEEE
15 years 9 months ago
Looping Caterpillars
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
Evan Goris, Maarten Marx
LICS
2005
IEEE
15 years 9 months ago
Proof-Theoretic Approach to Description-Logic
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
Martin Hofmann
LICS
2005
IEEE
15 years 9 months ago
A Polynomial Time Presburger Criterion and Synthesis for Number Decision Diagrams
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
Jérôme Leroux
« Prev « First page 2008 / 2269 Last » Next »