Sciweavers

2774 search results - page 190 / 555
» Query-Driven Program Testing
Sort
View
148
Voted
ASP
2003
Springer
15 years 8 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
148
Voted
CHARME
1999
Springer
130views Hardware» more  CHARME 1999»
15 years 7 months ago
Program Slicing of Hardware Description Languages
Hardware description languages (HDLs) are used today to describe circuits at all levels. In large HDL programs, there is a need for source code reduction techniques to address a my...
Edmund M. Clarke, Masahiro Fujita, Sreeranga P. Ra...
SIGCSE
2008
ACM
136views Education» more  SIGCSE 2008»
15 years 3 months ago
A new paradigm for programming competitions
The annual ACM International Collegiate Programming Contest produces a competitive paradigm that is at odds with the pedagogical goals of modern computer science and software engi...
James F. Bowring
123
Voted
TCS
2008
15 years 3 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
IPSN
2010
Springer
15 years 10 months ago
Slotted programming for sensor networks
We advocate a novel programming approach we call slotted programming that not only addresses the specific hardware capabilities of sensor nodes, but also facilitates coding throu...
Roland Flury, Roger Wattenhofer