Sciweavers

356 search results - page 47 / 72
» Axiomatizing Causal Reasoning
Sort
View
LICS
2009
IEEE
15 years 6 months ago
An Algebra for Kripke Polynomial Coalgebras
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...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...
APLAS
2009
ACM
15 years 6 months ago
A Fresh Look at Separation Algebras and Share Accounting
Separation Algebras serve as models of Separation Logics; Share Accounting allows reasoning about concurrent-read/exclusive-write resources in Separation Logic. In designing a Conc...
Robert Dockins, Aquinas Hobor, Andrew W. Appel
LICS
2008
IEEE
15 years 6 months ago
On the Expressiveness and Decidability of Higher-Order Process Calculi
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
TPHOL
2007
IEEE
15 years 6 months ago
Source-Level Proof Reconstruction for Interactive Theorem Proving
Abstract. Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof reconstruction takes place internally, forming part...
Lawrence C. Paulson, Kong Woei Susanto
CSL
2005
Springer
15 years 5 months ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder