Sciweavers

2976 search results - page 286 / 596
» On the bounded integer programming
Sort
View
IWFM
2003
172views Formal Methods» more  IWFM 2003»
15 years 8 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
DRM
2007
Springer
16 years 23 days ago
Data structures for limited oblivious execution of programs while preserving locality of reference
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
Avinash V. Varadarajan, Ramarathnam Venkatesan, C....
179
Voted
IPPS
2002
IEEE
15 years 11 months ago
Achieving Scalability in Parallel Tabled Logic Programs
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
195
Voted
ECOOP
2001
Springer
15 years 11 months ago
Distinctness and Sharing Domains for Static Analysis of Java Programs
Abstract. The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads...
Isabelle Pollet, Baudouin Le Charlier, Agostino Co...
ITP
2010
159views Mathematics» more  ITP 2010»
15 years 10 months ago
Programming Language Techniques for Cryptographic Proofs
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...
Gilles Barthe, Benjamin Grégoire, Santiago ...