Sciweavers

2947 search results - page 415 / 590
» Analyzing Program Analyses
Sort
View
FM
2009
Springer
104views Formal Methods» more  FM 2009»
15 years 9 months ago
A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
Helmut Seidl, Vesal Vojdani, Varmo Vene
133
Voted
FSEN
2009
Springer
15 years 9 months ago
Automated Translation and Analysis of a ToolBus Script for Auctions
Abstract. ToolBus allows to connect tools via a software bus. Programming is done using the scripting language Tscript, which is based on the process algebra ACP. In previous work ...
Wan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. ...
124
Voted
ICMT
2009
Springer
15 years 9 months ago
Model Superimposition in Software Product Lines
In software product line engineering, feature composition generates software tailored to specific requirements from a common set of artifacts. Superimposition is a technique to me...
Sven Apel, Florian Janda, Salvador Trujillo, Chris...
ICNC
2009
Springer
15 years 9 months ago
Reducing Boarding Time: Synthesis of Improved Genetic Algorithms
—With the aim to minimize boarding time and devise procedures for boarding strategies, this paper develop the synthesis of Improved Genetic Algorithms and simulation. This paper ...
Kang Wang
131
Voted
LOPSTR
2009
Springer
15 years 9 months ago
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
José Iborra, Naoki Nishida, Germán V...