Sciweavers

716 search results - page 36 / 144
» Semilinear Program Feasibility
Sort
View
PASTE
2004
ACM
15 years 3 months ago
Evaluating the imprecision of static analysis
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
Atanas Rountev, Scott Kagan, Michael Gibas
PLDI
1998
ACM
15 years 1 months ago
Eliminating Array Bound Checking Through Dependent Types
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
Hongwei Xi, Frank Pfenning
70
Voted
CATS
2006
14 years 11 months ago
Formalising the L4 microkernel API
This paper gives an overview of a pilot project on the specification and verification of the L4 highperformance microkernel. Of the three aspects examined in the project, we descr...
Rafal Kolanski, Gerwin Klein
IPCO
2001
117views Optimization» more  IPCO 2001»
14 years 11 months ago
Pruning by Isomorphism in Branch-and-Cut
The paper presents a branch-and-cut for solving (0, 1) integer linear programs having a large symmetry group. The group is used for pruning the enumeration tree and for generating ...
François Margot
ICSQP
1994
14 years 11 months ago
Using Strongest Postconditions to Improve Software Quality
: The cost of developing and maintaining high quality software remains at a premium. In this paper we introduce a practical approach for enhancement of software quality, based on c...
Si Pan, R. Geoff Dromey