Sciweavers

3256 search results - page 572 / 652
» Mixin-Based Programming in C
Sort
View
CADE
2007
Springer
14 years 9 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
CADE
2004
Springer
14 years 9 months ago
The ICS Decision Procedures for Embedded Deduction
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
Leonardo Mendonça de Moura, Sam Owre, Haral...
OSDI
2006
ACM
14 years 9 months ago
From Uncertainty to Belief: Inferring the Specification Within
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
Ted Kremenek, Paul Twohey, Godmar Back, Andrew Y. ...
MOBIHOC
2004
ACM
14 years 8 months ago
Rate allocation in wireless sensor networks with network lifetime requirement
An important performance consideration for wireless sensor networks is the amount of information collected by all the nodes in the network over the course of network lifetime. Sin...
Yiwei Thomas Hou, Yi Shi, Hanif D. Sherali
EUROSYS
2008
ACM
14 years 6 months ago
Eudaemon: involuntary and on-demand emulation against zero-day exploits
Eudaemon is a technique that aims to blur the borders between protected and unprotected applications, and brings together honeypot technology and end-user intrusion detection and ...
Georgios Portokalidis, Herbert Bos