Sciweavers

446 search results - page 36 / 90
» Abstract Interpretation Using Typed Decision Graphs
Sort
View
FASE
2006
Springer
13 years 11 months ago
A Graph-Based Approach to Transform XML Documents
Abstract. As XML diffusion keeps increasing, it is today common practice for most developers to deal with XML parsing and transformation. XML is used as format to e.g. render data,...
Gabriele Taentzer, Giovanni Toffetti Carughi
CSL
2008
Springer
13 years 9 months ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
DALT
2006
Springer
13 years 11 months ago
Programming Declarative Goals Using Plan Patterns
AgentSpeak is a well-known language for programming intelligent agents which captures the key features of reactive planning systems in a simple framework with an elegant formal sem...
Jomi Fred Hübner, Rafael H. Bordini, Michael ...
ENTCS
2002
90views more  ENTCS 2002»
13 years 7 months ago
Specifying Graph-like Diagrams with DIAGEN
ended abstract demonstrates that creating editors and environments for visual languages becomes considerably easier when restricting the class of visual languages. The presented a...
Mark Minas
PEPM
1994
ACM
13 years 11 months ago
PERs from Projections for Binding-Time Analysis
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
Kei Davis