Sciweavers

10072 search results - page 1562 / 2015
» Composition of Model Programs
Sort
View
AOSD
2007
ACM
15 years 11 months ago
Efficiently mining crosscutting concerns through random walks
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Charles Zhang, Hans-Arno Jacobsen
ICALP
2010
Springer
15 years 11 months ago
Energy Parity Games
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative)...
Krishnendu Chatterjee, Laurent Doyen
CAV
2010
Springer
161views Hardware» more  CAV 2010»
15 years 10 months ago
Directed Proof Generation for Machine Code
We present the algorithms used in MCVETO (Machine-Code VErification TOol), a tool to check whether a stripped machinecode program satisfies a safety property. The verification p...
Aditya V. Thakur, Junghee Lim, Akash Lal, Amanda B...
EUROGP
2007
Springer
126views Optimization» more  EUROGP 2007»
15 years 10 months ago
Training Binary GP Classifiers Efficiently: A Pareto-coevolutionary Approach
The conversion and extension of the Incremental Pareto-Coevolution Archive algorithm (IPCA) into the domain of Genetic Programming classification is presented. In particular, the ...
Michal Lemczyk, Malcolm I. Heywood
ICFEM
2007
Springer
15 years 10 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
« Prev « First page 1562 / 2015 Last » Next »