Sciweavers

1111 search results - page 57 / 223
» Program Analysis as Model Checking of Abstract Interpretatio...
Sort
View
FPCA
1989
15 years 6 months ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl
MVA
1990
162views Computer Vision» more  MVA 1990»
15 years 3 months ago
Map-Driven Image Interpretation by Associative Model Indexing
d at a high abstraction level, and consists in an expectation-driven search starting from symbolic object descriptions and using a version of a distributed blackboard system for re...
Gian Luca Foresti, Vittorio Murino, Carlo S. Regaz...
139
Voted
DFG
2004
Springer
15 years 6 months ago
Verification of PLC Programs Given as Sequential Function Charts
Programmable Logic Controllers (PLC) are widespread in the manufacturing and processing industries to realize sequential procedures and to avoid safety-critical states. For the spe...
Nanette Bauer, Sebastian Engell, Ralf Huuck, Sven ...
PLDI
2006
ACM
15 years 8 months ago
Termination proofs for systems code
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
121
Voted
ACSD
2005
IEEE
162views Hardware» more  ACSD 2005»
15 years 8 months ago
Complexity Results for Checking Distributed Implementability
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
Keijo Heljanko, Alin Stefanescu