2000 search results - page 52 / 400 » Program Transformation and Proof Transformation |
CIE
2007
Springer
15 years 2 months ago
2007
Springer
We prove confluence of two cut-elimination procedures for the implicational fragment of a standard intuitionistic sequent calculus. One of the cut-elimination procedures uses globa...
ICMT
2009
Springer
15 years 4 months ago
2009
Springer
110
click to vote
ASP
2003
Springer
15 years 3 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
ENTCS
2006
14 years 10 months ago
2006
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
ICMT
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. Constraint programming holds many promises for model driven software development (MDSD). Up to now, constraints have only started to appear in MDSD modeling languages, bu...