Executable Computational Logics: Combining Formal Methods and Programming Language Based System Design

Authors:
Jose Meseguer
Affiliations:
-
Venue:
MEMOCODE '03 Proceedings of the First ACM and IEEE International Conference on Formal Methods and Models for Co-Design
Year:
2003

Citing 0
Cited 2

Modeling and prototyping dynamically reconfigurable systems for efficient computation of dynamic programming methods by rewriting-logic

SBCCI '04 Proceedings of the 17th symposium on Integrated circuits and system design
Prototyping time- and space-efficient computations of algebraic operations over dynamically reconfigurable systems modeled by rewriting-logic

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An executable computational logic can provide the desiredbridge between formal system properties and formalmethods to verify them on the one hand, and executablemodels of system designs based on programming languageson the other. However, not all such logics are equally wellsuited for the task. This paper gives some requirements thatseem important for a computational logic to be suitable inpractice, and discusses the experience with rewriting logic,its Maude language implementation, and its formal tool environment, concluding that they seem to meet well those requirements.