Sciweavers

903 search results - page 173 / 181
» Completeness Results for Memory Logics
Sort
View
ASE
2002
160views more  ASE 2002»
15 years 5 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
CORR
2004
Springer
105views Education» more  CORR 2004»
15 years 5 months ago
A Grid-enabled Interface to Condor for Interactive Analysis on Handheld and Resource-limited Devices
This paper presents the design and implementation of a Grid-enabled interactive analysis environment for handheld and other resource-limited computing devices. Handheld devices ar...
Arshad Ali, Ashiq Anjum, Tahir Azim, Julian J. Bun...
PRL
2007
180views more  PRL 2007»
15 years 5 months ago
Feature selection based on rough sets and particle swarm optimization
: We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, b...
Xiangyang Wang, Jie Yang, Xiaolong Teng, Weijun Xi...
SP
2010
IEEE
190views Security Privacy» more  SP 2010»
15 years 3 months ago
Noninterference through Secure Multi-execution
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
Dominique Devriese, Frank Piessens

Publication
254views
14 years 11 months ago
Z-fighting aware Depth Peeling
Efficient capturing of the entire topological and geometric information of a 3D scene is an important feature in many graphics applications for rendering multi-fragment effects. Ex...
Andreas Vasilakis and Ioannis Fudos