Sciweavers

613 search results - page 83 / 123
» An analysis framework for network-code programs
Sort
View
KBSE
2010
IEEE
14 years 8 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
VMCAI
2004
Springer
15 years 3 months ago
Automatic Inference of Class Invariants
Abstract. We present a generic framework for the automatic and modular inference of sound class invariants for class-based object oriented languages. The idea is to derive a sound ...
Francesco Logozzo
ESA
2006
Springer
113views Algorithms» more  ESA 2006»
15 years 1 months ago
An LP-Designed Algorithm for Constraint Satisfaction
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
Alexander D. Scott, Gregory B. Sorkin
CONCUR
2006
Springer
15 years 1 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
94
Voted
SARA
2009
Springer
15 years 4 months ago
Some Interval Approximation Techniques for MINLP
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
Nicolas Berger, Laurent Granvilliers