Sciweavers

1458 search results - page 47 / 292
» Extended Term Rewriting Systems
Sort
View
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
15 years 4 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
FLOPS
2008
Springer
14 years 11 months ago
Rewriting and Call-Time Choice: The HO Case
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Francisco Javier López-Fraguas, Juan Rodr&i...
IWANN
2005
Springer
15 years 3 months ago
Input Selection for Long-Term Prediction of Time Series
Prediction of time series is an important problem in many areas of science and engineering. Extending the horizon of predictions further to the future is the challenging and diffic...
Jarkko Tikka, Jaakko Hollmén, Amaury Lendas...
CORR
2004
Springer
107views Education» more  CORR 2004»
14 years 9 months ago
Encapsulation for Practical Simplification Procedures
ACL2 was used to prove properties of two simplification procedures. The procedures differ in complexity but solve the same programming problem that arises in the context of a reso...
Olga Shumsky Matlin, William McCune
RTA
2010
Springer
15 years 1 months ago
On (Un)Soundness of Unravelings
We revisit (un)soundness of transformations of conditional into unconditional rewrite systems. The focus here is on so-called unravelings, the most simple and natural kind of such ...
Karl Gmeiner, Bernhard Gramlich, Felix Schernhamme...