Sciweavers

9 search results - page 2 / 2
» Reachability Games and Game Semantics: Comparing Nondetermin...
Sort
View
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 4 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
FUIN
2010
130views more  FUIN 2010»
13 years 3 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi
VL
2010
IEEE
209views Visual Languages» more  VL 2010»
13 years 3 months ago
Towards the Automatic Recognition of Computational Thinking for Adaptive Visual Language Learning
Visual programming languages can be used to make computer science more accessible to a broad range of students. The evaluative focus of current research in the area of visual lang...
Kyu Han Koh, Ashok R. Basawapatna, Vicki Bennett, ...
CAV
2009
Springer
215views Hardware» more  CAV 2009»
14 years 5 months ago
Homer: A Higher-Order Observational Equivalence Model checkER
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...
David Hopkins, C.-H. Luke Ong