Sciweavers

798 search results - page 86 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
DSN
2000
IEEE
14 years 4 days ago
An Automatic SPIN Validation of a Safety Critical Railway Control System
This paper describes an experiment in formal specification and validation performed in the context of an industrial joint project. The project involved an Italian company working...
Stefania Gnesi, Diego Latella, Gabriele Lenzini, C...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 7 months ago
Verification of Java Bytecode using Analysis and Transformation of Logic Programs
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
Elvira Albert, Miguel Gómez-Zamalloa, Laure...
JCT
2006
89views more  JCT 2006»
13 years 7 months ago
Revlex-initial 0/1-polytopes
We introduce revlex-initial 0/1-polytopes as the convex hulls of reverse-lexicographically initial sets of 0/1-vectors. Thus for each n 2d , we consider the 0/1-knapsack polytope ...
Rafael Gillmann, Volker Kaibel
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 5 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 ...
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe