Sciweavers

3836 search results - page 527 / 768
» Semantics of Database Transformations
Sort
View
FAC
2010
259views more  FAC 2010»
15 years 3 months ago
An algebraic approach to the design of compilers for object-oriented languages
Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...
Adolfo Duran, Ana Cavalcanti, Augusto Sampaio
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
15 years 2 months ago
Concurrent Separation Logic for Pipelined Parallelization
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
Christian J. Bell, Andrew W. Appel, David Walker
BIRTHDAY
2010
Springer
15 years 2 months ago
Termination Graphs for Java Bytecode
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
Marc Brockschmidt, Carsten Otto, Christian von Ess...
ICEIS
2010
IEEE
15 years 2 months ago
Graph-based Knowledge Representation and Reasoning
This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphi...
M. Chein
142
Voted
NAACL
2010
15 years 2 months ago
Tree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and eff...
Michael Heilman, Noah A. Smith