632 search results - page 30 / 127 » Proving Invariants of Functional Programs |
136
Voted
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
79
Voted
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
VMCAI
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a multi-pass interprocedural analysis and transformation for the functional aggregate update problem. Our solution handles untyped programs, including unrestri...
121
click to vote
MICRO
2009
IEEE
15 years 7 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
105
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier...