Sciweavers

378 search results - page 16 / 76
» Automating Mathematical Program Transformations
Sort
View
SIMUTOOLS
2008
13 years 8 months ago
Transforming sources to petri nets: a way to analyze execution of parallel programs
Model checking is a suitable formal technique to analyze parallel programs' execution in an industrial context because automated tools can be designed and operated with very ...
Jean-Baptiste Voron, Fabrice Kordon
ALP
1994
Springer
13 years 11 months ago
Logic Programs as term Rewriting Systems
This paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is de ned which given a logic program computes a TRS. For a...
Massimo Marchiori
ECOOP
2009
Springer
14 years 8 months ago
COPE - Automating Coupled Evolution of Metamodels and Models
Model-based development promises to increase productivity by offering modeling languages tailored to a specific domain. Such modeling languages are typically defined by a metamodel...
Elmar Jürgens, Markus Herrmannsdoerfer, Sebas...
IWFM
1998
117views Formal Methods» more  IWFM 1998»
13 years 8 months ago
A Case Study on Proving Transformations Correct: Data-Parallel Conversion
The issue of correctness in the context of a certain style of program transformation is investigated. This style is characterised by the fully automated application of large numbe...
Stephen Kilpatrick, Maurice Clint, Peter Kilpatric...
LOPSTR
2009
Springer
14 years 1 months ago
A Transformational Approach for Proving Properties of the CHR Constraint Store
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe