1445 search results - page 52 / 289 » Abstract Interpretation of Logic Programs |
ENTCS
2006
14 years 12 months ago
2006
The goal of this paper is to translate (fragments of) the quantified discrete duration calculus QDDC, proposed by P. Pandya, into symbolic acceptors with counters. Acceptors are w...
105
click to vote
IFIP
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. We introduce a calculus with mobile names, distributed principals and primitives for secure remote communication, without any reference to explicit cryptography. The calc...
TOPLAS
2002
14 years 11 months ago
2002
traction and information hiding K. RUSTAN M. LEINO and GREG NELSON Compaq Systems Research Center er describes an approach for verifying programs in the presence of data abstractio...
143
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
CEFP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this paper we sketch some experiments with the construction of a simple compiler for a high level intermediate lazy functional language, with C++ as a target language....