Sciweavers

292 search results - page 1 / 59
» Proving Consistency of Pure Methods and Model Fields
Sort
View
FASE
2009
Springer
14 years 5 months ago
Proving Consistency of Pure Methods and Model Fields
Abstract. Pure methods and model fields are useful and common speci
K. Rustan M. Leino, Ronald Middelkoop
TPHOL
2007
IEEE
14 years 5 months ago
Extracting Purely Functional Contents from Logical Inductive Types
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
David Delahaye, Catherine Dubois, Jean-Fréd...
JSAC
2008
140views more  JSAC 2008»
13 years 10 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
CADE
2003
Springer
14 years 11 months ago
Proving Pointer Programs in Higher-Order Logic
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
Farhad Mehta, Tobias Nipkow
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
14 years 3 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan