Sciweavers

5084 search results - page 606 / 1017
» Proving Possibility Properties
Sort
View
ECOOP
2008
Springer
15 years 8 months ago
Computing Stack Maps with Interfaces
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...
Frédéric Besson, Thomas P. Jensen, T...
APPROX
2010
Springer
148views Algorithms» more  APPROX 2010»
15 years 8 months ago
Learning and Lower Bounds for AC0 with Threshold Gates
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
Parikshit Gopalan, Rocco A. Servedio
CCCG
2010
15 years 8 months ago
Existence of zone diagrams in compact subsets of uniformly convex spaces
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...
Eva Kopecká, Daniel Reem, Simeon Reich
FORTE
2010
15 years 8 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri
DAGSTUHL
2007
15 years 8 months ago
From Algebraic Riccati equations to unilateral quadratic matrix equations: old and new algorithms
The problem of reducing an algebraic Riccati equation XCX − AX − XD + B = 0 to a unilateral quadratic matrix equation (UQME) of the kind PX2 + QX + R = 0 is analyzed. New redu...
Dario Andrea Bini, Beatrice Meini, Federico Poloni