This book contains a strictly refereed selection of revised full papers chosen from the papers accepted for presentation during the 11th Workshop on Abstract Data Types held jointly with the 8th COMPASS Workshop in Oslo, Norway, in September 1995. The 25 research papers included were chosen from 57 pre-selected workshop presentations; also included are six invited contributions. The volume reports the progress achieved in the area of algebraic specification since the predecessor meeting held in May 1994.
This volume constitutes the proceedings of the 4th International Conference on Algebraic Methodology and Software Technology, held in Montreal, Canada in July 1995. It includes full papers or extended abstracts of the invited talks, refereed selected contributions, and research prototype tools. The invited speakers are David Gries, Jeanette Wing, Dan Craigen, Ted Ralston, Ewa Orlowska, Krzysztof Apt, Joseph Goguen, and Rohit Parikh. The 29 refereed papers presented were selected from some 100 submissions; they are organized in sections on algebraic and logical foundations, concurrent and reactive systems, software technology, logic programming and databases.
This book constitutes the refereed proceedings of the 15th International Workshop on Computer Science Logic, CSL 2001, held as the 10th Annual Conerence of the EACSL in Paris, France in September 2001. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on linear logic, descriptive complexity, semantics, higher-order programs, model logics, verification, automata, lambda calculus, induction, equational calculus, and constructive theory of types.
This volume - honoring the computer science pioneer Joseph Goguen on his 65th Birthday - includes 32 refereed papers by leading researchers in areas spanned by Goguen's work. The papers address a variety of topics from meaning, meta-logic, specification and composition, behavior and formal languages, as well as models, deduction, and computation, by key members of the research community in computer science and other fields connected with Joseph Goguen's work.
Abstract: "This thesis proposes a general framework for equational logic programming, called category-based equational logic by placing the general principles underlying the design of the programming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equational deduction to an arbitrary category satisfying certain natural conditions; completeness is proved under a hypothesis of quantifier projectivity, using a semantic treatment that regards quantifiers as models rather than variables, and regards valuations as model morphisms rather than functions. This is used as a basis for a model theoretic category-based approach to a paramodulation- based operational semantics for equational logic programming languages. Category-based equational logic in conjunction with the theory of institutions is used to give mathematical foundations for modularisation in equational logic programming. We study the soundness and completeness problem for module imports in the context of a category-based semantics for solutions to equational logic programming queries. Constraint logic programming is integrated into the equational logic programming paradigm by showing that constraint logics are a particular case of category-based equational logic. This follows the methodology of free expansions of models for built-ins along signature inclusions as sketched by Goguen and Meseguer in their papers on Eqlog. The mathematical foundations of constraint logic programming are based on a Herbrand Theorem for constraint logics; this is obtained as an instance of a more general category-based version of Herbrand's Theorem. The results in this thesis apply to equational and constraint logic programming languages that are based on a variety of equational logical systems including many and order sorted equational logics, Horn clause logic, equational logic modulo a theory, constraint logics, and more, as well as any possible combination between them. More importantly, this thesis gives the possibility for developing the equational logic (programming) paradigm over non-conventional structures and thus significantly extending it beyond its tradition."
Software Engineering with OBJ: Algebraic Specification in Action is a comprehensive introduction to OBJ, the most widely used algebraic specification system. As a formal specification language, OBJ makes specifications and designs more precise and easier to read, as well as making maintenance easier and more accurate. OBJ differs from most other specification languages not just in having a formal semantics, but in being executable, either through symbolic execution with term rewriting, or more generally through theorem proving. One problem with specifications is that they are often wrong. OBJ can help validate specifications by executing test cases, and by proving properties. As well as providing a detailed introduction to the language and the OBJ system that implements it, Software Engineering with OBJ: Algebraic Specification in Action provides case studies by leading practitioners in the field, in areas such as computer graphics standards, hardware design, and parallel computation. The case studies demonstrate that OBJ can be used in a wide variety of ways to achieve a wide variety of practical aims in the system development process. The papers on various OBJ systems also demonstrate that the language is relatively easy to understand, implement, and use, and that it supports formal reasoning in a straightforward but powerful way. Software Engineering with OBJ: Algebraic Specification in Action will be of interest to students and teachers in the areas of data types, programming languages, semantics, theorem proving, and algebra, as well as to researchers and practitioners in software engineering.
This book contains selected papers on the language, applications, and environments of CafeOBJ, which is a state-of -the-art algebraic specification language. The authors are speakers at a workshop held in 1998 to commemorate a large industrial/academic project dedicated to CafeOBJ. The project involved more than 40 people from more than 10 organisations, of which 6 are industrial. The workshop attracted about 30 talks and more than 70 attendees.The papers in the book however, are either heavily revised versions presented at the workshop, to reflect recent advancements or research; or completely new ones, written especially for this book. In this regard, the book is not a usual postpublication after a workshop. Also, although it is a compendium of papers that are related to CafeOBJ, the book is not a manual, reference, or tutorial of CafeOBJ. Probably the best description is that it is a collection of papers that investigate how to use, or to make it easy to use, CafeOBJ. Reflecting the diverse nature of the project and its participants (most of the authors are participants to the project), the papers, put together, offer a comprehensive picture from this methodological perspective.Some papers deal with various advanced aspects of the language, such as rewriting logic and behavioural logic. For rewriting logic, a couple of significant applications were reported. In particular, UML, now considered de facto standard language for modelling systems, is the subject of one paper. For behavioural logic, new methodological guidelines are presented. Some papers shed new light on a more traditional paradigm in the language; order-sorted equational specifications. One paper, in particular, deal with a way to associate CafeOBJ with object-oriented programming. The other papers deal with environments for writing and vertifying specifications written in CafeOBJ. Underlying those papers are two major considerations: user interfaces for manipulating specifications, and systematic supports for proofs. All the environments explained in the papers assume and support distributed computing, and de facto standard network technologies, such as WWW and http, are incorporated.
This book constitutes the refereed post-conference proceedings of the 28th International Workshop on Functional and Constraint Logic Programming, WFLP 2020, held in Bologna, Italy, in September 2020. Due to the COVID-19, the workshop was held online. From the 19 full papers submitted, 8 were accepted for presentation at the workshop. The accepted papers cover different programming areas of functional and logic programming, including code generation, verification, and debugging.
This is a report on the formal definition of the CafeOBJ algebraic specification language, which is a modern successor to the famous algebraic language OBJ. While the equational core of CafeOBJ is just a reshaping of OBJ, CafeOBJ significantly extends OBJ by incorporating several recent major developments in the area of algebraic specification, such as behavioural specification and rewriting logic. The definition of the language parallels its logical semantics based on the so-called institutions, which also provide a methodological framework for structuring the presentation of the basic constructs of the language and their semantics. This report presents all the basic constructs of the language together with their semantics and addresses both the programming in-the-small and in-the-large levels. However, it also discusses proof systems and technologies, as well as methodologies. Examples are provided throughout the report as intuitive support for the definitions of the constructs and for illustrating proof techniques and methodologies.
