Results 1  10
of
400
Extending the Database Relational Model to Capture More Meaning
 ACM Transactions on Database Systems
, 1979
"... During the last three or four years several investigators have been exploring “semantic models ” for formatted databases. The intent is to capture (in a more or less formal way) more of the meaning of the data so that database design can become more systematic and the database system itself can beha ..."
Abstract

Cited by 338 (2 self)
 Add to MetaCart
During the last three or four years several investigators have been exploring “semantic models ” for formatted databases. The intent is to capture (in a more or less formal way) more of the meaning of the data so that database design can become more systematic and the database system itself can
Completeness and Incompleteness in Nominal Kleene Algebra
, 2014
"... Gabbay and Ciancia (2011) presented a nominal extension of Kleene algebra as a framework for trace semantics with dynamic allocation of resources, along with a semantics consisting of nominal languages. They also provided an axiomatization that captures the behavior of the scoping operator and its ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Gabbay and Ciancia (2011) presented a nominal extension of Kleene algebra as a framework for trace semantics with dynamic allocation of resources, along with a semantics consisting of nominal languages. They also provided an axiomatization that captures the behavior of the scoping operator and its
Nominal Kleene Coalgebra
, 2015
"... We develop the coalgebraic theory of nominal Kleene algebra, including an alternative languagetheoretic semantics, a nominal extension of the Brzozowski derivative, and a bisimulationbased decision procedure for the equational theory. ..."
Abstract
 Add to MetaCart
We develop the coalgebraic theory of nominal Kleene algebra, including an alternative languagetheoretic semantics, a nominal extension of the Brzozowski derivative, and a bisimulationbased decision procedure for the equational theory.
Automated reasoning in Kleene algebra
 CADE 2007, LNCS 4603
, 2007
"... Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. We demonstrate that offtheshelf automated proof and counterexample search is an interesting alternative if combined with the right ..."
Abstract

Cited by 29 (13 self)
 Add to MetaCart
. Particular benefits of this novel approach include “soft ” model checking in a firstorder setting, crosstheory reasoning between standard formalisms and full automation of some (co)inductive arguments. Kleene algebras might therefore provide lightweight formal methods with heavyweight automation. 1
Synchronous Kleene Algebra vs. Concurrent Kleene Algebra
"... Abstract. In this year’s CONCUR conference Concurrent Kleene Algebra (CKA) is presented as a general formalism for reasoning about concurrent programs. Also recently Synchronous Kleene Algebra (SKA) was investigated by this author with the purpose of representing and reasoning about actions/program ..."
Abstract
 Add to MetaCart
Abstract. In this year’s CONCUR conference Concurrent Kleene Algebra (CKA) is presented as a general formalism for reasoning about concurrent programs. Also recently Synchronous Kleene Algebra (SKA) was investigated by this author with the purpose of representing and reasoning about actions
Lazy Caching in Kleene Algebra
, 1994
"... We use Kleene algebra to give a proof of the lazy caching protocol of Afek, Brown and Merritt. The proof is reasonably concise, but its steps can be checked by (mechanizable) straightline program reasoning. 1 Introduction Distributed system design is a notoriously errorprone activity. For this re ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We use Kleene algebra to give a proof of the lazy caching protocol of Afek, Brown and Merritt. The proof is reasonably concise, but its steps can be checked by (mechanizable) straightline program reasoning. 1 Introduction Distributed system design is a notoriously errorprone activity
On partially additive Kleene algebras
 In Proc. 8th Int. Conf. Relational Methods in Computer Science (RelMiCS 8
, 2005
"... We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras. We relate partially additive Kleene algebras to existing al ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras. We relate partially additive Kleene algebras to existing
Proof Automation in Kleene Algebra
"... Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it has been demonstrated that offtheshelf automated proof and counterexample search is an interesting alternative if comb ..."
Abstract
 Add to MetaCart
if combined with the right domain model. Furthermore it has been shown that variants of Kleene algebra might provide lightweight formal methods with heavyweight automation. In this paper we give a brief overview of a number of program analysis and computer mathematics tasks where (variants of) Kleene
Synchronous Kleene Algebra
, 2009
"... The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner’s SCCS calculus. The resulting algebraic structure is called synchronous Kleene algebra. Models are given in terms of sets of synchronous strings and finite automata accepting s ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
synchronous strings. The extension of synchronous Kleene algebra with Boolean tests is presented together with models on sets of guarded synchronous strings and the associated automata on guarded synchronous strings. Completeness w.r.t. the standard interpretations is given for each of the two new formalisms
A Kleene Theorem for Timed Automata
, 1997
"... In this paper we define timed regular expressions, an extension of regular expressions for specifying sets of densetime discretevalued signals. We show that this formalism is equivalent in expressive power to the timed automata of Alur and Dill by providing a translation procedure from expressions ..."
Abstract

Cited by 62 (4 self)
 Add to MetaCart
In this paper we define timed regular expressions, an extension of regular expressions for specifying sets of densetime discretevalued signals. We show that this formalism is equivalent in expressive power to the timed automata of Alur and Dill by providing a translation procedure from expressions
Results 1  10
of
400