Sciweavers

168 search results - page 20 / 34
» Imperative Program Transformation by Rewriting
Sort
View
ENTCS
2010
133views more  ENTCS 2010»
13 years 3 months ago
Inference of Session Types From Control Flow
This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled sess...
Peter Collingbourne, Paul H. J. Kelly
LISP
2006
160views more  LISP 2006»
13 years 8 months ago
Formal compiler construction in a logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
Jason Hickey, Aleksey Nogin
PLDI
2011
ACM
12 years 11 months ago
Safe optimisations for shared-memory concurrent programs
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
Jaroslav Sevcík
CSMR
2003
IEEE
14 years 1 months ago
Towards Automatical Migration of Transformation Rules after Grammar Extension
The paper addresses two problems in software maintenance. Firstly, some maintenance tasks require modifications of the grammar. A change in a grammar can make syntax and transfor...
Wolfgang Lohmann, Günter Riedewald
CORR
2010
Springer
67views Education» more  CORR 2010»
13 years 8 months ago
Using ATL to define advanced and flexible constraint model transformations
Abstract. Transforming constraint models is an important task in recent constraint programming systems. User-understandable models are defined during the modeling phase but rewriti...
Raphaël Chenouard, Laurent Granvilliers, Rica...