Sciweavers

144 search results - page 17 / 29
» How Expressions Can Code for Automata
Sort
View
AOSD
2008
ACM
15 years 2 months ago
Tool-supported refactoring of aspect-oriented programs
Aspect-oriented programming languages provide new composition mechanisms for improving the modularity of crosscutting concerns. Implementations of such language support use advanc...
Jan Wloka, Robert Hirschfeld, Joachim Hänsel
101
Voted
ATVA
2006
Springer
102views Hardware» more  ATVA 2006»
15 years 4 months ago
A Semantic Framework for Test Coverage
Abstract. Since testing is inherently incomplete, test selection is of vital importance. Coverage measures evaluate the quality of a test suite and help the tester select test case...
Laura Brandán Briones, Ed Brinksma, Mari&eu...
96
Voted
HOTOS
2007
IEEE
15 years 4 months ago
Automatic Mutual Exclusion
We propose a new concurrent programming model, Automatic Mutual Exclusion (AME). In contrast to lock-based programming, and to other programming models built over software transac...
Michael Isard, Andrew Birrell
ICFP
2000
ACM
15 years 4 months ago
Fully reflexive intensional type analysis
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
Valery Trifonov, Bratin Saha, Zhong Shao
139
Voted
PPSN
1994
Springer
15 years 4 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob