Sciweavers

172 search results - page 24 / 35
» Automatic Termination Analysis of Logic Programs
Sort
View
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
15 years 3 months ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
PPDP
2005
Springer
15 years 2 months ago
Self-tuning resource aware specialisation for prolog
The paper develops a self-tuning resource aware partial evaluation technique for Prolog programs, which derives its own control strategies tuned for the underlying computer archit...
Stephen-John Craig, Michael Leuschel
POPL
2010
ACM
15 years 6 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
IISWC
2009
IEEE
15 years 4 months ago
Logicalization of communication traces from parallel execution
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
Qiang Xu, Jaspal Subhlok, Rong Zheng, Sara Voss
ICST
2008
IEEE
15 years 3 months ago
Verifying and Analyzing Adaptive Logic through UML State Models
It is becoming increasingly important to be able to adapt an application’s behavior at run time in response to changing requirements and environmental conditions. Adaptive progr...
Andres J. Ramirez, Betty H. C. Cheng