Sciweavers

209 search results - page 16 / 42
» Logic and refinement for charts
Sort
View
78
Voted
DATE
2004
IEEE
184views Hardware» more  DATE 2004»
15 years 1 months ago
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements
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...
Panagiotis Manolios, Sudarshan K. Srinivasan
DAC
2004
ACM
15 years 10 months ago
Refining the SAT decision ordering for bounded model checking
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...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...
AIML
2000
14 years 11 months ago
Towards a Many-Dimensional Modal Logic for Semantic Processing
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...
Tim Fernando
JANCL
2006
100views more  JANCL 2006»
14 years 9 months ago
An efficient relational deductive system for propositional non-classical logics
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 ...
Andrea Formisano, Marianna Nicolosi Asmundo
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 9 months ago
Extended Computation Tree Logic
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 ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...