4224 search results - page 306 / 845 » Reasoning about Choice |
198
Voted
TPHOL
2009
IEEE
16 years 2 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...
146
Voted
ERSHOV
2009
Springer
16 years 2 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...
179
Voted
SEMWEB
2009
Springer
16 years 2 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...
225
Voted
LICS
2008
IEEE
16 years 1 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...
209
Voted
SYNASC
2008
IEEE
16 years 1 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...