Sciweavers

8132 search results - page 197 / 1627
» Dependability, Abstraction, and Programming
Sort
View
TFM
2009
Springer
252views Formal Methods» more  TFM 2009»
16 years 1 months ago
Abstraction and Modelling: A Complementary Partnership
action and Modelling - a complementary partnership” 10h30 – 11h 00 Coffee break 11h-12h30 Session 1 “Model Transformation: Foundations” Algebraic models for bidirectional m...
Jeffrey Kramer
ECOOP
2001
Springer
15 years 11 months ago
Distinctness and Sharing Domains for Static Analysis of Java Programs
Abstract. The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads...
Isabelle Pollet, Baudouin Le Charlier, Agostino Co...
ASP
2003
Springer
15 years 11 months ago
Translation of Aggregate Programs to Normal Logic Programs
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
ICSM
2005
IEEE
16 years 5 days ago
Reducing Build Time through Precompilations for Evolving Large Software
Large-scale legacy programs take long time to compile, thereby hampering productivity. This paper presents algorithms that reduce compilation time by analyzing syntactic dependenc...
Yijun Yu, Homayoun Dayani-Fard, John Mylopoulos, P...
ICFP
2010
ACM
15 years 7 months ago
Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation
Partial evaluation aims to improve the efficiency of a program by specialising it with respect to some known inputs. In this paper, we show that partial evaluation can be an effec...
Edwin Brady, Kevin Hammond