Sciweavers

364 search results - page 41 / 73
» Model checking with Boolean Satisfiability
Sort
View
107
Voted
DAC
2003
ACM
16 years 3 months ago
Temporofunctional crosstalk noise analysis
Noise affects circuit operation by increasing gate delays and causing latches to capture incorrect values. This paper proposes a method of characterizing correlation of signal tra...
Donald Chai, Alex Kondratyev, Yajun Ran, Kenneth H...
109
Voted
ICNP
2007
IEEE
15 years 9 months ago
Network Court Protocol and Malicious Node Conviction
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
Na Li, David Lee
165
Voted
DLT
2009
15 years 12 days ago
Branching-Time Temporal Logics with Minimal Model Quantifiers
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
Fabio Mogavero, Aniello Murano
123
Voted
ICFEM
2004
Springer
15 years 8 months ago
Verifying the On-line Help System of SIEMENS Magnetic Resonance Tomographs
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...
Carsten Sinz, Wolfgang Küchlin
113
Voted
SIGSOFT
2005
ACM
16 years 3 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson