Sciweavers

2947 search results - page 234 / 590
» Analyzing Program Analyses
Sort
View
MOZ
2004
Springer
15 years 12 months ago
A Mozart Implementation of CP(BioNet)
The analysis of biochemical networks consists in studying the interactions between biological entities cooperating in complex cellular processes. To facilitate the expression of an...
Grégoire Dooms, Yves Deville, Pierre Dupont
ISCA
2002
IEEE
103views Hardware» more  ISCA 2002»
15 years 11 months ago
Efficient Dynamic Scheduling Through Tag Elimination
An increasingly large portion of scheduler latency is derived from the monolithic content addressable memory (CAM) arrays accessed during instruction wakeup. The performance of th...
Dan Ernst, Todd M. Austin
IFL
1998
Springer
139views Formal Methods» more  IFL 1998»
15 years 11 months ago
Higher Order Demand Propagation
Abstract. In this report a new backward strictness analysis for functional languages is presented. It is called higher order demand propagation and is applicable to a realistic non...
Dirk Pape
PEPM
2000
ACM
15 years 10 months ago
Calculating Sized Types
Many program optimisations and analyses, such as arraybound checking, termination analysis, etc, dependon knowing the size of a function's input and output. However, size inf...
Wei-Ngan Chin, Siau-Cheng Khoo
CORR
2006
Springer
137views Education» more  CORR 2006»
15 years 6 months ago
Users' participation to the design process in an Open Source Software online community
The objective of this research is to analyse the ways members of open-source software communities participate in design. In particular we focus on how users of an Open Source (OS) ...
Flore Barcellini, Françoise Détienne...