Sciweavers

662 search results - page 86 / 133
» Formalizing Basic First Order Model Theory
Sort
View
CSL
2006
Springer
14 years 15 days ago
Reasoning About States of Probabilistic Sequential Programs
A complete and decidable propositional logic for reasoning about states of probabilistic sequential programs is presented. The state logic is then used to obtain a sound Hoare-styl...
Rohit Chadha, Paulo Mateus, Amílcar Sernada...
ECML
2006
Springer
14 years 14 days ago
Learning in One-Shot Strategic Form Games
Abstract. We propose a machine learning approach to action prediction in oneshot games. In contrast to the huge literature on learning in games where an agent's model is deduc...
Alon Altman, Avivit Bercovici-Boden, Moshe Tennenh...
POPL
2010
ACM
14 years 6 months ago
On the Verification Problem for Weak Memory Models
We address the verification problem of finite-state concurrent programs running under weak memory models. These models capture the reordering of program (read and write) operation...
Ahmed Bouajjani, Madanlal Musuvathi, Mohamed Faouz...
TLCA
2009
Springer
14 years 3 months ago
Algebraic Totality, towards Completeness
Finiteness spaces constitute a categorical model of Linear Logic whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefsc...
Christine Tasson
LATA
2009
Springer
14 years 3 months ago
Recent Developments in Algorithmic Teaching
Abstract. The present paper surveys recent developments in algorithmic teaching. First, the traditional teaching dimension model is recalled. Starting from the observation that the...
Frank J. Balbach, Thomas Zeugmann