Sciweavers

3342 search results - page 337 / 669
» Automating Abstract Interpretation
Sort
View
163
Voted
PPCP
1993
15 years 8 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
SAS
1994
Springer
105views Formal Methods» more  SAS 1994»
15 years 8 months ago
Efficient Strictness Analysis of Haskell
Strictness analysis has been a living field of investigation since Mycroft's original work in 1980, and is getting increasingly significant with the still wider use of lazy fu...
Kristian Damm Jensen, Peter Hjæresen, Mads R...
SC
1992
ACM
15 years 8 months ago
Heterogeneous Parallel Programming in Jade
This paper presents Jade, a high-level parallel programming language for managing coarse-grain concurrency. Jade simplifies programming by providing the programmer with the abstra...
Martin C. Rinard, Daniel J. Scales, Monica S. Lam
AGTIVE
2007
Springer
15 years 8 months ago
Verification and Synthesis of OCL Constraints Via Topology Analysis
On the basis of a case-study, we demonstrate the usefulness of topology invariants for model-driven systems development. Considering a graph grammar semantics for a relevant fragme...
Jörg Bauer, Werner Damm, Tobe Toben, Bernd We...
PAKDD
2010
ACM
275views Data Mining» more  PAKDD 2010»
15 years 8 months ago
Anonymizing Transaction Data by Integrating Suppression and Generalization
Abstract. Privacy protection in publishing transaction data is an important problem. A key feature of transaction data is the extreme sparsity, which renders any single technique i...
Junqiang Liu, Ke Wang