Program Transformation Using HATS 1.84

Winter, Victor; Beranek, Jason

doi:10.1007/11877028_15

Cited by 17 publications

(14 citation statements)

References 16 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are lots of tools for assisting with the kinds of calculations we are trying to perform, ranging from calculators [3], through rewrite/transformation systems (CIP-S [1], Stratego [16], ASF+DSF [15] Maude [7] HATS [19]) to full-blown theorem provers (Isabelle/HOL [12], CoQ [2], PVS [14]) including those that support equational reasoning (Isabelle/ISAR [18]). …”

Section: Structure Of This Papermentioning

confidence: 99%

UTPCalc — A Calculator for UTP Predicates

Butterfield

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present the development of the UTP-Calculator: a tool, written in Haskell, that supports rapid prototyping of new theories in the Unifying Theories of Programming paradigm, by supporting an easy way to very quickly perform test calculations. The emphasis during the calculator development was keeping it simple but effective, and relying on the user to have the expertise to check its output. It is not intended to supplant existing theorem prover or language transformation technology. The tool is designed for someone who is both very familiar with UTP theory construction, and familiar enough with Haskell to be able to write pattern-matching code. In this paper we describe how this tool can be used to assist in theory development, by describing the key components of the calculator and how various aspects of such a theory might be encoded. We finish with a discussion of our experience in using the tool.

show abstract

Section: Structure Of This Papermentioning

confidence: 99%

UTPCalc — A Calculator for UTP Predicates

Butterfield

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…HATS, the High Assurance Transformation System [33,34], is a strategic term rewriting system for manipulating parse trees. It offers various combination operators and generic traversal strategies.…”

Section: Related Workmentioning

confidence: 99%

“…Rho and Kniesel [22] propose a type inference mechanism for LogicAJ that we intend to adapt and generalize for GenTL. Another source of inspiration could be HATS [33,34].…”

Section: Future Workmentioning

confidence: 99%

“…In particular, tools that treat transformations as first class entities let programmers quickly define transformations that suit their needs. Depending on their formal foundations these tools can be roughly classified as based on term rewriting [31,4,28,33,1], graph transformation [18], or logic [35,7]. Each category has its particular strengths and weaknesses.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Towards Concrete Syntax Patterns for Logic-based Transformation Rules

Appeltauer

Kniesel

2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmers to know the meta-level representation of the analysed language and to think and express their analyses in terms of this lowlevel representation. In addition, the backtracking-based evaluation strategy of Prolog may lead to subtle semantic problems when used to express transformations of a logic database. In this paper, we propose an alternative approach, GenTL, a generic transformation language that combines logic-based C onditional T ransformations (CTs) and concrete syntax patterns. This combination addresses the above problems while still offering the full expressive power of logic meta-programming. Compared to approaches based on other formalisms, the design of GenTL offers advantages in terms of composability and easy transformation interference analysis.

show abstract

“…Among these are Stratego [17], DMS [3], Strafunski [10], CTC [9], Maude [4], ASF+SDF [16] and HATS [20]. We used the HATS system to implement the library adaptations described in this paper.…”

Section: Infrastructurementioning

confidence: 99%