Results 1  10
of
15
Comparing Meseguer’s Rewriting Logic with the Logic CRWL. Electronic Notes in Theoretical Computer Science 64
 Proceedings WFLP 2001, International Workshop on Functional and (Constraint) Logic Programming, volume 64 of Electronic
, 2002
"... Meseguer’s rewriting logic and the rewriting logic CRWL are two wellknown approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. It is not ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Meseguer’s rewriting logic and the rewriting logic CRWL are two wellknown approaches to rewriting as logical deduction that, despite some clear similarities, were designed with different objectives. Here we study the relationships between them, both at a syntactic and at a semantic level. It is not possible to establish an entailment system map between them, but both can be naturally simulated in each other. Semantically, there is no embedding between the corresponding institutions. We also use the syntactic results to prove reflective properties of CRWL and to extend those already known for Meseguer’s rewriting logic. 1
Combining theorem proving and narrowing for rewritinglogic specifications
 Lecture Notes in Computer Science
, 2010
"... Abstract. We present an approach for verifying dynamic systems specified in rewriting logic, a formal specification language implemented in the Maude system. Our approach is tailored for invariants, i.e., properties that hold on all states reachable from a given class of initial states. The approach ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present an approach for verifying dynamic systems specified in rewriting logic, a formal specification language implemented in the Maude system. Our approach is tailored for invariants, i.e., properties that hold on all states reachable from a given class of initial states. The approach consists in encoding invariance properties into inductive properties written in membership equational logic, a sublogic of rewriting logic also implemented in Maude. The invariants can then be verified using an inductive theorem prover available for membership equational logic, possibly in interaction with narrowingbased symbolic analysis tools for rewritinglogic specifications also available in the Maude environment. We show that it is possible, and useful, to automatically test invariants by symbolic analysis before interactively proving them. 1
A semantic approach to interpolation
 Foundations of Software Science and Computation Structures, 9th International Conference, FOSSACS 2006, volume 3921 of Lecture Notes in Computer Science
, 2006
"... Abstract. Interpolation results are investigated for various types of formulae. By shifting the focus from syntactic to semantic interpolation, we generate, prove and classify more than twenty interpolation results for firstorder logic and some for richer logics. A few of these results nontrivial ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Interpolation results are investigated for various types of formulae. By shifting the focus from syntactic to semantic interpolation, we generate, prove and classify more than twenty interpolation results for firstorder logic and some for richer logics. A few of these results nontrivially generalize known interpolation results. All the others are new. 1
Reasoning about complex requirements in a uniform setting
 Electronic Proceeding of TICTTL, Third International Congress in Tools for Teaching Logic
"... Abstract. The paper formulates HEQ, an institution for hybrid equational logic to provide a uniform setting to express and reasoning about different sorts of properties of complex software. It is also shown how, through the definition of a suitable comorphism to FOL, this can be integrated in Hets, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The paper formulates HEQ, an institution for hybrid equational logic to provide a uniform setting to express and reasoning about different sorts of properties of complex software. It is also shown how, through the definition of a suitable comorphism to FOL, this can be integrated in Hets, providing suitable tool support for teaching and research. The whole exercise was motivated by the need to unify, in a single undergraduate course in a Computer Science curriculum, the specification of data and behavioural constraints of reconfigurable systems. 1 The problem Fundamental infrastructures of modern societies, including those related to financial, health, education, energy and water supply, are critically based on information systems, which are assumed to be trustworthy. Moreover, our way of living depends on software whose reliability is crucial for our own work, security, privacy, and quality of life. This explains why the quest for programs whose correctness could be established by mathematical reasoning, which has
Foundations of the RuleBased System ρLog
"... ABSTRACT. We describe the foundations of a system for rulebased programming which integrates two powerful mechanisms: (1) matching with context variables, sequence variables, and regular constraints for their matching values; and (2) strategic programming with labeled rules. The system is called ρL ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
ABSTRACT. We describe the foundations of a system for rulebased programming which integrates two powerful mechanisms: (1) matching with context variables, sequence variables, and regular constraints for their matching values; and (2) strategic programming with labeled rules. The system is called ρLog, and is built on top of the pattern matching and rulebased programming capabilities of Mathematica. KEYWORDS: Rulebased programming, declarative programming, matching. 1.
Hybrid specification of reactive systems: An institutional approach (extended version)
, 2011
"... Hybrid specification of reactive systems: An institutional approach (extended version) ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Hybrid specification of reactive systems: An institutional approach (extended version)
Using Rewriting Logic To Generate Different Implementations Of
, 2006
"... A novel toolflow based in rewritinglogic is used to automatically generate polynomial approximations for arbitrary continous functions. The simple but powerful semantics of rewriting logic provide a natural mechanism for manipulating algebraic expressions, allowing the development to be done on a h ..."
Abstract
 Add to MetaCart
A novel toolflow based in rewritinglogic is used to automatically generate polynomial approximations for arbitrary continous functions. The simple but powerful semantics of rewriting logic provide a natural mechanism for manipulating algebraic expressions, allowing the development to be done on a higher abstraction level while avoiding the unnecessary semantics required in hardware description and programming languages. The resulting polynomial approximations are rewritten to generate alternative implementation approaches which are automatically converted into different functionally equivalent hardware implementations. The rewritinglogic toolflow can generate implementations for both fine and coarsegrained architectures. This paper presents the implementation results for the Pact XPP coarsegrained reconfigurable architecture.
On requirements engineering for reactive systems: A formal methodology
"... This paper introduces a rigorous methodology for requirements specification of systems that react to external stimulus and consequently evolve through different operational modes, providing, in each of them, different functionalities. The proposed methodology proceeds in three stages, enriching a ..."
Abstract
 Add to MetaCart
This paper introduces a rigorous methodology for requirements specification of systems that react to external stimulus and consequently evolve through different operational modes, providing, in each of them, different functionalities. The proposed methodology proceeds in three stages, enriching a simple statemachine with local algebraic specifications. It resorts to an expressive variant of hybrid logic which is latter translated into firstorder to allow for ample automatic tool support. 1.
A Semantic Approach to Interpolation
"... Craig interpolation is investigated for various types of formulae. By shifting the focus from syntactic to semantic interpolation, we generate, prove and classify a series of interpolation results for firstorder logic. A few of these results nontrivially generalize known interpolation results; al ..."
Abstract
 Add to MetaCart
(Show Context)
Craig interpolation is investigated for various types of formulae. By shifting the focus from syntactic to semantic interpolation, we generate, prove and classify a series of interpolation results for firstorder logic. A few of these results nontrivially generalize known interpolation results; all the others are new. We also discuss some applications of our results to the theory of institutions and of algebraic specifications, and a CraigRobinson version of these results.