Sciweavers

1941 search results - page 73 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
TLCA
2007
Springer
16 years 8 days ago
Computation by Prophecy
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
Ana Bove, Venanzio Capretta
CADE
2007
Springer
16 years 6 months ago
Barendregt's Variable Convention in Rule Inductions
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
Christian Urban, Stefan Berghofer, Michael Norrish
ATAL
2009
Springer
16 years 23 days ago
Rational play and rational beliefs under uncertainty
Alternating-time temporal logic (atl) is one of the most influential logics for reasoning about agents’ abilities. Constructive Strategic Logic (csl) is a variant of atl for im...
Nils Bulling, Wojciech Jamroga
TPHOL
2008
IEEE
16 years 17 days ago
Lightweight Separation
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
Holger Gast
LMCS
2006
98views more  LMCS 2006»
15 years 6 months ago
Approximate reasoning for real-time probabilistic processes
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisi...
Vineet Gupta, Radha Jagadeesan, Prakash Panangaden