Sciweavers

100 search results - page 8 / 20
» Invariant inference for static checking
Sort
View
ASIAN
2006
Springer
152views Algorithms» more  ASIAN 2006»
14 years 1 months ago
Inferring Disjunctive Postconditions
Polyhedral analysis [9] is an abstract interpretation used for automatic discovery of invariant linear inequalities among numerical varia program. Convexity of this abstract domain...
Corneliu Popeea, Wei-Ngan Chin
PASTE
2004
ACM
14 years 3 months ago
Dynamically inferring temporal properties
Model checking requires a specification of the target system’s desirable properties, some of which are temporal. Formulating a property of the system based on either its abstrac...
Jinlin Yang, David Evans
FM
2001
Springer
96views Formal Methods» more  FM 2001»
14 years 2 months ago
Houdini, an Annotation Assistant for ESC/Java
A static program checker that performs modular checking can check one program module for errors without needing to analyze the entire program. Modular checking requires that each m...
Cormac Flanagan, K. Rustan M. Leino
DLS
2008
149views Languages» more  DLS 2008»
13 years 11 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
BIRTHDAY
2003
Springer
14 years 1 months ago
Aspect Validation Using Model Checking
Aspects are intended to add needed functionality to a system or to treat concerns of the system by augmenting or changing the existing code in a manner that cross-cuts the usual c...
Shmuel Katz, Marcelo Sihman