Sciweavers

675 search results - page 67 / 135
» Programming Constraint Inference Engines
Sort
View
IWPC
2000
IEEE
14 years 15 days ago
The Effect of Call Graph Construction Algorithms for Object-Oriented Programs on Automatic Clustering
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
Derek Rayside, Steve Reuss, Erik Hedges, Kostas Ko...
EMSOFT
2008
Springer
13 years 10 months ago
Disassembling real-time fault-tolerant programs
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Anish Ar...
CODES
1998
IEEE
14 years 12 days ago
Domain-specific interface generation from dataflow specifications
In this paper, the problem of automatically mapping large-grain dataflow programs onto heterogeneous hardware/softwarearchitectures is treated. Starting with a given hardware/soft...
Michael Eisenring, Jürgen Teich
AAAI
1996
13 years 9 months ago
Closed Terminologies in Description Logics
We introduce a predictive concept recognition methodology for description logics based on a new closed terminology assumption. During knowledge engineering, our system adopts the ...
Robert A. Weida
WOLLIC
2009
Springer
14 years 2 months ago
Spoilt for Choice: Full First-Order Hierarchical Decompositions
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
Sebastian Link