Sciweavers

3470 search results - page 303 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
SAC
2008
ACM
15 years 6 months ago
Symbiosis in logic-based pointcuts over a history of join points
Within aspect-oriented programming, the quality of aspect code depends on the readability and expressiveness of pointcut languages. Readability is increased by using specialized, ...
Kris Gybels, Charlotte Herzeel, Theo D'Hondt
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
16 years 7 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
POPL
1998
ACM
15 years 11 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
PLSA
1994
15 years 10 months ago
Language and Architecture Paradigms as Object Classes
Computer language paradigms offer linguistic abstractions and proof theories for expressing program implementations. Similarly, system architectures offer the hardware abstractions...
Diomidis Spinellis, Sophia Drossopoulou, Susan Eis...
PPDP
2010
Springer
15 years 5 months ago
Graph queries through datalog optimizations
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...