Sciweavers

77 search results - page 4 / 16
» A Pure Reasoning Engine for Programming by Demonstration
Sort
View
CCS
2008
ACM
14 years 11 months ago
Verifiable functional purity in java
Proving that particular methods within a code base are functionally pure--deterministic and side-effect free--would aid verification of security properties including function inve...
Matthew Finifter, Adrian Mettler, Naveen Sastry, D...
SFP
2004
14 years 11 months ago
Generic proofs for combinator-based generic programs
Abstract: Generic programming can bring important benefits to software engineering. In particular, it reduces the burden of verification, since generic proofs can be instantiated a...
Fermín Reig
CAV
2009
Springer
209views Hardware» more  CAV 2009»
15 years 10 months ago
Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
Shuvendu K. Lahiri, Shaz Qadeer, Zvonimir Rakamari...
112
Voted
KBSE
2010
IEEE
14 years 8 months ago
Automated program repair through the evolution of assembly code
A method is described for automatically repairing legacy software at the assembly code level using evolutionary computation. The technique is demonstrated on Java byte code and x8...
Eric Schulte, Stephanie Forrest, Westley Weimer
93
Voted
ISSTA
2004
ACM
15 years 3 months ago
Exploiting purity for atomicity
The notion that certain procedures are atomic is a fundamental correctness property of many multithreaded software systems. A procedure is atomic if for every execution there is a...
Cormac Flanagan, Stephen N. Freund, Shaz Qadeer