Sciweavers

509 search results - page 26 / 102
» On the completeness of compositional reasoning methods
Sort
View
CSFW
2012
IEEE
11 years 11 months ago
Verifying Privacy-Type Properties in a Modular Way
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
Myrto Arapinis, Vincent Cheval, Stéphanie D...
ECCV
2002
Springer
14 years 10 months ago
Composite Texture Descriptions
Textures can often more easily be described as a composition of subtextures than as a single texture. The paper proposes a way to model and synthesize such "composite textures...
Alexey Zalesny, Vittorio Ferrari, Geert Caenen, Do...
WWW
2002
ACM
14 years 9 months ago
Simulation, verification and automated composition of web services
Web services -- Web-accessible programs and devices ? are a key application area for the Semantic Web. With the proliferation of Web services and the evolution towards the Semanti...
Srini Narayanan, Sheila A. McIlraith
JLP
2008
91views more  JLP 2008»
13 years 8 months ago
Local variable scoping and Kleene algebra with tests
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We prov...
Kamal Aboul-Hosn, Dexter Kozen
FMCAD
2007
Springer
14 years 3 months ago
Global Optimization of Compositional Systems
—Embedded systems typically consist of a composition of a set of hardware and software IP modules. Each module is heavily optimized by itself. However, when these modules are com...
Fadi A. Zaraket, John Pape, Adnan Aziz, Margarida ...