Sciweavers

178 search results - page 33 / 36
» Dependability Arguments with Trusted Bases
Sort
View
POPL
2012
ACM
12 years 2 months ago
Programming with binders and indexed data-types
We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a rest...
Andrew Cave, Brigitte Pientka
ICFP
2007
ACM
14 years 7 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
14 years 4 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
ECLIPSE
2007
ACM
13 years 11 months ago
UnitPlus: assisting developer testing in Eclipse
In the software development life cycle, unit testing is an important phase that helps in early detection of bugs. A unit test case consists of two parts: a test input, which is of...
Yoonki Song, Suresh Thummalapenta, Tao Xie
ECTEL
2006
Springer
13 years 11 months ago
Blended Learning Concepts - a Short Overview
This paper presents a short overview of blended learning, showing arguments for and against these concepts. Potential blended learning scenarios are described that vary depending o...
Sonja Trapp