Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
8,979
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract
-
Cited by 917 (75 self)
- Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract
-
Cited by 758 (41 self)
- Add to MetaCart
of states. We describe a general method that represents the state space symbolical/y instead of explicitly. The generality of our method comes from using a dialect of the Mu-Calculus as the primary specification language. We describe a model checking algorithm for Mu-Calculus formulas that uses Bryant’s
Intensional Approaches for Symbolic Methods
, 1998
"... We present a behavioral model for discrete event systems based on an intensional formalism, as a possible approach within the broader trend towards rich symbolic representations in verification. We define Intensional Labeled Transition Systems with associated combinators of parallel composition and ..."
Abstract
- Add to MetaCart
We present a behavioral model for discrete event systems based on an intensional formalism, as a possible approach within the broader trend towards rich symbolic representations in verification. We define Intensional Labeled Transition Systems with associated combinators of parallel composition
Normalization and Paraphrasing Using Symbolic Methods
- Proceeding of the Second International Workshop on Paraphrasing
, 2003
"... We describe an ongoing work in information extraction which is seen as a text normalization task. The normalized representation can be used to detect paraphrases in texts. Normalization and paraphrase detection tasks are built on top of a robust analyzer for English and are exclusively achiev ..."
A symbolic method for k-statistics
- Applied Math. Letters
"... Trough the classical umbral calculus, we provide new, compact and easy to handle expressions of k-statistics, and more in general of U-statistics. In addition such a symbolic method can be naturally extended to multivariate case, i.e. to generalized k-statistics. Keywords: umbral calculus, symmetric ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
Trough the classical umbral calculus, we provide new, compact and easy to handle expressions of k-statistics, and more in general of U-statistics. In addition such a symbolic method can be naturally extended to multivariate case, i.e. to generalized k-statistics. Keywords: umbral calculus
Semantics of Context-Free Languages
- In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a context-free language by defining "at-tributes " of the symbols in a derivation tree for that string. The attributes can be de-fined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract
-
Cited by 569 (0 self)
- Add to MetaCart
"Meaning " may be assigned to a string in a context-free language by defining "at-tributes " of the symbols in a derivation tree for that string. The attributes can be de-fined by functions associated with each production in the grammar. This paper examines the implications
The complexity of theorem-proving procedures
- IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract
-
Cited by 1050 (5 self)
- Add to MetaCart
of two given graphs is isomorphic to a subgraph of the second. Other examples are discussed. A method of measuring the complexity of proof procedures for the predicate calculus is introduced and discussed. Throughout this paper, a set of strings 1 means a set of strings on some fixed, large, finite
Crystallography & NMR system: A new software suite for macromolecular structure determination.
- Acta Crystallogr. D Biol. Crystallogr.
, 1998
"... Abstract A new software suite, called Crystallography & NMR System (CNS), has been developed for macromolecular structure determination by X-ray crystallography or solution nuclear magnetic resonance (NMR) spectroscopy. In contrast to existing structure determination programs the architecture o ..."
Abstract
-
Cited by 1411 (6 self)
- Add to MetaCart
of CNS is highly flexible, allowing for extension to other structure determination methods, such as electron microscopy and solid state NMR spectroscopy. CNS has a hierarchical structure: a high-level hypertext markup language (HTML) user interface, task-oriented user input files, module files, a
Results 1 - 10
of
8,979
