85 search results - page 16 / 17 » Reimagining literate programming |
ICSE
2008
IEEE-ACM
14 years 7 months ago
2008
IEEE-ACM
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
TCC
2007
Springer
14 years 12 days ago
2007
Springer
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-...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
KBSE
2009
IEEE
14 years 1 months ago
2009
IEEE
—Developers often change software in ways that cause tests to fail. When this occurs, developers must determine whether failures are caused by errors in the code under test or in...
CSL
2007
Springer
14 years 14 days ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...