Sciweavers

6608 search results - page 247 / 1322
» On the Completeness of Model Checking
Sort
View
IANDC
2010
68views more  IANDC 2010»
15 years 4 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
TCS
2010
15 years 4 months ago
On the complexities of consistency checking for restricted UML class diagrams
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
Ken Kaneiwa, Ken Satoh
TACAS
2004
Springer
110views Algorithms» more  TACAS 2004»
15 years 11 months ago
An Interpolating Theorem Prover
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...
Kenneth L. McMillan
175
Voted
CAV
2003
Springer
140views Hardware» more  CAV 2003»
15 years 9 months ago
Rabbit: A Tool for BDD-Based Verification of Real-Time Systems
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...
Dirk Beyer, Claus Lewerentz, Andreas Noack
CORR
2011
Springer
193views Education» more  CORR 2011»
15 years 27 days ago
On the regularity of iterated hairpin completion of a single word
Hairpin completion is an abstract operation modeling a DNA biooperation which receives as input a DNA strand w = xαyα, and outputs w = xαy¯αx, where x denotes the Watson-Cric...
Lila Kari, Steffen Kopecki, Shinnosuke Seki