Results 1  10
of
20
Modal and Temporal Logics for Processes
, 1996
"... this paper have been presented at the 4th European Summer School in Logic, Language and Information, University of Essex, 1992; at the Tempus Summer School for Algebraic and Categorical Methods in Computer Science, Masaryk University, Brno, 1993; and the Summer School in Logic Methods in Concurrency ..."
Abstract

Cited by 69 (2 self)
 Add to MetaCart
this paper have been presented at the 4th European Summer School in Logic, Language and Information, University of Essex, 1992; at the Tempus Summer School for Algebraic and Categorical Methods in Computer Science, Masaryk University, Brno, 1993; and the Summer School in Logic Methods in Concurrency, Aarhus University, 1993. I would like to thank the organisers and the participants of these summer schools, and of the Banff higher order workshop. I would also like to thank Julian Bradfield for use of his Tex tree constructor for building derivation trees and Carron Kirkwood, Faron Moller, Perdita Stevens and David Walker for comments on earlier drafts.
Dynamic Algebras as a wellbehaved fragment of Relation Algebras
 In Algebraic Logic and Universal Algebra in Computer Science, LNCS 425
, 1990
"... The varieties RA of relation algebras and DA of dynamic algebras are similar with regard to definitional capacity, admitting essentially the same equational definitions of converse and star. They differ with regard to completeness and decidability. The RA definitions that are incomplete with respect ..."
Abstract

Cited by 33 (5 self)
 Add to MetaCart
The varieties RA of relation algebras and DA of dynamic algebras are similar with regard to definitional capacity, admitting essentially the same equational definitions of converse and star. They differ with regard to completeness and decidability. The RA definitions that are incomplete with respect to representable relation algebras, when expressed in their DA form are complete with respect to representable dynamic algebras. Moreover, whereas the theory of RA is undecidable, that of DA is decidable in exponential time. These results follow from representability of the free intensional dynamic algebras. Dept. of Computer Science, Stanford, CA 94305. This paper is based on a talk given at the conference Algebra and Computer Science, Ames, Iowa, June 24, 1988. It will appear in the proceedings of that conference, to be published by SpringerVerlag in the Lecture Notes in Computer Science series. This work was supported by the National Science Foundation under grant number CCR8814921 ...
win and sin: Predicate transformers for concurrency
 ACM Transactions on Programming Languages and Systems
, 1990
"... Digital Equipment Corporation The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate transformers are useful for reasoning about concurrent programs containing operations in which the ..."
Abstract

Cited by 31 (3 self)
 Add to MetaCart
Digital Equipment Corporation The weakest liberal precondition and strongest postcondition predicate transformers are generalized to the weakest invariant and strongest invariant. These new predicate transformers are useful for reasoning about concurrent programs containing operations in which the grain of atomicity is unspecified. They can also be used to replace behavioral arguments with more rigorous assertional ones.
Peirce Algebras
, 1992
"... We present a twosorted algebra, called a Peirce algebra, of relations and sets interacting with each other. In a Peirce algebra, sets can combine with each other as in a Boolean algebra, relations can combine with each other as in a relation algebra, and in addition we have both a relationforming o ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
We present a twosorted algebra, called a Peirce algebra, of relations and sets interacting with each other. In a Peirce algebra, sets can combine with each other as in a Boolean algebra, relations can combine with each other as in a relation algebra, and in addition we have both a relationforming operator on sets (the Peirce product of Boolean modules) and a setforming operator on relations (a cylindrification operation). Two applications of Peirce algebras are given. The first points out that Peirce algebras provide a natural algebraic framework for modelling certain programming constructs. The second shows that the socalled terminological logics arising in knowledge representation have evolved a semantics best described as a calculus of relations interacting with sets.
Dynamic Algebras: Examples, Constructions, Applications
 Studia Logica
, 1991
"... Dynamic algebras combine the classes of Boolean (B 0 0) and regular (R [ ; ) algebras into a single finitely axiomatized variety (B R 3) resembling an Rmodule with "scalar" multiplication 3. The basic result is that is reflexive transitive closure, contrary to the intuition that this con ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
Dynamic algebras combine the classes of Boolean (B 0 0) and regular (R [ ; ) algebras into a single finitely axiomatized variety (B R 3) resembling an Rmodule with "scalar" multiplication 3. The basic result is that is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result is that free dynamic algebras are residually finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of propositional dynamic logic, and yet another notion of regular algebra. Key words: Dynamic algebra, logic, program verification, regular algebra. This paper or...
Linear logic for generalized quantum mechanics
 In Proc. Workshop on Physics and Computation (PhysComp'92
, 1993
"... Quantum logic is static, describing automata having uncertain states but no state transitions and no Heisenberg uncertainty tradeoff. We cast Girard’s linear logic in the role of a dynamic quantum logic, regarded as an extension of quantum logic with time nonstandardly interpreted over a domain of l ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Quantum logic is static, describing automata having uncertain states but no state transitions and no Heisenberg uncertainty tradeoff. We cast Girard’s linear logic in the role of a dynamic quantum logic, regarded as an extension of quantum logic with time nonstandardly interpreted over a domain of linear automata and their dual linear schedules. In this extension the uncertainty tradeoff emerges via the “structure veil. ” When VLSI shrinks to where quantum effects are felt, their computeraided design systems may benefit from such logics of computational behavior having a strong connection to quantum mechanics. 1
A zeroone law for logic with a fixedpoint operator
 Inform. and Control
"... The logic obtained by adding the leastfixedpoint operator to firstorder logic was proposed as a query language by Aho and Ullman (in "Proc. 6th ACM Sympos. on Principles of Programming Languages, " 1979, pp. 110120) and has been studied, particularly in connection with finite models, by numerous ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
The logic obtained by adding the leastfixedpoint operator to firstorder logic was proposed as a query language by Aho and Ullman (in "Proc. 6th ACM Sympos. on Principles of Programming Languages, " 1979, pp. 110120) and has been studied, particularly in connection with finite models, by numerous authors. We extend to this logic, and to the logic containing the more powerful iterativefixedpoint operator, the zeroone law proved for firstorder logic in (Glebskii, Kogan, Liogonki, and Talanov (1969), Kibernetika 2, 3142; Fagin (1976), J. Symbolic Logic 41, 5058). For any sentence q ~ of the extended logic, the proportion of models of q ~ among all structures with universe {1, 2,..., n} approaches 0 or 1 as n tends to infinity. We also show that the problem of deciding, for any cp, whether this proportion approaches 1 is complete for exponential time, if we consider only q)'s with a fixed finite vocabulary (or vocabularies of bounded arity) and complete for doubleexponential time if ~0 is unrestricted. In addition, we establish some related results. © 1985 Academic Press, Inc.
Program Development Schemata as Derived Rules
, 2000
"... This paper makes several contributions towards a clarified view of schemabased program development. First, we propose that schemata can be understood, formalized, and used in a simple way: program development schemata are derived rules. We mean this in the standard sense of a derived rule of infere ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
This paper makes several contributions towards a clarified view of schemabased program development. First, we propose that schemata can be understood, formalized, and used in a simple way: program development schemata are derived rules. We mean this in the standard sense of a derived rule of inference in logic. A schema like Figure i can be formulated as a rule stating that the conclusion follows from the premises defining F, G, and the applicability conditions. By deriving the rule in an axiomatic theory, we validate a semantic statement about it: the conclusion of the rule holds in every model where both the axioms of the theory and the premises of the rule are true. Hence, by selecting a language to work in we control which development schemata are formalizable, and by selecting a theory we determine which schemata are derivable
Abstract relational semantics
 McGill University
, 1989
"... L’algèbre relationnelle abstraite est utilisée pour donner une définition sémantique d’un langage de programmation impératif simple. A cet effet, divers domaines sont spécifiés par des axiomes relationnels. Certaines spécifications définissent des relations sur les types de base du langage (Booléens ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
L’algèbre relationnelle abstraite est utilisée pour donner une définition sémantique d’un langage de programmation impératif simple. A cet effet, divers domaines sont spécifiés par des axiomes relationnels. Certaines spécifications définissent des relations sur les types de base du langage (Booléens et entiers non négatifs); leur présentation insiste sur l’importance de la notion de point. Les autres spécifications construisent les domaines dont les relations sont utilisées pour dénoter les fragments de programmes. Les fragments ainsi traités sont les expressions, les déclarations de variables, les instructions (affectation, séquence, condition et itération) et les procédures. Les relations qui dénotent un fragment dépendent seulement de ce fragment et non de son environnement (à l’exception des procédures), ce qui constitue une approche originale. Enfin, on montre comment prouver la correction d’un fragment, relativement à une spécification, en utilisant sa définition sémantique. Les spécifications, la sémantique et la dérivation de programmes sont donc traitées uniformément dans le cadre de l’algèbre relationnelle abstraite. i Abstract relational algebra is used to define the semantics of a simple imperative language. In order to carry out this task, various domains are specified by relational axioms. Some specifications define relations on the basic types of the language (Booleans and natural numbers); their presentation stresses the importance of the concept of point. Other specifications construct the relational domains whose relations are used to denote programs. The programming constructs that are defined include expressions, variable declarations, assignment statements, whileprogram statements and procedures. A particularity of the semantic definitions is that the relations denoting a program fragment depend only on the fragment, and not on its environment (procedure calls excepted). Finally, it is shown how the semantics of a program fragment can be used to prove its correctness relative to a specification. The result is a uniform abstract relational setting for specification, semantics and program derivation. ii
Time and Information in Sequential and Concurrent Computation
 In Proc. Theory and Practice of Parallel Programming
, 1994
"... Time can be understood as dual to information in extant models of both sequential and concurrent computation. The basis for this duality is phase space, coordinatized by time and information, whose axes are oriented respectively horizontally and vertically. We fit various basic phenomena of computat ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Time can be understood as dual to information in extant models of both sequential and concurrent computation. The basis for this duality is phase space, coordinatized by time and information, whose axes are oriented respectively horizontally and vertically. We fit various basic phenomena of computation, and of behavior in general, to the phase space perspective. The extant twodimensional logics of sequential behavior, the van Glabbeek map of branching time and true concurrency, eventstate duality and scheduleautomaton duality, and Chu spaces, all fit the phase space perspective well, in every case confirming our choice of orientation. 1 Introduction Our recent research has emphasized a basic duality between time and information in concurrent computation. In this paper we return to our earlier work on sequential computation and point out that a very similar duality is present there also. Our main goal here will be to compare concurrent and sequential computation in terms of this dua...