Sciweavers

1528 search results - page 34 / 306
» Performance Assertion Checking
Sort
View
PLDI
1998
ACM
14 years 1 months ago
Eliminating Array Bound Checking Through Dependent Types
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
Hongwei Xi, Frank Pfenning
ISCA
2005
IEEE
99views Hardware» more  ISCA 2005»
14 years 2 months ago
Improving Multiprocessor Performance with Coarse-Grain Coherence Tracking
To maintain coherence in conventional shared-memory multiprocessor systems, processors first check other processors’ caches before obtaining data from memory. This coherence che...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
CAV
2004
Springer
136views Hardware» more  CAV 2004»
14 years 17 days ago
JNuke: Efficient Dynamic Analysis for Java
JNuke is a framework for verification and model checking of Java programs. It is a novel combination of run-time verification, explicit-state model checking, and counter-example ex...
Cyrille Artho, Viktor Schuppan, Armin Biere, Pasca...
ESWS
2007
Springer
14 years 3 months ago
Understanding Large Volumes of Interconnected Individuals by Visual Exploration
Abstract. Ontologies are now used within an increasing number of realworld applications. So far, significant effort has been spend in building tools to support users in creating,...
Olaf Noppens, Thorsten Liebig
ENTCS
2007
119views more  ENTCS 2007»
13 years 8 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva