Sciweavers

1137 search results - page 71 / 228
» Partial Program Admission
Sort
View
AMAST
1998
Springer
15 years 6 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
POPL
2012
ACM
13 years 10 months ago
Access permission contracts for scripting languages
The ideal software contract fully specifies the behavior of an operation. Often, in particular in the context of scripting languages, a full specification may be cumbersome to s...
Phillip Heidegger, Annette Bieniusa, Peter Thieman...
115
Voted
IFL
2005
Springer
155views Formal Methods» more  IFL 2005»
15 years 8 months ago
A Binding Scope Analysis for Generic Programs on Arrays
Performance of generic array programs crucially relies on program specialization wrt. shape information. Traditionally, this is done in a rather adhoc fashion by propagating all sh...
Clemens Grelck, Sven-Bodo Scholz, Alexander V. Sha...
PLDI
1993
ACM
15 years 6 months ago
Dependence-Based Program Analysis
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
Richard Johnson, Keshav Pingali
IWFM
1998
15 years 3 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler