Sciweavers

8132 search results - page 127 / 1627
» Dependability, Abstraction, and Programming
Sort
View
WWW
2004
ACM
16 years 7 months ago
Reactive rules inference from dynamic dependency models
Defining dependency models is sometimes an easier, more intuitive way for ontology representation than defining reactive rectly, as it provides a higher level of abstraction. We w...
Asaf Adi, Opher Etzion, Dagan Gilat, Royi Ronen, G...
ACL
2008
15 years 8 months ago
A Deductive Approach to Dependency Parsing
We define a new formalism, based on Sikkel's parsing schemata for constituency parsers, that can be used to describe, analyze and compare dependency parsing algorithms. This ...
Carlos Gómez-Rodríguez, John A. Carr...
RSP
1999
IEEE
160views Control Systems» more  RSP 1999»
15 years 10 months ago
Mixed Abstraction Level Hardware Synthesis from SDL for Rapid Prototyping
SDL is currently gaining interest as a system level specification language for HW/SW codesign. Automated synthesis of SDL in hardware so far had problems with its efficiency. The ...
Oliver Bringmann, Wolfgang Rosenstiel, Annette Mut...
EUROPAR
2007
Springer
16 years 18 days ago
Delayed Side-Effects Ease Multi-core Programming
Computer systems are increasingly parallel and heterogeneous, while programs are still largely written in sequential languages. The obvious suggestion that the compiler should auto...
Anton Lokhmotov, Alan Mycroft, Andrew Richards
SCAM
2008
IEEE
16 years 25 days ago
Precise Analysis of Java Programs Using JOANA
The JOANA project (Java Object-sensitive ANAlysis) is a program analysis infrastructure for the Java language. It contains a wide range of analysis techniques such as dependence g...
Dennis Giffhorn, Christian Hammer