A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
Such tools can be obtained for free from the semantic definitions; in our experience in just the few weeks required to define a language's semantics even for large languages like Java. ...
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of powerful software analysis ...
logic definitions have been developed in joint work of the first author with Christiano Braga at UFF Brazil. ...
doi:10.1007/978-3-540-25984-8_1
fatcat:ngcumda3ifgtdou2gxcx6rs474
The Rewriting Logic Semantics Project
2006
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis ...
Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics and SOS in a novel way, avoiding their respective limitations and allowing very succinct semantic definitions ...
to the rewriting logic semantics program. ...
doi:10.1016/j.entcs.2005.10.027
fatcat:3i3x6pfyijf6zo7cwijcki3aqu
The rewriting logic semantics project
2007
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis ...
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations ...
logic semantics program. ...
doi:10.1016/j.tcs.2006.12.018
fatcat:qdhyjvt2ync3fj4arqiphnh2sa
A Rewriting Logic Semantics for ATL
2011
Journal of Object Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper we give a formal semantics of the ATL 3.0 model transformation language using rewriting logic and Maude, which allows addressing these issues. ...
Formal semantics provide precise specifications of the expected behavior of transformations, allowing users to understand them and to use them properly, and MT tool builders to develop correct MT engines ...
Acknowledgments The authors would like to thank Franciso Durán and José E. ...
doi:10.5381/jot.2011.10.1.a5
fatcat:3usukmksijadtihecc2i5lrila
Towards a Rewriting Logic Semantics for ATL
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a formal semantics to the ATL model transformation language using rewriting logic and Maude, which allows addressing these issues. ...
As the complexity of model transformation (MT) grows, the need to count on formal semantics of MT languages also increases. ...
The authors would like to thank Franciso Durán and José E. ...
doi:10.1007/978-3-642-13688-7_16
fatcat:zzgzzdn2o5c7fpouprgtvews4i
The rewriting logic semantics project: A progress report
2013
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Rewriting logic is an executable logical framework well suited for the semantic definition of languages. ...
to real languages; support for real time; semantics of software and hardware modeling languages; and semantics-based analysis tools such as static analyzers, model checkers, and program provers. ...
We also thank all the researchers involved in the rewriting logic semantics project for their many contributions, which we have tried to summarize in this paper without any claims of completeness. ...
doi:10.1016/j.ic.2013.08.004
fatcat:elvl7szyzjgy5mkp2lbeoren4e
The Rewriting Logic Semantics Project: A Progress Report
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
to real languages; support for real time; semantics of software and hardware modeling languages; and semantics-based analysis tools such as static analyzers, model checkers, and program provers. ...
Any such framework has to be judged by its effectiveness to bridge the existing gap between language definitions on the one hand, and language implementations and language analysis tools on the other. ...
We also thank all the researchers involved in the rewriting logic semantics project for their many contributions, which we have tried to summarize in this paper without any claims of completeness. ...
doi:10.1007/978-3-642-22953-4_1
fatcat:ttgfekqv2rfrrb3ei35yqi56iu
Memory Representations in Rewriting Logic Semantics Definitions
2009
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The executability of rewriting logic makes it a compelling environment for language design and experimentation; the ability to interpret programs directly in the language semantics develops assurance that ...
Unfortunately, many obvious representations common in other semantic formalisms can lead to poor performance, including those used to represent program memory. ...
Acknowledgement I extend my thanks to the anonymous reviewers; this paper has greatly benefited from their comments and suggestions. ...
doi:10.1016/j.entcs.2009.05.018
fatcat:nvfmqmg2rvastign5vvkuc6zxi
Rewriting Logic Semantics and Verification of Model Transformations
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Specifically, we formalize model transformations as theories in rewriting logic, so that Maude's reachability analysis and model checking features can be used for verifying them. ...
, which can then be used for defining the semantics of modelbased domain-specific languages. ...
We cordially thank Francisco Durán for his kind help with the CRC and MTT Maude tools. We also thank the anonymous reviewers for their helpful comments and suggestions. ...
doi:10.1007/978-3-642-00593-0_2
fatcat:6i4gmdhqwrbqxn7c26zqq26sa4
A rewriting logic approach to operational semantics
2009
Information and Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The fact that these formal analysis tools are generic, should not fool one into thinking that they must be inefficient. ...
This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming languages. ...
We also thank the students at UIUC who attended courses on programming language design, semantics, and formal methods, who provided important feedback and suggestions. ...
doi:10.1016/j.ic.2008.03.026
fatcat:kwp2c2atjravddk7q2utyd27bu
Formal Semantics of OWL-S with Rewrite Logic
2009
Journal of Software Engineering and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
This paper presents a formal semantics framework for OWL-S sub-set, including its abstraction, syntax, static and dynamic semantics by rewrite logic. ...
Although OWL-S has given semantics to concepts by ontology technology, it gives no semantics to control-flow and data-flow. ...
Here, as a meta-language of rewrite logic, Maude has been chosen as a language to give OWL-S formal semantics in a frame-work in static and dynamic aspects. ...
doi:10.4236/jsea.2009.21004
fatcat:nk6b2ydo4jhprahepxjivg6yga
Rewriting Logic Semantics of a Plan Execution Language
2010
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The formalization of the PLEXIL semantics in rewriting logic poses an interesting challenge due to the synchronous nature of the language and the prioritized rules defining its semantics. ...
The rewriting logic semantics is by itself a formal interpreter of the language and can be used as a semantic benchmark for the implementation of PLEXIL executives. ...
NCC-1-02043 awarded to the National Institute of Aerospace. ...
doi:10.4204/eptcs.18.6
fatcat:b2dtbnqfargcpplbmadcycjzka
A Rewriting Logic Semantics Approach to Modular Program Analysis
2010
International Conference on Rewriting Techniques and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. ...
Standard term rewriting techniques are used to analyze programs by evaluating them in the policy semantics. ...
As background, Section 2 provides an introduction to rewriting logic semantics and K, a rewrite-based formalism for language semantics. ...
doi:10.4230/lipics.rta.2010.151
dblp:conf/rta/HillsR10
fatcat:pmdhfqowzvdgfcpvdwmvt65nfu
Rewriting Logic Systems
2007
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
An important aspect of WRLA is to stimulate discussions of applications of Rewriting Logic and to make the community aware of systems and tools based on Rewriting Logic. ...
Its main application areas are the definition of the syntax and the static semantics of (programming) languages, program transformations and analysis, and for defining translations between languages. ...
Algebraic Specification Formalism Asf is a declarative formalism used to define the semantics of (programming) languages. It provides conditional equations, also allowing negative conditions. ...
doi:10.1016/j.entcs.2007.06.018
fatcat:lrj7qczf7bdavad5szkfidzo7q
Rewriting semantics of production rule sets
2012
The Journal of Logic and Algebraic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Two formal semantics are developed and proved equivalent: a settheoretic semantics that improves upon an earlier effort of ours, and an executable semantics in rewriting logic. ...
Experiments involving several small circuits are detailed wherein the executable semantics and the rewriting logic tool Maude are used to automatically check two important properties: hazard and deadlock ...
Martin to our earlier efforts at formalizing the semantics of production rule sets under various timing assumptions, as well as for having developed the framework of production rule sets to begin with. ...
doi:10.1016/j.jlap.2012.06.002
fatcat:ky27slxbqvctbn4fcz3kb4f7di
« Previous
Showing results 1 — 15 out of 19,022 results