3573 search results - page 217 / 715 » Reasoning about Codata |
136
Voted
TPHOL
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
102
Voted
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The quest for modular concurrency reasoning has led to recent proposals that extend program assertions to include not just knowledge about the state, but rights to access...
109
click to vote
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
One of the core services provided by OWL reasoners is classification: the discovery of all subclass relationships between class names occurring in an ontology. Discovering these r...
126
Voted
TARK
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a logic designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent prefere...
148
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...