Sciweavers

173 search results - page 13 / 35
» A Framework for Proving Contract-Equipped Classes
Sort
View
POPL
1997
ACM
13 years 11 months ago
Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis
Defining the collecting semantics is usually the first crucial step in adapting the general methodology of abstract interpretation to the semantic framework or programming languag...
Hanne Riis Nielson, Flemming Nielson
EOR
2007
70views more  EOR 2007»
13 years 7 months ago
Solving the maximum edge weight clique problem via unconstrained quadratic programming
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
ICML
2010
IEEE
13 years 5 months ago
Implicit Online Learning
Online learning algorithms have recently risen to prominence due to their strong theoretical guarantees and an increasing number of practical applications for large-scale data ana...
Brian Kulis, Peter L. Bartlett
SOFSEM
2010
Springer
13 years 5 months ago
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
Parosh Aziz Abdulla
BIRTHDAY
2010
Springer
13 years 5 months ago
Strict Canonical Constructive Systems
We define the notions of a canonical inference rule and a canonical constructive system in the framework of strict single-conclusion Gentzen-type systems (or, equivalently, natural...
Arnon Avron, Ori Lahav