Sciweavers

797 search results - page 96 / 160
» Eliminating Proofs from Programs
Sort
View
ICSE
2008
IEEE-ACM
14 years 10 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...
ICFP
2003
ACM
14 years 10 months ago
A theory of aspects
This paper define the semantics of MinAML, an idealized aspect-oriented programming language, by giving a typedirected translation from its user-friendly external language to its ...
David Walker, Steve Zdancewic, Jay Ligatti
PLDI
2010
ACM
14 years 3 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
CCS
2003
ACM
14 years 3 months ago
Secure protocol composition
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...
Anupam Datta, Ante Derek, John C. Mitchell, Dusko ...
ICFP
2009
ACM
14 years 10 months ago
Experience report: seL4: formally verifying a high-performance microkernel
We report on our experience using Haskell as an executable specification language in the formal verification of the seL4 microkernel. fication connects an abstract operational spe...
Gerwin Klein, Philip Derrin, Kevin Elphinstone