On formal analysis of OO languages using rewriting logic: designing for performance

Authors:
Mark Hills;Grigore Roşu
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Year:
2007

Citing 8
Cited 4

Smalltalk-80: the language and its implementation

Smalltalk-80: the language and its implementation
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Compiling language definitions: the ASF+SDF compiler

ACM Transactions on Programming Languages and Systems (TOPLAS)
Rewriting logic: roadmap and bibliography

Theoretical Computer Science - Rewriting logic and its applications
Maude: specification and programming in rewriting logic

Theoretical Computer Science - Rewriting logic and its applications
The rewriting logic semantics project

Theoretical Computer Science
The maude 2.0 system

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications

A rewriting approach to the design and evolution of object-oriented languages

Companion to the 22nd ACM SIGPLAN conference on Object-oriented programming systems and applications companion
Memory Representations in Rewriting Logic Semantics Definitions

Electronic Notes in Theoretical Computer Science (ENTCS)
Tool Support for Holistic Modelling of Distributed Embedded Systems in Creol

Electronic Notes in Theoretical Computer Science (ENTCS)
KOOL: an application of rewriting logic to language prototyping and analysis

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different designs for the same language feature can cause drastic differences in analysis performance. This paper describes some of these design decisions in the context of KOOL, a concurrent, dynamic, object-oriented language. Also described is a general mechanism used in KOOL to support model checking while still allowing for ongoing, sometimes major, changes to the language definition.