Sciweavers

9626 search results - page 9 / 1926
» Invariant Based Programming
Sort
View
ISSTA
2010
ACM
13 years 11 months ago
Analysis of invariants for efficient bounded verification
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...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...
EMSOFT
2006
Springer
14 years 1 months ago
A hierarchical coordination language for interacting real-time tasks
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...
Arkadeb Ghosal, Alberto L. Sangiovanni-Vincentelli...
TACAS
2012
Springer
316views Algorithms» more  TACAS 2012»
12 years 5 months ago
Compositional Termination Proofs for Multi-threaded Programs
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...
Corneliu Popeea, Andrey Rybalchenko
ICDAR
2009
IEEE
14 years 4 months ago
Multi-Oriented and Multi-Sized Touching Character Segmentation Using Dynamic Programming
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...
Partha Pratim Roy, Umapada Pal, Josep Lladó...
APLAS
2009
ACM
14 years 4 months ago
Bi-abductive Resource Invariant Synthesis
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...
Cristiano Calcagno, Dino Distefano, Viktor Vafeiad...