Sciweavers

277 search results - page 24 / 56
» Precise reasoning for programs using containers
Sort
View
NIPS
2007
13 years 10 months ago
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
M. M. Mahmud, Sylvian R. Ray
ENTCS
2008
175views more  ENTCS 2008»
13 years 8 months ago
AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System
A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming a...
Cezara Dragoi, Gheorghe Stefanescu
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
14 years 3 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
VL
2002
IEEE
109views Visual Languages» more  VL 2002»
14 years 1 months ago
Assertions in End-User Software Engineering: A Think-Aloud Study
There has been little research on end-user program development beyond the programming phase. Devising ways to address additional phases may be critical, because research shows tha...
Christine Wallace, Curtis R. Cook, Jay Summet, Mar...
PPOPP
2003
ACM
14 years 2 months ago
Compactly representing parallel program executions
Collecting a program’s execution profile is important for many reasons: code optimization, memory layout, program debugging and program comprehension. Path based execution pro...
Ankit Goel, Abhik Roychoudhury, Tulika Mitra