Sciweavers

1497 search results - page 49 / 300
» Extended static checking
Sort
View
CUZA
2004
81views more  CUZA 2004»
13 years 7 months ago
The Quick Check Pre-unification Filter for Typed Grammars: Further Advances
We present several significant improvements in the implementation of the quick check pre-unification filter [7] [10], and the potential way in which the design of the quick check [...
Liviu-Virgil Ciortuz
RISE
2004
Springer
14 years 1 months ago
A Symbolic Model Checker for tccp Programs
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
María Alpuente, Moreno Falaschi, Alicia Vil...
DSN
2005
IEEE
14 years 1 months ago
Checking Array Bound Violation Using Segmentation Hardware
The ability to check memory references against their associated array/buffer bounds helps programmers to detect programming errors involving address overruns early on and thus avo...
Lap-Chung Lam, Tzi-cker Chiueh
SAC
2006
ACM
14 years 1 months ago
Dynamic instantiation-checking components
Parameterization is an effective technique for building flexible, reusable software. When dealing with parameterized components, an important concern is the time at which parame...
Nigamanth Sridhar
ASIAN
2006
Springer
153views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Automata-Based Confidentiality Monitoring
Abstract Non-interference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checkin...
Gurvan Le Guernic, Anindya Banerjee, Thomas P. Jen...