Results 1  10
of
5,557
Algebraic laws for nondeterminism and concurrency
 Journal of the ACM
, 1985
"... Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth. Firs ..."
Abstract

Cited by 608 (13 self)
 Add to MetaCart
Abstract. Since a nondeterministic and concurrent program may, in general, communicate repeatedly with its environment, its meaning cannot be presented naturally as an input/output function (as is often done in the denotational approach to semantics). In this paper, an alternative is put forth
Program algebra over an algebra
, 2012
"... We introduce an algebra with free variables, an algebra with undefined values, a program algebra over a term algebra, an algebra with integers, and an algebra with arrays. Program algebra is defined as universal algebra with assignments. Programs depend on the set of generators with supporting vari ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce an algebra with free variables, an algebra with undefined values, a program algebra over a term algebra, an algebra with integers, and an algebra with arrays. Program algebra is defined as universal algebra with assignments. Programs depend on the set of generators with supporting
Algebraic Graph Theory
, 2011
"... Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area is the investiga ..."
Abstract

Cited by 892 (13 self)
 Add to MetaCart
Algebraic graph theory comprises both the study of algebraic objects arising in connection with graphs, for example, automorphism groups of graphs along with the use of algebraic tools to establish interesting properties of combinatorial objects. One of the oldest themes in the area
Program Algebra and Thread Algebra
, 2006
"... These lecture notes comprise slightly abbreviated versions of a number of papers on program algebra and thread algebra. Program algebra in the form of PGA, an algebra of imperative programs dates back to a paper (Program algebra for component code) by Jan Bergstra and Marijke Loots in 2000. Its sema ..."
Abstract
 Add to MetaCart
These lecture notes comprise slightly abbreviated versions of a number of papers on program algebra and thread algebra. Program algebra in the form of PGA, an algebra of imperative programs dates back to a paper (Program algebra for component code) by Jan Bergstra and Marijke Loots in 2000. Its
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing
Execution Architectures for Program Algebra
, 2004
"... We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purpose of explanation and provided with a processalgebraic, compositional semantics, and synthetic architectures, focusing ..."
Abstract

Cited by 27 (24 self)
 Add to MetaCart
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purpose of explanation and provided with a processalgebraic, compositional semantics, and synthetic architectures, focusing
Program Algebra with Repeat Instruction
"... In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction is designed to represent infinite sequences of instructions as finite, linear programs. The resulting program notation is called PGLA and can be considered a string syntax for PGA. We redefine the re ..."
Abstract
 Add to MetaCart
In the setting of program algebra (PGA) we consider the repeat instruction. This special instruction is designed to represent infinite sequences of instructions as finite, linear programs. The resulting program notation is called PGLA and can be considered a string syntax for PGA. We redefine
Comprehending Monads
 Mathematical Structures in Computer Science
, 1992
"... Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised t ..."
Abstract

Cited by 521 (18 self)
 Add to MetaCart
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970's to concisely express certain programs involving lists. This paper shows how list comprehensions may be generalised
An Interactive Metatool for Exploring Program Algebras
, 1999
"... We describe how anexisting tool is extended to allow exploratory reasoning in program algebras with theorem proving support. The existing tool (TkWinHOL and the Re nement Calculator) provides a graphical user interface to the window inference reasoning system for the HOL theorem prover. We show how ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We describe how anexisting tool is extended to allow exploratory reasoning in program algebras with theorem proving support. The existing tool (TkWinHOL and the Re nement Calculator) provides a graphical user interface to the window inference reasoning system for the HOL theorem prover. We show
Results 1  10
of
5,557