Sciweavers

5 search results - page 1 / 1
» First steps towards SAT-based formal analog verification
Sort
View
ICCAD
2009
IEEE
159views Hardware» more  ICCAD 2009»
13 years 8 months ago
First steps towards SAT-based formal analog verification
Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
POPL
2009
ACM
14 years 11 months ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
FMOODS
2006
14 years 8 days ago
Defining Object-Oriented Execution Semantics Using Graph Transformations
In this paper we describe an application of the theory of graph transformations to the practise of language design. In particular, we have defined the static and dynamic semantics ...
Harmen Kastenberg, Anneke Kleppe, Arend Rensink
ENTCS
2006
168views more  ENTCS 2006»
13 years 11 months ago
Case Study: Model Transformations for Time-triggered Languages
In this study, we introduce a model transformation tool for a time-triggered language: Giotto. The tool uses graphs to represent the source code (Giotto) and the target (the sched...
Tivadar Szemethy
PODS
2008
ACM
158views Database» more  PODS 2008»
14 years 11 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...