Sciweavers

944 search results - page 155 / 189
» Software model checking without source code
Sort
View
TASLP
2011
13 years 2 months ago
A Generative Student Model for Scoring Word Reading Skills
—This paper presents a novel student model intended to automate word-list-based reading assessments in a classroom setting, specifically for a student population that includes b...
Joseph Tepperman, Sungbok Lee, Shrikanth Narayanan...
POPL
2005
ACM
14 years 8 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
AC
2000
Springer
13 years 7 months ago
State of the art in electronic payment systems
nvented abstract representations of value. As time passed, representations of value became more abstract, progressing from barter through bank notes, payment orders, checks, credit...
N. Asokan, Philippe A. Janson, Michael Steiner, Mi...
PLDI
2003
ACM
14 years 29 days ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
CPHYSICS
2004
85views more  CPHYSICS 2004»
13 years 7 months ago
Beyond benchmarking - how experiments and simulations can work together in plasma physics
There has been dramatic progress in the scope and power of plasma simulations in recent years; and because codes are generally cheaper to write, to run and to diagnose than experi...
Martin Greenwald