Sciweavers

3228 search results - page 446 / 646
» Computationally Sound Proofs
Sort
View
LICS
2003
IEEE
15 years 12 months ago
An NP Decision Procedure for Protocol Insecurity with XOR
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
Yannick Chevalier, Ralf Küsters, Michaël...
LICS
2003
IEEE
15 years 12 months ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
GCC
2003
Springer
15 years 11 months ago
Toward the Composition of Semantic Web Services
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
Jinghai Rao, Xiaomeng Su
GD
2003
Springer
15 years 11 months ago
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
GECCO
2003
Springer
100views Optimization» more  GECCO 2003»
15 years 11 months ago
Dense and Switched Modular Primitives for Bond Graph Model Design
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
Kisung Seo, Zhun Fan, Jianjun Hu, Erik D. Goodman,...