3333 search results - page 337 / 667 » Abstract Proof Search |
197
click to vote
CSFW
1999
IEEE
15 years 11 months ago
1999
IEEE
Most formal approaches to security protocol analysis are based on a set of assumptions commonly referred to as the "Dolev-Yao model." In this paper, we use a multiset re...
153
click to vote
KBSE
1997
IEEE
15 years 11 months ago
1997
IEEE
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This...
160
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
178
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
189
click to vote
ESWS
2007
Springer
15 years 10 months ago
2007
Springer
We propose to design and study new techniques for description logic (DL) reasoning based on a prominent data structure that has been applied very successfully in various domains in...