Sciweavers

768 search results - page 62 / 154
» Symbolic and Abstract Interpretation for C C Programs
Sort
View
PPDP
2010
Springer
13 years 5 months ago
Towards a jitting VM for prolog execution
Most Prolog implementations are implemented in low-level languages such as C and are based on a variation of the WAM instruction set, which enhances their performance but makes th...
Carl Friedrich Bolz, Michael Leuschel, David Schne...
POPL
2006
ACM
14 years 8 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
IFIP
2009
Springer
14 years 2 months ago
Probable Innocence in the Presence of Independent Knowledge
Abstract. We analyse the C anonymity protocol under the novel assumption that the attacker has independent knowledge on behavioural patterns of individual users. Und...
Sardaouna Hamadou, Catuscia Palamidessi, Vladimiro...
PEPM
1994
ACM
14 years 2 days ago
PERs from Projections for Binding-Time Analysis
First-order projection-based binding-time analysis has proven genuinely useful in partial evaluation Lau91a, Lau91c]. There have been three notable generalisations of projection-b...
Kei Davis
CAV
2004
Springer
99views Hardware» more  CAV 2004»
14 years 1 months ago
Range Allocation for Separation Logic
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
Muralidhar Talupur, Nishant Sinha, Ofer Strichman,...