177 search results - page 31 / 36 » Machine Checking Proof Theory: An Application of Logic to Lo... |
ENTCS
2011
13 years 2 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, āComputational Complexity in Non-Turing Models of Computationā...
CSL
2009
Springer
14 years 1 months ago
2009
Springer
We deļ¬ne an āenriched effect calculusā by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
IANDC
2006
13 years 7 months ago
2006
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
JACM
2002
13 years 7 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
ISSTA
2004
ACM
14 years 23 days ago
2004
ACM
Two operations commute if executing them serially in either order results in the same change of state. In a system in which commands may be issued simultaneously by diļ¬erent use...