612 search results - page 15 / 123 » Bounded model checking for knowledge and real time |
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
RTAS
2003
IEEE
15 years 2 months ago
2003
IEEE
Coordinated behavior of mobile robots is an important emerging application area. Different coordinated behaviors can be achieved by assigning sets of control tasks, or strategies,...
67
Voted
VMCAI
2010
Springer
15 years 6 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
KBSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...
73
Voted
GLVLSI
2009
IEEE
15 years 4 months ago
2009
IEEE
In the context of formal verification Bounded Model Checking (BMC) has shown to be very powerful for large industrial designs. BMC is used to check whether a circuit satisfies a...