Sciweavers

4743 search results - page 549 / 949
» The PlusCal Algorithm Language
Sort
View
POPL
2008
ACM
16 years 3 months ago
Automatic inference of stationary fields: a generalization of java's final fields
Java programmers can document that the relationship between two objects is unchanging by declaring the field that encodes that relationship to be final. This information can be us...
Christopher Unkel, Monica S. Lam
SIGMOD
2003
ACM
106views Database» more  SIGMOD 2003»
16 years 3 months ago
XPath Processing in a Nutshell
We provide a concise yet complete formal definition of the semantics of XPath 1 and summarize efficient algorithms for processing queries in this language. Our presentation is int...
Georg Gottlob, Christoph Koch, Reinhard Pichler
PODS
2006
ACM
98views Database» more  PODS 2006»
16 years 3 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch
TARK
2007
Springer
15 years 9 months ago
Dealing with logical omniscience
We examine four approaches for dealing with the logical omniscience problem and their potential applicability: the syntactic approach, awareness, algorithmic knowledge, and imposs...
Joseph Y. Halpern, Riccardo Pucella
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
15 years 8 months ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards