Sciweavers

2475 search results - page 286 / 495
» On the accuracy of language trees
Sort
View
RTA
2007
Springer
14 years 3 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
DOCENG
2006
ACM
14 years 3 months ago
Describing multistructured XML documents by means of delay nodes
Multistructured documents are documents whose structure is composed of a set of concurrent hierarchical structures. In this paper, we propose a new model of multistructured docume...
Jacques Le Maitre
ML
2006
ACM
14 years 3 months ago
Seminal: searching for ML type-error messages
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
Benjamin S. Lerner, Dan Grossman, Craig Chambers
LICS
2005
IEEE
14 years 3 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
SAC
2005
ACM
14 years 3 months ago
A two-dimensional separation of concerns for compiler construction
During language evolution, compiler construction is usually d along two dimensions: defining new abstract syntax tree (AST) classes, or adding new operations. In order to facilita...
Xiaoqing Wu, Suman Roychoudhury, Barrett R. Bryant...