Sciweavers

145 search results - page 2 / 29
» A compiled implementation of strong reduction
Sort
View
TPHOL
2008
IEEE
13 years 11 months ago
A Compiled Implementation of Normalization by Evaluation
We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open λ-terms w.r.t. β-reduction and rewrit...
Klaus Aehlig, Florian Haftmann, Tobias Nipkow
ISHPC
2003
Springer
13 years 10 months ago
On the Implementation of OpenMP 2.0 Extensions in the Fujitsu PRIMEPOWER Compiler
Abstract. The OpenMP Architecture Review Board has released version 2.0 of the OpenMP Fortran language specification in November 2000, and version 2.0 of the OpenMP C/C++ language...
Hidetoshi Iwashita, Masanori Kaneko, Masaki Aoki, ...
FM
2008
Springer
137views Formal Methods» more  FM 2008»
13 years 6 months ago
JML Runtime Assertion Checking: Improved Error Reporting and Efficiency Using Strong Validity
Abstract. The Java Modeling Language (JML) recently switched to an assertion semantics based on "strong validity" in which an assertion is taken to be valid precisely whe...
Patrice Chalin, Frédéric Rioux
ENGL
2007
82views more  ENGL 2007»
13 years 5 months ago
Reduct Generation in Information Systems
— In any information system, the reducts are useful in classifying data. Janusz Starzyk developed an algorithm for computing reducts using strong equivalence and the law of expan...
G. Ganesan, D. Latha, C. Raghavendra Rao
PLDI
2012
ACM
11 years 7 months ago
Test-case reduction for C compiler bugs
To report a compiler bug, one must often find a small test case that triggers the bug. The existing approach to automated test-case reduction, delta debugging, works by removing ...
John Regehr, Yang Chen, Pascal Cuoq, Eric Eide, Ch...