Sciweavers

1226 search results - page 14 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
92
Voted
FOCS
2007
IEEE
15 years 3 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
81
Voted
LPAR
2004
Springer
15 years 2 months ago
Abstraction-Carrying Code
ion-Carrying Code Elvira Albert1 , Germ´an Puebla2 , and Manuel Hermenegildo2,3 1 DSIP, Universidad Complutense Madrid 2 Facultad de Inform´atica, Technical University of Madrid ...
Elvira Albert, Germán Puebla, Manuel V. Her...
97
Voted
TSE
2010
110views more  TSE 2010»
14 years 8 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...
83
Voted
CADE
2010
Springer
14 years 10 months ago
Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description)
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
Brigitte Pientka, Joshua Dunfield
90
Voted
SIAMJO
2010
135views more  SIAMJO 2010»
14 years 8 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs