Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with reference-request
Search options answers only
not deleted
user 236
Reference-request is used when the author needs to know about work related to the question.
6
votes
Reference Request: Application of Block Designs to Software Testing
See Orthogonal Latin squares: an application of experiment design to compiler testing.
- 4,796
29
votes
Accepted
Symbolic Execution is a case of Abstract Interpretation?
I am not aware of a paper concerned with the comparison between symbolic execution and abstract interpretation. Nor do I think one is needed. Reading the original descriptions of these two techniques …
- 4,796
12
votes
What do we know about provably correct programs?
A tool that checks whether a program is correct is sometimes called a program verifier. In this context, "correct" usually means two things: that the program never produces certain outputs (think segm …
- 4,796
4
votes
Successful application of branch-and-bound methods for NP-hard problems
Exact Exponential Algorithms is a nice recent book about such algorithms. Algorithm X for the exact cover problem is also good to know.
- 4,796
44
votes
What's new in purely functional data structures since Okasaki?
Conchon, Filliatre, A Persistent UNION-FIND Data Structure and Semi-persistent Data Structures.
- 4,796
7
votes
Well known classes of boolean formulas that require exponentially long resolution proofs
There is a construction on page 9 of this paper by Groote and Zantema.
8
votes
Practical applications of the Theory of Equality with Uninterpreted Functions (EUF)
Most automatic theorem provers handle EUF in some form. In particular, provers based on the Nelson-Oppen architecture do so. For big systems, however, EUF is usually not enough. One needs specialized …
- 4,796
13
votes
Accepted
Original Hoare Logic termination paper
You probably want
Manna, Pnueli, Axiomatic Approach to Total Correctness of Programs, 1973
- 4,796
22
votes
Books on programming language semantics
Here is a random sample of materials available for free online:
Winskel, The Formal Semantics of Programming Languages, Google Books preview. I don't know anything about this book. It's on the list …
- 4,796