Sciweavers

1472 search results - page 4 / 295
» On Model Checking Infinite-State Systems
Sort
View
FM
1994
Springer
113views Formal Methods» more  FM 1994»
15 years 1 months ago
Abstract Model Checking of Infinite Specifications
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
Daniel Jackson
TPHOL
1998
IEEE
15 years 1 months ago
Co-inductive Axiomatization of a Synchronous Language
Abstract. Over the last decade, the increasing demand for the validation of safety critical systems lead to the development of domain-specific programming languages (e.g. synchrono...
David Nowak, Jean-René Beauvais, Jean-Pierr...
IMCSIT
2010
14 years 6 months ago
On the Numerical Analysis of Stochastic Lotka-Volterra Models
The stochastic Lotka-Volterra model is an infinite Markov population model that has applications in various life science domains. Its analysis is challenging since, besides an infi...
Tugrul Dayar, Linar Mikeev, Verena Wolf
RTCSA
1999
IEEE
15 years 1 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer
CADE
2002
Springer
15 years 9 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...