Sciweavers

425 search results - page 24 / 85
» The TPS Theorem Proving System
Sort
View
76
Voted
CSE
2009
IEEE
15 years 4 months ago
Trust Is in the Eye of the Beholder
We carefully investigate humanity’s intuitive understanding of trust and extract from it fundamental properties that succinctly synthesize how trust works. From this detailed ch...
Dimitri do B. DeFigueiredo, Earl T. Barr, Shyhtsun...
RSA
2010
64views more  RSA 2010»
14 years 8 months ago
Vertices of given degree in series-parallel graphs
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
Michael Drmota, Omer Giménez, Marc Noy
PLDI
2012
ACM
13 years 4 days ago
Speculative linearizability
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
Rachid Guerraoui, Viktor Kuncak, Giuliano Losa
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
14 years 7 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
GCC
2003
Springer
15 years 2 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