Sciweavers

2236 search results - page 347 / 448
» Language Independence and Language Tolerance in Logic Progra...
Sort
View
PLDI
2006
ACM
15 years 10 months ago
Combining type-based analysis and model checking for finding counterexamples against non-interference
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...
Hiroshi Unno, Naoki Kobayashi, Akinori Yonezawa
PLDI
2010
ACM
15 years 9 months ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
ICCBR
2009
Springer
15 years 1 months ago
On Similarity Measures Based on a Refinement Lattice
Abstract. Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). In this paper w...
Santiago Ontañón, Enric Plaza
FOSSACS
2008
Springer
15 years 5 months ago
Footprints in Local Reasoning
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
Mohammad Raza, Philippa Gardner
PADL
1999
Springer
15 years 8 months ago
CHAT: The Copy-Hybrid Approach to Tabling
The copying approach to tabling (CAT) is an alternative to SLG-WAM and based on incrementally copying the areas that the SLG-WAM freezes to preserve execution states of suspended ...
Bart Demoen, Konstantinos F. Sagonas