2006
DOI: 10.1016/j.jlap.2005.04.004
|View full text |Cite
|
Sign up to set email alerts
|

Kleene modules and linear languages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2008
2008
2013
2013

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…A Kleene module [20] is a structure (K, L, :) where K is a Kleene algebra, L a join-semilattice with least element ⊥ and : a mapping of type L × K → L where P : (p + q) = P : p P : q, P : (p · q) = P : p : q,…”
Section: Hoare Logicmentioning
confidence: 99%
See 1 more Smart Citation
“…A Kleene module [20] is a structure (K, L, :) where K is a Kleene algebra, L a join-semilattice with least element ⊥ and : a mapping of type L × K → L where P : (p + q) = P : p P : q, P : (p · q) = P : p : q,…”
Section: Hoare Logicmentioning
confidence: 99%
“…To obtain a predicate transformer semantics for forward reasoningà la Gordon [8] we have formalised the action of programs as SKAT terms which act on a Boolean algebra of predicates or assertions via a scalar product in a Kleene module [10,20]. We have instantiated this abstract algebra of assertions to the standard powerset algebra over program states realised as maps from variables to values.…”
Section: Introductionmentioning
confidence: 99%
“…Definition 3 (Leiß 2006) An idempotent semimodule ðA; :Þ over a Kleene algebra K is called a Kleene module 2 if it also satisfies the action induction rule…”
Section: Proposition 1 Let S Be An Ordered *-Semiring Then S Is a Klmentioning
confidence: 99%
“…Proposition 2 (Leiß 2006) Let ðK; A; :Þ be a Kleene module. For any r 2 K and a 2 A; the element r à : a is the least solution of the equation x ¼ r : x þ a:…”
Section: Inductive Semimodulesmentioning
confidence: 99%
See 1 more Smart Citation