Sciweavers

394 search results - page 69 / 79
» Logical operations and Kolmogorov complexity
Sort
View
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 6 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 ...
WWW
2004
ACM
14 years 9 months ago
A framework for the server-side management of conversations with web services
The emerging standards for the publication of Web Services are focused on the specification of the static interfaces of the operations to be invoked, or on the service composition...
Liliana Ardissono, Davide Cardinio, Giovanna Petro...
ARITH
2001
IEEE
14 years 6 days ago
Computer Arithmetic-A Processor Architect's Perspective
The Instruction Set Architecture (ISA) of a programmable processor is the native languageof the machine. It defines the set of operations and resourcesthat are optimized for that ...
Ruby B. Lee
STACS
2010
Springer
14 years 3 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
14 years 5 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer