534 search results - page 57 / 107 » Proving Termination of Rewrite Systems Using Bounds |
175
Voted
CSFW
1999
IEEE
15 years 8 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
153
Voted
EMSOFT
2005
Springer
15 years 9 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
169
Voted
HASKELL
2009
ACM
15 years 10 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
183
Voted
AAAI
2008
15 years 4 months ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
139
Voted
MOBICOM
2009
ACM
15 years 10 months ago
2009
ACM
Cognitive relays form a special cooperation relationship among users in cognitive radio networks, and help increase the transmission rates of both primary users and secondary user...