Sciweavers

232 search results - page 40 / 47
» Symbolic Bounded Conformance Checking of Model Programs
Sort
View
POPL
2006
ACM
14 years 9 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
FSTTCS
2004
Springer
14 years 2 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
SAT
2004
Springer
85views Hardware» more  SAT 2004»
14 years 2 months ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 3 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
ERLANG
2008
ACM
13 years 10 months ago
Testing Erlang data types with quviq quickcheck
When creating software, data types are the basic bricks. Most of the time a programmer will use data types defined in library modules, therefore being tested by many users over ma...
Thomas Arts, Laura M. Castro, John Hughes