Sciweavers

556 search results - page 90 / 112
» Checking Interval Properties of Computations
Sort
View
DAC
2005
ACM
16 years 2 months ago
Word level predicate abstraction and refinement for verifying RTL verilog
el Predicate Abstraction and Refinement for Verifying RTL Verilog Himanshu Jain CMU SCS, Pittsburgh, PA 15213 Daniel Kroening ETH Z?urich, Switzerland Natasha Sharygina CMU SCS an...
Himanshu Jain, Daniel Kroening, Natasha Sharygina,...
ESOP
2010
Springer
15 years 11 months ago
Automating Security Mediation Placement
Abstract. We present a framework that automatically produces suggestions to resolve type errors in security-typed programs, enabling legacy code to be retrofit with comprehensive s...
Dave King 0002, Divya Muthukumaran, Sanjit A. Sesh...
SAC
2009
ACM
15 years 8 months ago
LTS semantics for use case models
Formalization is a necessary precondition for the specification of precise and unambiguous use case models, which serve as reference points for the design and implementation of so...
Daniel Sinnig, Patrice Chalin, Ferhat Khendek
MIDDLEWARE
2009
Springer
15 years 8 months ago
Automatic Generation of Network Protocol Gateways
The emergence of networked devices in the home has made it possible to develop applications that control a variety of household functions. However, current devices communicate via ...
Yérom-David Bromberg, Laurent Réveil...
ISSAC
2007
Springer
105views Mathematics» more  ISSAC 2007»
15 years 8 months ago
Certification of the QR factor R and of lattice basis reducedness
Given a lattice basis of n vectors in Zn, we propose an algorithm using 12n3 + O(n2) floating point operations for checking whether the basis is LLL-reduced. If the basis is redu...
Gilles Villard