Sciweavers

84 search results - page 13 / 17
» Theme-Based Literate Programming
Sort
View
SCAM
2007
IEEE
14 years 29 days ago
Quality Assessment for Embedded SQL
—The access of information systems to underlying relational databases is commonly programmed using embedded SQL queries. Such embedded queries may take the form of string literal...
Huib van den Brink, Rob van der Leek, Joost Visser
CPAIOR
2007
Springer
14 years 26 days ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 6 months ago
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
Paul Tarau
ICSE
2008
IEEE-ACM
14 years 7 months ago
DySy: dynamic symbolic execution for invariant inference
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
Christoph Csallner, Nikolai Tillmann, Yannis Smara...
TCC
2007
Springer
142views Cryptology» more  TCC 2007»
14 years 24 days ago
On Best-Possible Obfuscation
An obfuscator is a compiler that transforms any program (which we will view in this work as a boolean circuit) into an obfuscated program (also a circuit) that has the same input-...
Shafi Goldwasser, Guy N. Rothblum