Sciweavers

62 search results - page 10 / 13
» Formal Verification of a Combination Decision Procedure
Sort
View
EACL
1993
ACL Anthology
14 years 11 months ago
Disjunctions and Inheritance in the Context Feature Structure System
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
Martin Böttcher
CL
2000
Springer
15 years 2 months ago
The Taming of the (X)OR
Abstract. Many key verification problems such as boundedmodel-checking,circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e....
Peter Baumgartner, Fabio Massacci
FROCOS
2007
Springer
15 years 3 months ago
Towards an Automatic Analysis of Web Service Security
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
IGPL
1998
97views more  IGPL 1998»
14 years 9 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
FMICS
2009
Springer
15 years 4 months ago
A Rigorous Methodology for Composing Services
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
Kenneth J. Turner, Koon Leai Larry Tan