Sciweavers

1882 search results - page 98 / 377
» Transformational Programming and Forests
Sort
View
CP
2000
Springer
15 years 2 months ago
Linear Formulation of Constraint Programming Models and Hybrid Solvers
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
Philippe Refalo
PPDP
2009
Springer
15 years 4 months ago
Automatic refactoring of Erlang programs
This paper describes the design goals and current status of tidier, a software tool that tidies Erlang source code, making it cleaner, simpler, and often also more efficient. In ...
Konstantinos F. Sagonas, Thanassis Avgerinos
IPPS
1998
IEEE
15 years 2 months ago
On the Automatic Validation of Parameterized Unity Programs
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
Jean-Paul Bodeveix, Mamoun Filali
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
15 years 1 months ago
Linear Programming Polytope and Algorithm for Mean Payoff Games
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...
Ola Svensson, Sergei G. Vorobyov
ICMT
2009
Springer
15 years 4 months ago
Automatic Model Generation Strategies for Model Transformation Testing
Testing model transformations requires input models which are graphs of inter-connected objects that must conform to a meta-model and meta-constraints from heterogeneous sources su...
Sagar Sen, Benoit Baudry, Jean-Marie Mottu