209 search results - page 16 / 42 » Logic and refinement for charts |
157
click to vote
DATE
2004
IEEE
2004
IEEE
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
15 years 9 months ago
We show how to automatically verify that complex XScale-like pipelined machine models satisfy the same safety and liveness properties as their corresponding instruction set archit...
175
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
193
click to vote
AIML
2000
15 years 7 months ago
2000
Notions of context for natural language interpretation are factored in terms of three processes: translation, entailment and attunement. The processes are linked by accessibility r...
174
click to vote
JANCL
2006
15 years 6 months ago
2006
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
141
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...