Sciweavers

4469 search results - page 440 / 894
» Dynamic Program Slicing
Sort
View
ICALP
1995
Springer
15 years 10 months ago
Shortest Path Queries in Digraphs of Small Treewidth
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be ef...
Shiva Chaudhuri, Christos D. Zaroliagis
AIR
2004
106views more  AIR 2004»
15 years 6 months ago
Web-Based Adaptive Tutoring: An Approach Based on Logic Agents and Reasoning about Actions
In this paper we describe an approach to the construction of adaptive tutoring systems, based on techniques from the research area of Reasoning about Actions and Change. This appro...
Matteo Baldoni, Cristina Baroglio, Viviana Patti
PPPJ
2009
ACM
16 years 1 months ago
Phase detection using trace compilation
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable across the entire program execution to be bene...
Christian Wimmer, Marcelo Silva Cintra, Michael Be...
PLDI
2010
ACM
16 years 3 days ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
CSFW
2011
IEEE
14 years 6 months ago
Local Memory via Layout Randomization
—Randomization is used in computer security as a tool to introduce unpredictability into the software infrastructure. In this paper, we study the use of randomization to achieve ...
Radha Jagadeesan, Corin Pitcher, Julian Rathke, Ja...