Abstract Interpretation for Proving Secrecy Properties in Security Protocols

By Adi K.   Debbabi M.  

Electronic Notes in Theoretical Computer Science, Vol. 55, Iss. 1, 2004-01 ,pp. : 1-26

Elsevier

Access to resources Recommend Favorite

Proving properties of typed -terms using realizability, covers, and sheaves

By Gallier J.  

Theoretical Computer Science, Vol. 142, Iss. 2, 1995-05 ,pp. : 299-368

Elsevier

Access to resources Recommend Favorite

Proving Termination by Dependency Pairs and Inductive Theorem Proving

By Fuhs Carsten  

Journal of Automated Reasoning, Vol. 47, Iss. 2, 2011-08 ,pp. : 133-160

Springer Publishing Company

Access to resources Recommend Favorite

Proving linearizability with temporal logic

By Bäumler Simon  

Formal Aspects of Computing, Vol. 23, Iss. 1, 2011-01 ,pp. : 91-112

Springer Publishing Company

Access to resources Recommend Favorite

Theorem proving by chain resolution

By Dehornoy P.   Marzouk A.  

Theoretical Computer Science, Vol. 206, Iss. 1, 1998-10 ,pp. : 163-180

Elsevier

Access to resources Recommend Favorite