193 search results - page 3 / 39 » Automated Reasoning in Kleene Algebra |
JLP
2008
13 years 5 months ago
2008
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We prov...
LPAR
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
LICS
2009
IEEE
14 years 2 days ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
CSL
2009
Springer
14 years 14 hour ago
2009
Springer
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...