Sciweavers

2962 search results - page 498 / 593
» Reasoning on Association Rules
Sort
View
POPL
2004
ACM
16 years 6 months ago
A type system for well-founded recursion
In the interest of designing a recursive module extension to ML that is as simple and general as possible, we propose a novel type system for general recursion over effectful expr...
Derek Dreyer
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
16 years 6 months ago
The Price of Validity in Dynamic Networks
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
Mayank Bawa, Aristides Gionis, Hector Garcia-Molin...
ICSE
2004
IEEE-ACM
16 years 6 months ago
Assume-Guarantee Verification of Source Code with Design-Level Assumptions
Model checking is an automated technique that can be used to determine whether a system satisfies certain required properties. To address the "state explosion" problem a...
Dimitra Giannakopoulou, Corina S. Pasareanu, Jamie...
ICSE
2008
IEEE-ACM
16 years 6 months ago
PLURAL: checking protocol compliance under aliasing
Enforcing compliance to API usage protocols is notoriously hard due to possible aliasing of objects through multiple references. In previous work we proposed a sound, modular appr...
Kevin Bierhoff, Jonathan Aldrich
ICFP
2001
ACM
16 years 6 months ago
Down with Emacs Lisp: Dynamic Scope Analysis
It is possible to translate code written in Emacs Lisp or another Lisp dialect which uses dynamic scoping to a more modern programming language with lexical scoping while largely ...
Matthias Neubauer, Michael Sperber