Sciweavers

430 search results - page 35 / 86
» Extracting Computer Algebra Programs from Statements
Sort
View
AOSD
2011
ACM
13 years 2 months ago
Closure joinpoints: block joinpoints without surprises
Block joinpoints allow programmers to explicitly mark regions of base code as “to be advised”, thus avoiding the need to extract the block into a method just for the sake of c...
Eric Bodden
CONCUR
1993
Springer
13 years 11 months ago
Modular Completeness for Communication Closed Layers
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
Maarten M. Fokkinga, Mannes Poel, Job Zwiers
ENTCS
2008
121views more  ENTCS 2008»
13 years 7 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
PASTE
2010
ACM
14 years 23 days ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
MMSEC
2006
ACM
160views Multimedia» more  MMSEC 2006»
14 years 1 months ago
Extraction in software watermarking
The widespread use of the Internet makes software piracy and unauthorized modification easier and more frequent. Among the many techniques developed for protecting software copyr...
William Zhu, Clark D. Thomborson