Sciweavers

185 search results - page 16 / 37
» The Rewriting Logic Semantics Project
Sort
View
ECEASST
2006
114views more  ECEASST 2006»
13 years 8 months ago
Semantic Issues of OCL: Past, Present, and Future
We report on the results of a long-term project to formalize the semantics of OCL 2.0 in Higher-order Logic (HOL). The ultimate goal of the project is to provide a formalized, mach...
Achim D. Brucker, Jürgen Doser, Burkhart Wolf...
APLAS
2010
ACM
13 years 8 months ago
A Logical Mix of Approximation and Separation
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
POPL
1994
ACM
14 years 20 days ago
A Needed Narrowing Strategy
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
Sergio Antoy, Rachid Echahed, Michael Hanus
POPL
2003
ACM
14 years 9 months ago
Pure patterns type systems
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
Gilles Barthe, Horatiu Cirstea, Claude Kirchner, L...
PEPM
2010
ACM
13 years 10 months ago
A3PAT, an approach for certified automated termination proofs
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
Evelyne Contejean, Andrey Paskevich, Xavier Urbain...