Sciweavers

406 search results - page 17 / 82
» Boosting Using Branching Programs
Sort
View
JAVA
1999
Springer
13 years 11 months ago
Practical Guidelines for Boosting Java Server Performance
As Java technology matures, an increasing number of applications that have traditionally been the domain of languages such as C++ are implemented in Java. Many of these applicatio...
Reinhard Klemm
CAI
2009
Springer
14 years 2 months ago
The Graph Programming Language GP
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...
Detlef Plump
WCET
2008
13 years 8 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti
ENTCS
2007
83views more  ENTCS 2007»
13 years 7 months ago
Enhancing Theorem Prover Interfaces with Program Slice Information
This paper proposes an extension to theorem proving interfaces for use with proofdirected debugging and other disproof-based applications. The extension is based around tracking a...
Louise A. Dennis
ICSE
2009
IEEE-ACM
14 years 2 months ago
Lightweight fault-localization using multiple coverage types
Lightweight fault-localization techniques use program coverage to isolate the parts of the code that are most suspicious of being faulty. In this paper, we present the results of ...
Raúl A. Santelices, James A. Jones, Yanbing...