Sciweavers

115 search results - page 5 / 23
» Proof Theory for Kleene Algebra
Sort
View
LICS
2002
IEEE
14 years 10 days ago
The Proof Complexity of Linear Algebra
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
Michael Soltys, Stephen A. Cook
FM
2003
Springer
98views Formal Methods» more  FM 2003»
14 years 20 days ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik
LICS
2010
IEEE
13 years 5 months ago
A Sound and Complete Calculus for Finite Stream Circuits
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...
Stefan Milius
LFCS
2009
Springer
14 years 6 hour ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington
ISMVL
2000
IEEE
90views Hardware» more  ISMVL 2000»
13 years 11 months ago
Structures with Many-Valued Information and Their Relational Proof Theory
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
Ivo Düntsch, Wendy MacCaull, Ewa Orlowska