632 search results - page 20 / 127 » Proving Invariants of Functional Programs |
134
click to vote
CSL
2006
Springer
15 years 4 months ago
2006
Springer
Separation Logic is a sub-structural logic that supports local reasoning for imperative programs. It is designed to elegantly describe sharing and aliasing properties of heap struc...
124
Voted
ESOP
2006
Springer
15 years 4 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— This paper first presents a novel control strategy for periodic motion control based on a Hamiltonian system. According to the strategy, hybrid symmetric orbits (ideal walking...
133
Voted
ICFP
1999
ACM
15 years 4 months ago
1999
ACM
Functional logic languages combine the operational principles of the most important declarative programming paradigms, namely functional and logic programming. Inductively sequent...
160
click to vote
ICSE
2011
IEEE-ACM
14 years 4 months ago
2011
IEEE-ACM
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...