Sciweavers

58 search results - page 4 / 12
» Automatic trace analysis for logic of constraints
Sort
View
DATE
2004
IEEE
130views Hardware» more  DATE 2004»
15 years 3 months ago
Utilizing Formal Assertions for System Design of Network Processors
System level modeling with executable languages such as C/C++ has been crucial in the development of large electronic systems from general processors to application specific desig...
Xi Chen, Yan Luo, Harry Hsieh, Laxmi N. Bhuyan, Fe...
ASAP
1997
IEEE
144views Hardware» more  ASAP 1997»
15 years 3 months ago
Automatic data mapping of signal processing applications
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...
Corinne Ancourt, Denis Barthou, Christophe Guettie...
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 4 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
ICSOC
2010
Springer
14 years 9 months ago
Automatic Fragment Identification in Workflows Based on Sharing Analysis
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. ...
Dragan Ivanovic, Manuel Carro, Manuel V. Hermenegi...
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
15 years 5 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...