Sciweavers

4940 search results - page 103 / 988
» On the Complexity of Universal Programs
Sort
View
115
Voted
ICSE
2003
IEEE-ACM
16 years 4 months ago
Teaching Contract Programming Concepts to Future Software Engineers
Current research in software engineering at Karlstad University is concentrated on non-formal software design methods with a focus on semantics. One goal is to produce methods, wh...
Donald F. Ross
HICSS
2008
IEEE
122views Biometrics» more  HICSS 2008»
15 years 11 months ago
Pedagogy and Overview of a Graduate Program in Digital Investigation Management
Although still a relatively new undergraduate course of study at most colleges and universities, specialized degree programs in computer forensics and digital investigations are n...
Gary C. Kessler, Don Haggerty
ITICSE
2004
ACM
15 years 10 months ago
COMPASS: a CS program assessment project
In this paper, we describe our Computer Science Program Assessment (COMPASS) project. COMPASS uses open-source software tools to support the development and analysis of course por...
Adel M. Abunawass
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 9 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 4 months ago
The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs
Plagiarism detection is a growing need among educational institutions and solutions for different purposes exist. An important field in this direction is detecting cases of source...
Johannes Oetsch, Jörg Pührer, Martin Sch...