3653 search results - page 405 / 731 » On Recognizable Timed Languages |
208
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
323
Voted
PADL
2009
Springer
16 years 7 months ago
2009
Springer
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
311
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
201
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
190
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...