54 search results - page 9 / 11 » On Deciding Topological Classes of Deterministic Tree Langua... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
XSYM
2010
Springer
13 years 5 months ago
2010
Springer
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...