Sciweavers

4355 search results - page 273 / 871
» From Interpretation to Compilation
Sort
View
TRIER
2002
15 years 6 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl
MODELS
2010
Springer
15 years 5 months ago
Towards a Semantics of Activity Diagrams with Semantic Variation Points
Abstract. UML activity diagrams have become an established notamodel control and data flow on various levels of abstraction, ranging from fine-grained descriptions of algorithms ...
Hans Grönniger, Dirk Reiss, Bernhard Rumpe
TOSEM
2010
95views more  TOSEM 2010»
15 years 5 months ago
Supporting dynamic aspect-oriented features
Nu model provides a higher level of abstraction compared to traditional object-oriented ILs, making it easier to eciently support dynamic AO features. We demonstrate these benets...
Robert Dyer, Hridesh Rajan
CP
2009
Springer
16 years 7 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
201
Voted
SP
2008
IEEE
16 years 1 months ago
Preventing Memory Error Exploits with WIT
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
Periklis Akritidis, Cristian Cadar, Costin Raiciu,...