Logical foundations of CafeOBJ

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logical foundations of CafeOBJ

This paper surveys the logical and mathematical foundations of CafeOBJ, which is a successor of the famous algebraic specification language OBJ but adding several new primitive paradigms such as behavioural concurrent specification and rewriting logic. We first give a concise overview of CafeOBJ. Then we focus on the actual logical foundations of the language at two different levels: basic spec...

متن کامل

CafeOBJ: Logical Foundations and Methodologies

CafeOBJ is an executable industrial strength multi-logic algebraic specification language which is a modern successor of OBJ and incorporates several new algebraic specification paradigms. In this paper we survey its logical foundations and present some of its methodologies.

متن کامل

Logical Semantics for CafeOBJ

This paper presents the semantics of CafeOBJ system and language. CafeOBJ is a succesor of the famous algebraic specification and programming language OBJ but adding several new primitive paradigms to the traditional OBJ language, such as rewriting logic, and behavioural concurrent specification. We do not address here the detalied mathematical aspects of CafeOBJ semantics (which sometimes coul...

متن کامل

Logical Foundations of Services

In this paper we consider a logical system of networks of processes that interact in an asynchronous manner by exchanging messages through communication channels. This provides a foundational algebraic framework for service-oriented computing that constitutes a primary factor in defining logical specifications of services, the way models of these specifications capture service orchestrations, a...

متن کامل

Logical Foundations of Syllable Representations

• Differences in notation do not necessarily entail differences in the information encoded in a particular formalism. • Fonts are notationally equivalent, in the sense that cat and cat are the same word. • In contrast, there are meaningful differences between bracket types in mathematical notation: {1, 2} is an unordered set, while (1, 2) is an ordered pair. Research question: are different syl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2002

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(01)00361-9