Sciweavers

756 search results - page 22 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
HASKELL
2009
ACM
14 years 2 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
ESOP
2011
Springer
12 years 11 months ago
Measure Transformer Semantics for Bayesian Machine Learning
Abstract. The Bayesian approach to machine learning amounts to inferring posterior distributions of random variables from a probabilistic model of how the variables are related (th...
Johannes Borgström, Andrew D. Gordon, Michael...
TASLP
2010
169views more  TASLP 2010»
13 years 2 months ago
Integration of Statistical Models for Dictation of Document Translations in a Machine-Aided Human Translation Task
Abstract--This paper presents a model for machine aided human translation (MAHT) that integrates source language text and target language acoustic information to produce the text t...
Aarthi Reddy, Richard C. Rose
SPIN
2005
Springer
14 years 1 months ago
Model Checking Machine Code with the GNU Debugger
Embedded software verification is an important verification problem that requires the ability to reason about the timed semantics of concurrent behaviors at a low level of atomic...
Eric Mercer, Michael Jones
ASP
2003
Springer
14 years 1 months ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos