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...
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...
In this paper, the problem of automatically mapping large-grain dataflow programs onto heterogeneous hardware/softwarearchitectures is treated. Starting with a given hardware/soft...
We introduce a predictive concept recognition methodology for description logics based on a new closed terminology assumption. During knowledge engineering, our system adopts the ...
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...