499 search results - page 59 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
139
click to vote
ECAI
1992
Springer
15 years 8 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
144
click to vote
PPDP
2005
Springer
2005
Springer
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
15 years 10 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....
126
click to vote
SEKE
2001
Springer
15 years 8 months ago
2001
Springer
ct 7 Applying finite-state verification techniques to software systems looks attractive because they are capable of detecting very subtle 8 defects in the logic design of these s...
156
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
138
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...