Sciweavers

828 search results - page 92 / 166
» Bounded Hairpin Completion
Sort
View
ESOP
2010
Springer
14 years 2 months ago
CFA2: A Context-Free Approach to Control-Flow Analysis
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
Dimitrios Vardoulakis, Olin Shivers
ATVA
2007
Springer
101views Hardware» more  ATVA 2007»
14 years 2 months ago
On-the-Fly Model Checking of Fair Non-repudiation Protocols
A fair non-repudiation protocol should guarantee, (1) when a sender sends a message to a receiver, neither the sender nor the receiver can deny having participated in this communic...
Guoqiang Li, Mizuhito Ogawa
ESOP
2009
Springer
14 years 1 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
ALGOSENSORS
2006
Springer
14 years 1 months ago
Declarative Resource Naming for Macroprogramming Wireless Networks of Embedded Systems
Programming Wireless Networks of Embedded Systems (WNES) is notoriously difficult and tedious. To simplify WNES programming, we propose Declarative Resource Naming (DRN) to progra...
Chalermek Intanagonwiwat, Rajesh K. Gupta, Amin Va...
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
14 years 1 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh