Sciweavers

590 search results - page 71 / 118
» Non-Failure Analysis for Logic Programs
Sort
View
PASTE
2004
ACM
14 years 2 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
TCS
2002
13 years 8 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
ENTCS
2006
160views more  ENTCS 2006»
13 years 8 months ago
Checking and Correcting Behaviors of Java Programs at Runtime with Java-MOP
Monitoring-oriented programming (MOP) is a software development and analysis technique in which monitoring plays a fundamental role. MOP users can add their favorite or domain-spe...
Feng Chen, Marcelo d'Amorim, Grigore Rosu
HASKELL
2009
ACM
14 years 3 months ago
The architecture of the Utrecht Haskell compiler
In this paper we describe the architecture of the Utrecht Haskell Compiler (UHC). UHC is a new Haskell compiler, that supports most (but not all) Haskell 98 features, plus some ex...
Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra
ICSE
2011
IEEE-ACM
13 years 8 days ago
Inference of field initialization
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...
Fausto Spoto, Michael D. Ernst