Sciweavers

4719 search results - page 85 / 944
» Newtonian program analysis
Sort
View
PLDI
1990
ACM
14 years 1 months ago
Task Granularity Analysis in Logic Programs
While logic programming languages offer a great deal of scope for parallelism, there is usually some overhead associated with the execution of goals in parallel because of the wor...
Saumya K. Debray, Nai-Wei Lin, Manuel V. Hermenegi...
JAR
2008
98views more  JAR 2008»
13 years 9 months ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...
SLP
1990
121views more  SLP 1990»
13 years 10 months ago
Analysis of Constraint Logic Programs
eric abstract interpretation framework. The results show significant benefits when using the proposed incremental analysis algorithms.
Kim Marriott, Harald Søndergaard
POPL
1996
ACM
14 years 1 months ago
A Practical and Flexible Flow Analysis for Higher-Order Languages
operators. The analysis is abstract interpretation-based and is parameterized over two polyvariance operators and a projection operator. These operators are used to regulate the sp...
J. Michael Ashley
EOR
2007
123views more  EOR 2007»
13 years 9 months ago
Dynamic programming analysis of the TV game "Who wants to be a millionaire?"
This paper uses dynamic programming to investigate when contestants should use lifelines or when they should just stop answering in the TV quiz show ‘Who wants to be a millionai...
Federico Perea, Justo Puerto