Sciweavers

446 search results - page 5 / 90
» Abstract Interpretation Using Typed Decision Graphs
Sort
View
ENTCS
2008
108views more  ENTCS 2008»
13 years 7 months ago
Modelling Dynamic Software Architectures using Typed Graph Grammars
Several recent research efforts have focused on the dynamic aspects of software architectures providing suitable models and techniques for handling the run-time modification of th...
Roberto Bruni, Antonio Bucchiarone, Stefania Gnesi...
APLAS
2007
ACM
13 years 11 months ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
SAS
2004
Springer
14 years 24 days ago
The Octahedron Abstract Domain
hedron Abstract Domain Robert Claris´o and Jordi Cortadella Universitat Polit`ecnica de Catalunya Barcelona, Spain Abstract. An interesting area in static analysis is the study of...
Robert Clarisó, Jordi Cortadella
ICML
1999
IEEE
14 years 8 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason
CGO
2010
IEEE
14 years 2 months ago
Dynamic interpretation for dynamic scripting languages
Dynamic scripting languages offer programmers increased flexibility by allowing properties of programs to be defined at run-time. Typically, program execution begins with an int...
Kevin Williams, Jason McCandless, David Gregg