3134 search results - page 167 / 627 » Computing full disjunctions |
92
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We define a framework called the prismoid of resources where each vertex refines the λ-calculus by using a different choice to make explicit or implicit (meta-level) the defin...
131
Voted
SPIN
2009
Springer
15 years 10 months ago
2009
Springer
This paper describes a set of software tools developed for teaching concurrency and model checking. jSpin is an elementary development environment for Spin that formats and filter...
126
Voted
SPIN
2009
Springer
15 years 10 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
127
Voted
TLCA
2009
Springer
15 years 10 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
123
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Road sign detection is one of the major concerned topics in the field of driving safety and intelligent vehicle. In this paper, a novel model based on Color Barycenters Hexagon (C...