Sciweavers

1265 search results - page 40 / 253
» Performance Measurement of Interpreted Programs
Sort
View
ICFCA
2010
Springer
14 years 4 months ago
Approaches to the Selection of Relevant Concepts in the Case of Noisy Data
Concept lattices built on noisy data tend to be large and hence hard to interpret. We introduce several measures that can be used in selecting relevant concepts and discuss how the...
Mikhail Klimushkin, Sergei A. Obiedkov, Camille Ro...
ECOOP
1998
Springer
14 years 2 months ago
Design and Partial Evaluation of Meta-Objects for a Concurrent Reflective Language
Customizable meta-objects are a powerful abstraction for extending language features and implementation mechanisms, but interpretive execution suffers from severe performance penal...
Hidehiko Masuhara, Akinori Yonezawa
ICFP
2002
ACM
14 years 10 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
POPL
1994
ACM
14 years 2 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
NORDICHI
2004
ACM
14 years 3 months ago
Visual attention tracking during program debugging
This paper reports on a study which compared two tools for tracking the focus of visual attention - a remote eye tracker and the Restricted Focus Viewer (RFV). The RFV tool blurs ...
Roman Bednarik, Markku Tukiainen