Sciweavers

617 search results - page 45 / 124
» Using Formal Methods in a Retrospective Safety Case
Sort
View
FMCAD
2004
Springer
14 years 1 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
EUPROJECTS
2005
Springer
14 years 1 months ago
Participatory Insight to Universal Access: Methods and Validation Exercises
Participatory methods can, in principle, be applied for a variety of purposes to gain insight into the context of use of an artefact or the way in which tasks are performed by end ...
Michael Pieper, Karl Stroetmann
ICLP
2005
Springer
14 years 1 months ago
Modeling Systems in CLP
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
ICML
1996
IEEE
13 years 11 months ago
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
Rémi Munos
FMCAD
2000
Springer
13 years 11 months ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi