Sciweavers

980 search results - page 95 / 196
» Logical Testing
Sort
View
EACL
1993
ACL Anthology
13 years 10 months ago
The donkey strikes back: Extending the dynamic interpretation "constructively"
The dynamic interpretation of a formula as a binary relation (inducing transitions) on states is extended by alternative treatments of implication, universal quantification, negat...
Tim Fernando
SFM
2007
Springer
107views Formal Methods» more  SFM 2007»
14 years 3 months ago
A Survey of Markovian Behavioral Equivalences
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...
Marco Bernardo
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
14 years 1 months ago
Fault simulation of interconnect opens in digital CMOS circuits
We describe a highly accurate but e cient fault simulator for interconnect opens, based on characterizing the standard cell library with SPICE; using transistor charge equations f...
Haluk Konuk
AAECC
1999
Springer
82views Algorithms» more  AAECC 1999»
13 years 8 months ago
Reasoning over Networks by Symbolic Methods
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
Thomas Sturm
WSC
2004
13 years 10 months ago
Visual Modeling of Business Problems: Workflow and Patterns
Computer-based business analysis relies on models, or algorithmic representations of the business process. Real-life business problems can become very complex, which creates diffi...
Lev Virine, Jason McVean