Sciweavers

504 search results - page 81 / 101
» Reasoning about local properties in modal logic
Sort
View
POPL
2004
ACM
16 years 2 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
PODS
2008
ACM
174views Database» more  PODS 2008»
16 years 1 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
SEMWEB
2007
Springer
15 years 7 months ago
Semantic Cooperation and Knowledge Reuse by Using Autonomous Ontologies
Several proposals have been put forward to support distributed agent cooperation in the Semantic Web, by allowing concepts and roles in one ontology be reused in another ontology. ...
Yuting Zhao, Kewen Wang, Rodney W. Topor, Jeff Z. ...
SIGSOFT
2004
ACM
16 years 2 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
GLVLSI
2009
IEEE
150views VLSI» more  GLVLSI 2009»
15 years 8 months ago
Contradictory antecedent debugging in bounded model checking
In the context of formal verification Bounded Model Checking (BMC) has shown to be very powerful for large industrial designs. BMC is used to check whether a circuit satisfies a...
Daniel Große, Robert Wille, Ulrich Kühn...