Sciweavers

239 search results - page 17 / 48
» Proof Techniques for Cryptographic Processes
Sort
View
RTA
2005
Springer
14 years 2 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
ESWS
2007
Springer
14 years 14 days ago
Towards Novel Techniques for Reasoning in Expressive Description Logics based on Binary Decision Diagrams
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...
Uwe Keller
RTSS
1999
IEEE
14 years 26 days ago
On the Use of Formal Techniques for Analyzing Dependable Real-Time Protocols
The e ective design of composite dependable and real-time protocols entails demonstrating their proof of correctness and, in practice, the e cient delivery of services. We focus o...
Purnendu Sinha, Neeraj Suri
ICFP
2012
ACM
11 years 11 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
DATE
2009
IEEE
64views Hardware» more  DATE 2009»
14 years 14 days ago
Speculative reduction-based scalable redundancy identification
The process of sequential redundancy identification is the cornerstone of sequential synthesis and equivalence checking frameworks. The scalability of the proof obligations inhere...
Hari Mony, Jason Baumgartner, Alan Mishchenko, Rob...