632 search results - page 8 / 127 » Proving Invariants of Functional Programs |
104
click to vote
FASE
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...
98
Voted
CONCUR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
108
Voted
VMCAI
2007
Springer
15 years 6 months ago
2007
Springer
We present a constraint-based algorithm for the synthesis of invariants expressed in the combined theory of linear arithmetic and uninterpreted function symbols. Given a set of pro...
AUTOMATICA
2008
15 years 18 days ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
101
click to vote
SIGSOFT
2004
ACM
16 years 1 months ago
2004
ACM
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 ...