1108 search results - page 112 / 222 » Model Checking of Safety Properties |
95
Voted
ICFP
2004
ACM
16 years 20 days ago
2004
ACM
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive higher-...
118
Voted
ICALP
1994
Springer
15 years 4 months ago
1994
Springer
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
105
Voted
SAS
2010
Springer
14 years 11 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
CAV
2010
Springer
15 years 4 months ago
2010
Springer
Analysis of Symbolic Executions Aws Albarghouthi1 , Arie Gurfinkel2 , Ou Wei1,3 , and Marsha Chechik1 1 Department of Computer Science, University of Toronto, Canada 2 Software Eng...
104
Voted
ETFA
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper presents a new approach to modelling and verification of function block applications of the IEC 61499 standard. The approach uses the language of logic programming Prol...