Sciweavers

4767 search results - page 612 / 954
» Structures for Abstract Rewriting
Sort
View
200
Voted
JDA
2006
85views more  JDA 2006»
15 years 6 months ago
Average case analysis of DJ graphs
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
Johann Blieberger
LISP
2008
154views more  LISP 2008»
15 years 6 months ago
Types and trace effects for object orientation
Trace effects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type a...
Christian Skalka
LRE
2008
100views more  LRE 2008»
15 years 6 months ago
LTAG-spinal and the Treebank
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...
Libin Shen, Lucas Champollion, Aravind K. Joshi
ENGL
2007
91views more  ENGL 2007»
15 years 6 months ago
RRT-based strategies for sensor-based exploration
—Real mobile robots should be able to build an abstract representation of the physical environment, in order to navigate and to work in such environment. We present a method for ...
Abraham Sánchez López, Judith Le&oac...
ENTCS
2007
112views more  ENTCS 2007»
15 years 6 months ago
A Calculus of Global Interaction based on Session Types
This paper proposes a calculus for describing communication-centred programs and discusses its use through a formal description of several use cases from real business protocols. ...
Marco Carbone, Kohei Honda, Nobuko Yoshida