Sciweavers

9626 search results - page 15 / 1926
» Invariant Based Programming
Sort
View
PASTE
2004
ACM
14 years 3 months ago
Dynamically inferring temporal properties
Model checking requires a specification of the target system’s desirable properties, some of which are temporal. Formulating a property of the system based on either its abstrac...
Jinlin Yang, David Evans
SAS
2004
Springer
103views Formal Methods» more  SAS 2004»
14 years 3 months ago
Information Flow Analysis in Logical Form
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
Torben Amtoft, Anindya Banerjee
SIGSOFT
2004
ACM
14 years 10 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
ICFP
2008
ACM
14 years 9 months ago
A type-preserving compiler in Haskell
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
Louis-Julien Guillemette, Stefan Monnier
SIGCSE
1991
ACM
98views Education» more  SIGCSE 1991»
14 years 1 months ago
Pictures as invariants
The development, specification, and use of a loop invariant are useful and underutilized tools in writing code to solve a problem or implement an algorithm. Invariants are especi...
Owen L. Astrachan