364 search results - page 23 / 73 » Model checking with Boolean Satisfiability |
GCC
2003
Springer
14 years 21 days ago
2003
Springer
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
LOGCOM
2011
12 years 10 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
VSTTE
2005
Springer
14 years 29 days ago
2005
Springer
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, mo...
CAISE
2006
Springer
13 years 11 months ago
2006
Springer
Static function hierarchies and models of the dynamic behaviour are typically used in e-commerce systems. Issues to be verifies are the completeness and correctness of the static f...
TSP
2008
13 years 7 months ago
2008
Probabilistic Boolean networks (PBNs) have been recently introduced as a paradigm for modeling genetic regulatory networks. One of the objectives of PBN modeling is to use the netw...