Sciweavers

798 search results - page 94 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
IEE
2008
117views more  IEE 2008»
15 years 2 months ago
Formal verification of systems with an unlimited number of components
1 2 3 In many real component-based systems and patterns of component interaction, there can be identified a stable part (like control component, server, instance handler) and a nu...
Pavlína Vareková, Barbora Zimmerova,...
99
Voted
WWW
2010
ACM
15 years 10 months ago
Fine-grained privilege separation for web applications
We present a programming model for building web applications with security properties that can be confidently verified during a security review. In our model, applications are d...
Akshay Krishnamurthy, Adrian Mettler, David Wagner
ASIACRYPT
2003
Springer
15 years 8 months ago
Almost Uniform Density of Power Residues and the Provable Security of ESIGN
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
Tatsuaki Okamoto, Jacques Stern
FMCAD
2007
Springer
15 years 7 months ago
Boosting Verification by Automatic Tuning of Decision Procedures
Parameterized heuristics abound in computer aided design and verification, and manual tuning of the respective parameters is difficult and time-consuming. Very recent results from ...
Frank Hutter, Domagoj Babic, Holger H. Hoos, Alan ...
APSEC
2005
IEEE
15 years 8 months ago
A Formal Semantics of Timed Activity Diagrams and its PROMELA Translation
The lack of a precise semantics for UML activity diagrams makes the reasoning on models constructed using such diagrams infeasible. However, such diagrams are widely used in domai...
Nicolas Guelfi, Amel Mammar