133 search results - page 19 / 27 » Decidable Fragments of Many-Sorted Logic |
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
14 years 3 months ago
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....
CSL
2008
Springer
13 years 11 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
SUM
2009
Springer
14 years 2 months ago
2009
Springer
We propose a framework to compute the utility of an agreement w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formula...
ICFP
2003
ACM
14 years 9 months ago
2003
ACM
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
CONCUR
2011
Springer
12 years 9 months ago
2011
Springer
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...