Sciweavers

1882 search results - page 114 / 377
» Transformational Programming and Forests
Sort
View
PLDI
2012
ACM
13 years 10 days ago
Chimera: hybrid program analysis for determinism
Chimera1 uses a new hybrid program analysis to provide deterministic replay for commodity multiprocessor systems. Chimera leverages the insight that it is easy to provide determin...
Dongyoon Lee, Peter M. Chen, Jason Flinn, Satish N...
APVIS
2004
14 years 11 months ago
XML Database Support for Program Trace Visualisation
Program traces can be used to drive visualisations of reusable components, but such traces can be gigabytes in size, are very expensive to generate, and are hard to extract inform...
Craig Anslow, Stuart Marshall, Robert Biddle, Jame...
IJCAI
1993
14 years 11 months ago
Representing Concurrent Actions in Extended Logic Programming
Gelfond and Lifschitz introduce a declarative language A for describing effects of actions and define a translation of theories in this language into extended logic programs(ELP, ...
Chitta Baral, Michael Gelfond
ICPP
2005
IEEE
15 years 3 months ago
Incremental Parallelization Using Navigational Programming: A Case Study
We show how a series of transformations can be applied to a sequential program to obtain programs that represent successive steps in exploiting parallelism in the original algorit...
Lei Pan, Wenhui Zhang, Arthur Asuncion, Ming Kin L...
PLDI
2004
ACM
15 years 3 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta