Sciweavers

2944 search results - page 289 / 589
» On Well Quasi-orders on Languages
Sort
View
POPL
2004
ACM
16 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
ICFP
2005
ACM
16 years 6 months ago
Recursive type generativity
Existential types provide a simple and elegant foundation for uning generative abstract data types, of the kind supported by the Standard ML module system. However, in attempting ...
Derek Dreyer
ICFP
2005
ACM
16 years 6 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
AOSD
2010
ACM
16 years 1 months ago
EffectiveAdvice: disciplined advice with explicit effects
Advice is a mechanism, widely used in aspect-oriented languages, that allows one program component to augment or modify the behavior of other components. When advice and other com...
Bruno C. d. S. Oliveira, Tom Schrijvers, William R...
TSD
2007
Springer
16 years 23 days ago
Using Query-Relevant Documents Pairs for Cross-Lingual Information Retrieval
The world wide web is a natural setting for cross-lingual information retrieval. The European Union is a typical example of a multilingual scenario, where multiple users have to de...
David Pinto, Alfons Juan, Paolo Rosso