Sciweavers

496 search results - page 84 / 100
» A formal framework for synthesis and verification of logic p...
Sort
View
CADE
2008
Springer
14 years 7 months ago
Specification Predicates with Explicit Dependency Information
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
Richard Bubel, Reiner Hähnle, Peter H. Schmit...
PODS
2008
ACM
158views Database» more  PODS 2008»
14 years 7 months ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
13 years 9 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001
POPL
2006
ACM
14 years 7 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
14 years 2 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...