M. Oliver Mller, Harald Rue, and Maria Sorea. Predicate abstraction for dense real-time systems. ENTCS, 65(6), 2002. http://www.elsevier.com/locate/entcs/volume65.html. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Structure and Hierarchy in Real-Time Systems - Möller (2002) (Correct)
....to fit the broader context of abstract interpretation. Published material: A preliminary version of this Chapter is available as technical report [MRS01] and a condensed version (with the proofs cut out) is to appear at the workshop on Theory and Practice of Timed Systems (TPTS 2002) MRS02] Chapter 8 Hierarchical Partitioning. This work was advised by Rajeev Alur. Our contributions are the formulation of the algorithm, the experimental implementation in Mocha, the construction and comparison of benchmark examples, and the NP completeness proof. Published material: With a minor ....
M. Oliver Moller, Harald Rue, and Maria Sorea. Predicate Abstraction for Dense Real-Time Systems. in Theory and Practice of Timed Systems (TPTS'2002), 2002. 18
Structure and Hierarchy in Real-Time Systems - Möller (2002) (Correct)
....Interpretation of Dense Real Time. The technical content of this Chapter is joint work with Maria Sorea and Harald Rue.We extended the presentation to fit the broader context of abstract interpretation. Published material: A preliminary version of this Chapter is available as technical report [MRS01] and a condensed version (with the proofs cut out) is to appear at the workshop on Theory and Practice of Timed Systems (TPTS 2002) MRS02] Chapter 8 Hierarchical Partitioning. This work was advised by Rajeev Alur. Our contributions are the formulation of the algorithm, the experimental ....
M. Oliver Moller, Harald Rue, and Maria Sorea. Predicate Abstraction for Dense Real-Time Systems. Research Series RS-01-44, BRICS, Department of Computer Science, University of Aarhus, November 2001. 18
Lemmas on Demand for Satisfiability Solvers - de Moura, Rueß (2002) (4 citations) Self-citation (Rue) (Correct)
No context found.
M. Oliver Moller, Harald Rue, and Maria Sorea. Predicate abstraction for dense real-time systems. Electronic Notes in Theoretical Computer Science, 65(2), 2002.
Structure and Hierarchy in Real-Time Systems Modeling and Analysis - Möller Self-citation (Oliver Oller) (Correct)
No context found.
M. Oliver M oller, Harald Rue, and Maria Sorea. Predicate Abstraction for Dense Real-Time Systems. to appear in Theory and Practice of Timed Systems (TPTS'2002), 2002. 64
Structure and Hierarchy in Real-Time Systems Modeling and Analysis - Möller Self-citation (Oliver Oller) (Correct)
No context found.
M. Oliver M oller, Harald Rue, and Maria Sorea. Predicate Abstraction for Dense Real-Time Systems. Research Series RS-01-44, BRICS, Department of Computer Science, University of Aarhus, November 2001.
Bounded Model Checking for Timed Automata - Sorea (2002) (5 citations) Self-citation (Sorea) (Correct)
....propositional satis ability (SAT) checkers are used to construct counterexamples from satisfying assignments to the propositional variables. It has been demonstrated that BMC is in many cases more e ective in falsifying designs than traditional model checking techniques [CBRZ01, CFF 01] In [dMRS02] the BMC paradigm has been extended to programs over in nite state space, and LTL formulas augmented with a decidable set of constraints. For an in nite state system M , a linear temporal logic formula with constraints , and a bound k, it has been illustrated how a Boolean constraint formula, ....
....the completeness results, we assume as given a solvable constraint theory C that includes the clock constraints , and constraints of the form x where x; x ; y; y 2 Cl are clock variables. To make this paper as self contained as possible, we recall some notions and de nitions from [dMRS02] For the simplicity of the presentation we consider only timed automata that are nonzeno. A complete BMC procedure for timed automata, however, requires an explicit encoding of nonzenoness such as, for example, the one given in [MRS02] De nition 1 (C Programs) Typed variables in V : fx 1 ; ....
[Article contains additional citation context not shown here]
M. Oliver Moller, Harald Rue, and Maria Sorea. Predicate abstraction for dense real-time systems. Electronic Notes in Theoretical Computer Science, 65(6), 2002.
Lazy Approximation for Dense Real-Time Systems (Extended Abstract) - Sorea (2004) (Correct)
No context found.
M. Oliver Mller, Harald Rue, and Maria Sorea. Predicate abstraction for dense real-time systems. ENTCS, 65(6), 2002. http://www.elsevier.com/locate/entcs/volume65.html.
Verification by Abstraction - Shankar (Correct)
No context found.
M. Oliver Moller, Harald Rue, and Maria Sorea. Predicate abstraction for dense real-time systems. Electronic Notes in Theoretical Computer Science, 65(6), 2002. Full version available as Technical Report BRICS-RS-01-44, Department of Computer Science, University of Aarhus, Denmark.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC