Sciweavers

161 search results - page 30 / 33
» Lazy call-by-value evaluation
Sort
View
FATES
2006
Springer
13 years 11 months ago
Goldilocks: Efficiently Computing the Happens-Before Relation Using Locksets
We present a new lockset-based algorithm, Goldilocks, for precisely computing the happens-before relation and thereby detecting data-races at runtime. Dynamic race detection algori...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
VLDB
1991
ACM
128views Database» more  VLDB 1991»
13 years 11 months ago
A Functional Programming Approach to Deductive Databases
We introduce a persistentfunctional languagecalled PFL which adapts functional programming to the area of deductive databases,much as logic-based deductive databaselanguagesadapt ...
Alexandra Poulovassilis, Carol Small
SFP
2004
13 years 9 months ago
A graphic functional-dataflow language
NiMo (Nets in Motion) is a visual environment aimed to support totally graphic programming in Data Flow style, with a strong functional inspiration. Solutions of growing complexit...
Silvia Clerici, Cristina Zoltan
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
Sawja: Static Analysis Workshop for Java
Abstract. Static analysis is a powerful technique for automatic verification of programs but raises major engineering challenges when developing a full-fledged analyzer for a reali...
Laurent Hubert, Nicolas Barré, Fréd&...
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 7 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard