Sciweavers

277 search results - page 40 / 56
» Precise reasoning for programs using containers
Sort
View
OOPSLA
2005
Springer
14 years 1 months ago
Quantifying the performance of garbage collection vs. explicit memory management
Garbage collection yields numerous software engineering benefits, but its quantitative impact on performance remains elusive. One can compare the cost of conservative garbage col...
Matthew Hertz, Emery D. Berger
POPL
2011
ACM
12 years 10 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ILP
2007
Springer
14 years 1 months ago
Using ILP to Construct Features for Information Extraction from Semi-structured Text
Machine-generated documents containing semi-structured text are rapidly forming the bulk of data being stored in an organisation. Given a feature-based representation of such data,...
Ganesh Ramakrishnan, Sachindra Joshi, Sreeram Bala...
ERCIMDL
2006
Springer
204views Education» more  ERCIMDL 2006»
13 years 11 months ago
Comparing and Combining Two Approaches to Automated Subject Classification of Text
A machine-learning and a string-matching approach to automated subject classification of text were compared, as to their performance, advantages and downsides. The former approach ...
Koraljka Golub, Anders Ardö, Dunja Mladenic, ...