Sciweavers

967 search results - page 148 / 194
» Probabilistic Predicative Programming
Sort
View
ICSM
2005
IEEE
15 years 8 months ago
Context-Free Slicing of UML Class Models
In the work presented here, we introduce a method to automatically generate a subset of a UML class model based on a user-defined criterion. The goal of this work is to allow us to...
Huzefa H. Kagdi, Jonathan I. Maletic, Andrew Sutto...
122
Voted
ICFP
1999
ACM
15 years 6 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
CORR
2004
Springer
151views Education» more  CORR 2004»
15 years 2 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...
128
Voted
CAV
2011
Springer
253views Hardware» more  CAV 2011»
14 years 6 months ago
HAMPI: A String Solver for Testing, Analysis and Vulnerability Detection
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
Vijay Ganesh, Adam Kiezun, Shay Artzi, Philip J. G...
134
Voted
ICML
2008
IEEE
16 years 3 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka