Sciweavers

686 search results - page 50 / 138
» Foundations for Bidirectional Programming
Sort
View
ESOP
2009
Springer
15 years 1 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
DATE
2002
IEEE
108views Hardware» more  DATE 2002»
15 years 2 months ago
Networks on Silicon: Combining Best-Effort and Guaranteed Services
We advocate a network on silicon (NOS) as a hardware architecture to implement communication between IP cores in future technologies, and as a software model in the form of a prot...
Kees G. W. Goossens, Paul Wielage, Ad M. G. Peeter...
LICS
1994
IEEE
15 years 1 months ago
Higher-Order Narrowing
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
Christian Prehofer
DISCO
1992
161views Hardware» more  DISCO 1992»
15 years 1 months ago
Combinatory Models and Symbolic Computation
We introduce an algebraic model of computation which is especially useful for the description of computations in analysis. On one level the model allows the representation of alge...
Karl Aberer
CLIMA
2006
14 years 11 months ago
Multi-Agent FLUX for the Gold Mining Domain (System Description)
FLUX is a declarative, CLP-based programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledg...
Stephan Schiffel, Michael Thielscher