Sciweavers

322 search results - page 48 / 65
» Combinations of Abstract Domains for Logic Programming
Sort
View
101
Voted
PPDP
2005
Springer
15 years 5 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...
POPL
2012
ACM
13 years 7 months ago
Algebraic foundations for effect-dependent optimisations
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
Ohad Kammar, Gordon D. Plotkin
CADE
2009
Springer
16 years 9 days ago
Integrated Reasoning and Proof Choice Point Selection in the Jahob System - Mechanisms for Program Survival
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
Martin C. Rinard
SIGSOFT
2008
ACM
16 years 13 days ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
INTENV
2010
14 years 6 months ago
Proactive Intention Recognition for Home Ambient Intelligence
We explore a coherent combination of two jointly implemented logic programming based systems, namely those of Evolution Prospection and Intention Recognition, to address a number o...
Han The Anh, Luís Moniz Pereira