Sciweavers

640 search results - page 19 / 128
» Discovering State Invariants
Sort
View
IEEEHPCS
2010
13 years 9 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
FMCO
2004
Springer
14 years 4 months ago
Assertion-Based Encapsulation, Object Invariants and Simulations
In object-oriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial p...
David A. Naumann
FAC
2007
121views more  FAC 2007»
13 years 11 months ago
On assertion-based encapsulation for object invariants and simulations
In object-oriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial p...
David A. Naumann
CAV
2009
Springer
137views Hardware» more  CAV 2009»
14 years 11 months ago
VS3: SMT Solvers for Program Verification
We present VS3 , a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the pow...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
ECOOP
2008
Springer
14 years 21 days ago
A Unified Framework for Verification Techniques for Object Invariants
Verification of object-oriented programs relies on object invariants which express consistency criteria of objects. The semantics of object invariants is subtle, mainly because of...
Sophia Drossopoulou, Adrian Francalanza, Peter M&u...