Order-sorted equality enrichments modulo axioms
Raul Enrique Ramirez Gutierrez2015, Science of Computer Programming
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Built-in equality and inequality predicates based on comparison of canonical forms in algebraic specifications are frequently used because they are handy and efficient. However, their use places algebraic specifications with initial algebra semantics beyond the pale of theorem proving tools based, for example, on explicit or inductionless induction techniques, and of other formal tools for checking key properties such as confluence, termination, and sufficient completeness. Such specifications would instead be amenable to formal analysis if an equationally-defined equality predicate enriching the algebraic data types were to be added to them. Furthermore, having an equationally-defined equality predicate is very useful in its own right, particularly in inductive theorem proving. Is it possible to effectively define a theory transformation E → E that extends an algebraic specification E to a specification E where equationally-defined equality predicates have been added? This paper answers this question in the affirmative for a broad class of order-sorted conditional specifications E that are sort-decreasing, ground confluent, and operationally terminating modulo axioms B and have subsignature of constructors. The axioms B can consist of associativity, or commutativity, or associativity-commutativity axioms, so that the constructors are free modulo B. We prove that the transformation E → E preserves all the just-mentioned properties of E. The transformation has been automated in Maude using reflection and it is used in Maude formal tools.
Related papers
Specification and proof in membership equational logic
Theoretical Computer Science, 2000
This paper is part of a long-term e ort to increase expressiveness of algebraic speciÿcation languages while at the same time having a simple semantic foundation on which e cient execution by rewriting and powerful theorem-proving tools can be based. In particular, our rewriting techniques provide semantic foundations for Maude's functional sublanguage, where they have been e ciently implemented. This e ort started in the late 1970s, led by the ADJ group, who promoted equational logic and universal algebra as the semantic basis of program speciÿcation languages. An important later milestone was the work around order-sorted algebras and the OBJ family of languages developed at SRI-International in the 1980s. This e ort has been substantially advanced in the mid-1990s with the development of Maude, a language based on membership equational logic. Membership equational logic is quite simple, and yet quite powerful. Its atomic formulae are equations and sort membership assertions, and its sentences are Horn clauses. It extends in a conservative way both (a version of) order-sorted equational logic and partial algebra approaches, while Horn logic with equality can be very easily encoded. After introducing the basic concepts of the logic, we give conditions and proof rules with which ecient equational deduction by rewriting can be achieved. We also give completion techniques to transform a speciÿcation into one meeting these conditions. We address the important issue of proving that a speciÿcation protects a subspeciÿcation, a property generalizing the usual notion of su cient completeness. Using tree-automata techniques, we develop a test-set-based approach for proving inductive theorems about a parameterized speciÿcation. We brie y discuss a number of extensions of our techniques, including rewriting modulo axioms such as associativity and commutativity, having extra variables in conditions, and solving goals by narrowing. Finally, : S 0 3 0 4 -3 9 7 5 ( 9 9 ) 0 0 2 0 6 -6 36 A. Bouhoula et al. / Theoretical Computer Science 236 (2000) we discuss the generality of our approach and how it extends several previous approaches. →, respectively. Given a relation → on the set S, an element s ∈ S is in normal form if there is no t ∈ S such that s → t. A normal form of s ∈ S is an element in normal form t ∈ S such that s → * t. We denote by s↓ the set of normal forms of s.
Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
1997
We propose a specification language for the formalization of data types with partial or non-terminating operations as part of a rewrite-based framework for inductive theorem proving. The language requires constructors for designating data items and admits positive/negative conditional equations as axioms in specifications. The (total algebra) semantics for such specifications is based on so-called data models. We develop admissibility conditions that guarantee the unique existence of a distinguished data model. Since admissibility of a specification requires confluence of the induced rewrite relation, we provide an effectively testable confluence criterion which does not presuppose termination.
The use of sorts in algebraic specifications
Recent Trends in Data Type Specification, 1993
Algebraic specification frameworks exploit a variety of sort disciplines. The treatment of sorts has a considerable influence on the ease with which such features as partiality and polymorphism can be specified. This survey gives an accessible overview of various frameworks, focusing on their sort disciplines and assessing their strengths and weaknesses for practical applications. Familiarity with the basic notions of algebraic specification is assumed
Combining algebraic and set-theoretic specifications
Lecture Notes in Computer Science, 1996
Speci cation frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a rich notation for de ning (among other things) abstract data types using formulae of predicate logic and lambda-notation. In contrast, the so-called algebraic speci cation frameworks often limit the type structure to sort constants and rst-order functionalities, and restrict formulae to (conditional) equations. Here, we propose an intermediate framework where algebraic speci cations are enriched with a set-theoretic type structure, but formulae remain in the logic of equational Horn clauses. This combines an expressive yet modest speci cation notation with simple semantics and tractable proof theory.
Parametrization for order-sorted algebraic specification
Journal of Computer and System Sciences, 1990
We investigate parametrization for order-sorted algebraic specifications. As a prerequisite we study free constructions for order-sorted algebras and relate the various approaches to order-sorting. Then we analyse parameter passing, the result being that the notion of ordersorted specification has to be restricted in order to establish our main result, namely, that parameter passing satisfies the same correctness criteria as in the case of many-sorted algebras.
Proof-theoretical analysis of order relations
Archive for Mathematical Logic, 2004
A proof-theoretical analysis of elementary theories of order relations is effected through the formulation of order axioms as mathematical rules added to contraction-free sequent calculus. Among the results obtained are proof-theoretical formulations of conservativity theorems corresponding to Szpilrajn's theorem on the extension of a partial order into a linear one. Decidability of the theories of partial and linear order for quantifier-free sequents is shown by giving terminating methods of proof-search.
Algorithmic correspondence and canonicity for non-distributive logics
arXiv (Cornell University), 2016
We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as 'lattices with operators'. Specifically, we introduce a very general syntactic definition of the class of Sahlqvist formulas and inequalities, which applies uniformly to each LE-signature and is given purely in terms of the order-theoretic properties of the algebraic interpretations of the logical connectives. Together with this, we introduce a variant of the algorithm ALBA, specific to the setting of LEs, which effectively computes first-order correspondents of LE-inequalities, and is guaranteed to succeed on a wide class of inequalities (the so-called inductive inequalities) which significantly extend the Sahlqvist class. Further, we show that every inequality on which ALBA succeeds is canonical. The projection of these results yields state-of-the-art correspondence theory for many well known substructural logics, such as the Lambek calculus and its extensions, the Lambek-Grishin calculus, the logic of (not necessarily distributive) de Morgan lattices, and the multiplicative-additive fragment of linear logic.
Order Structure of Symbolic Assertion Objects
IEEE Transactions on Knowledge and Data Engineering, 1994
We study assertion objects that constitute a particular class of symbolic objects. Symbolic objects constitute a data analysis driven formalism, which can be compared to propositional calculus, but which is oriented toward the duality intension (characteristic properties) versus extension (set of all individuals verifying a given set of properties). The set of assertion objects is endowed with a partial order and a quasi-order. We focus on the property of completeness, which precisely expresses the duality intension-extension. The order structure of complete assertion objects is studied, using notions of lattice theory and Galois connection, and extending R. Wille's work (1982) to multiple-valued data. Two results are then obtained for particular cases
Termination orderings for associative-commutative rewriting systems
Carolina Digital Repository (University of North Carolina at Chapel Hill), 1985
In this paper we describe a new class of orderings-associative path orderings-for proving termination of associative-commutative term rewriting systems. These orderings are based on the concept of simplification orderings and extend the well-known recursive path orderings to Econgruence classes, where E is an equational theory consisting of associativity and commutativity axioms. Associative path orderings are applicable to term rewriting systems for which a precedence ordering on the set of operator symbols can be defined that satisfies a certain condition, the associative path condition. The precedence ordering can often be derived from the structure of the reduction rules. We include termination proofs for various term rewriting systems (for rings, boolean algebra, etc .) and, in addition, point out ways to handle situations where the associative path condition is too restrictive .
Exploiting Algebraic Laws to Improve Mechanized Axiomatization
In the field of structural operational semantics (SOS), there have been several proposals both for syntactic rule formats guaranteeing the validity of algebraic laws, and for algorithms for automatically generating ground-complete axiomatizations. However, there has been no synergy between these two types of results. This paper takes the first steps in marrying these two areas of research in the meta-theory of SOS and shows that taking algebraic laws into account in the mechanical generation of axiomatizations results in simpler axiomatizations. The proposed theory is applied to a paradigmatic example from the literature, showing that, in this case, the generated axiomatization coincides with a classic hand-crafted one.
Related papers
Some thoughts on algebraic specification
This paper presents in an informal way the main ideas underlying our work on algebraic speci cation. The central idea, due to Goguen and Burstall, is that much work on algebraic speci cation can be done independently of the particular logical system (or institution) on which the speci cation formalism is based. We also examine the nature of speci cations and speci cation languages, the problem of proving that a statement follows from a speci cation, the important notion of behavioural equivalence, and the evolution of programs from speci cations by stepwise re nement. Although many of the issues discussed are motivated by technically complicated problems, in this paper the technicalities have been suppressed in an attempt to make the ideas more accessible. The same ideas are presented with full technical details in ST 85c]. We assume that the reader is convinced as we are that formal speci cations are not only theoretically interesting but are also practically important. Throughout the paper we also assume some familiarity with the basic concepts of algebraic speci cation, although we do not rely on any speci c technical knowledge. Many of the ideas expressed here were evolved under the in uence of Rod Burstall and Martin Wirsing, but this remains a personal statement.
Exceptions for algebraic specifications: on the meaning of “but”
Science of Computer Programming, 1993
P.-Y., Exceptions for algebraic specifications: on the meaning of "but", Science of Computer Programming 20 (1993) 73-111.
Initial Logic and Induction in Algebraic Specification
Scientific Annals of Cuza University, 2002
The initial truth refers to those properties which are valid in initial models. In this paper we show how the initial truth can be organized as an institution and introduce a valid inference rule system with which we can develop proofs by induction in this logic.
Exhaustive test sets for algebraic specifications
Software Testing, Verification and Reliability, 2016
In the context of testing from algebraic specifications, a first natural testing hypothesis is to suppose that programs and test cases are denoted respectively, by Σ-algebras and ground formulas. Hence, the test case interpretation is defined with respect to the formula satisfaction. So, the set of test cases is a subset of semantic consequences restricted to ground formulas with often further observational conditions on sorts to denote the ones equipped with an equality in the targeted programming language. This subset should ensure program correctness with respect to their specifications, i.e. for every uncorrect program P , there exists a test case that P interprets as "false" by a computation. We then say that this set of test cases is exhaustive. The main interest of such an exhaustive test set is that by submitting any of its test cases, correct programs cannot be rejected as incorrect or dually incorrect programs cannot be accepted as correct. Hence, it is appropriate to start the process of selecting test sets with reasonable sizes. However, depending on the nature of specifications and programs, this subset is not necessarily exhaustive. In this paper, we study conditions to ensure this exhaustiveness property for several algebraic formalisms (equational, conditional positive, quantifier-free and with quantifiers).
CASL: the Common Algebraic Specification Language
Theoretical Computer Science, 2002
Casl is an expressive specification language that has been designed to supersede many existing algebraic specification languages and provide a standard. Casl consists of several layers, including basic (unstructured) specifications, structured specifications and architectural specifications; the latter are used to prescribe the modular structure of implementations.
Higher-order proof by consistency
Lecture Notes in Computer Science, 1996
We investigate an integration of the first-order method of proof by consistency (PBC), also known as term rewriting induction, into theorem proving in higher-order specifications. PBC may be seen as well-founded induction over an ordering which contains the rewrite relation, and in this paper we extend this method to the higher-order rewrite relation due to Nipkow. This yields a proof procedure which has several advantages over conventional induction. First, it is less control demanding; second, it is more flexible in the sense that it does not instantiate variables precisely with every constructor, but instantiates according to the rewrite rules. We show how a number of technical problems can be solved in order for this integration to work, and point out some desirable refinements that involve challenging problems.
Sort inheritance for order-sorted equational presentations
Lecture Notes in Computer Science, 1995
In an algebraic framework, where equational, membership and existence formulas can be expressed, decorated terms and rewriting provide operational semantics and decision procedures for these formulas. We focus in this work on testing sort inheritance, an undecidable property of speci cations, needed for uni cation in this context. A test and three speci c processes, based on completion of a set of rewrite rules, are proposed to check sort inheritance. They depend on the kinds of membership formulas (t : A) allowed in the speci cations: at and linear, shallow and general terms t are studied.
Algebraic specifications for parametrized data types with minimal parameter and target algebras
1982
We conceive a parametrized data type as a partial functor @:
On the Proof Theory of Program Transformations
Logic Journal of IGPL, 1995
We provide an intensional semantics for certain elementary program transformations by describing a translation from these transformations to the derivations of a simple theory of operations and types and we show that this semantics is intensionally faithful. Our objective is to understand more precisely the intensional structure of a class of semi-formal program derivations.
Exploiting algebraic laws to improve mechanized axiomatizations
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013
In the field of structural operational semantics (SOS), there have been several proposals both for syntactic rule formats guaranteeing the validity of algebraic laws, and for algorithms for automatically generating ground-complete axiomatizations. However, there has been no synergy between these two types of results. This paper takes the first steps in marrying these two areas of research in the meta-theory of SOS and shows that taking algebraic laws into account in the mechanical generation of axiomatizations results in simpler axiomatizations. The proposed theory is applied to a paradigmatic example from the literature, showing that, in this case, the generated axiomatization coincides with a classic hand-crafted one.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.