Sciweavers

632 search results - page 26 / 127
» Proving Invariants of Functional Programs
Sort
View
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
15 years 22 days ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
124
Voted
HYBRID
2010
Springer
15 years 2 months ago
On infinity norms as Lyapunov functions for piecewise affine systems
This paper considers off-line synthesis of stabilizing static feedback control laws for discrete-time piecewise affine (PWA) systems. Two of the problems of interest within this f...
Mircea Lazar, Andrej Jokic
108
Voted
INFORMATICALT
2002
103views more  INFORMATICALT 2002»
15 years 6 days ago
Numerical Representations as Purely Functional Data Structures: a New Approach
This paper is concerned with design, implementation and verification of persistent purely functional data structures which are motivated by the representation of natural numbers us...
Mirjana Ivanovic, Viktor Kuncak
114
Voted
FOSSACS
2007
Springer
15 years 6 months ago
Logical Reasoning for Higher-Order Functions with Local State
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
Nobuko Yoshida, Kohei Honda, Martin Berger
121
Voted
TPHOL
2009
IEEE
15 years 7 months ago
A Hoare Logic for the State Monad
Abstract. This pearl examines how to verify functional programs written using the state monad. It uses Coq’s Program framework to provide strong specifications for the standard ...
Wouter Swierstra