9626 search results - page 9 / 1926 » Invariant Based Programming |
169
click to vote
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
162
click to vote
EMSOFT
2006
Springer
15 years 10 months ago
2006
Springer
We designed and implemented a new programming language called Hierarchical Timing Language (HTL) for hard realtime systems. Critical timing constraints are specified within the la...
209
Voted
TACAS
2012
Springer
14 years 1 months ago
2012
Springer
Abstract. Automated verification of multi-threaded programs is difficult. Direct treatment of all possible thread interleavings by reasoning about the program globally is a prohib...
166
click to vote
ICDAR
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we present a scheme towards the segmentation of English multi-oriented touching strings into individual characters. When two or more characters touch, they generate...
149
Voted
APLAS
2009
ACM
16 years 26 days ago
2009
ACM
We describe an algorithm for synthesizing resource invariants that are used in the verification of concurrent programs. This synthesis employs bi-abductive inference to identify t...