Sciweavers

279 search results - page 14 / 56
» Timed Temporal Logics for Abstracting Transient States
Sort
View
CADE
2002
Springer
15 years 11 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...
IFM
2004
Springer
175views Formal Methods» more  IFM 2004»
15 years 4 months ago
State/Event-Based Software Model Checking
Abstract. We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also i...
Sagar Chaki, Edmund M. Clarke, Joël Ouaknine,...
EUROGP
2007
Springer
116views Optimization» more  EUROGP 2007»
15 years 5 months ago
Genetic Programming with Fitness Based on Model Checking
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
Colin G. Johnson
87
Voted
CAV
2010
Springer
172views Hardware» more  CAV 2010»
15 years 2 months ago
Symbolic Bounded Synthesis
Abstract. Synthesis of finite state systems from full linear time temporal logic (LTL) specifications is gaining more and more attention as several recent achievements have signi...
Rüdiger Ehlers
156
Voted
WRLA
2010
14 years 9 months ago
The Linear Temporal Logic of Rewriting Maude Model Checker
Abstract. This paper presents the foundation, design, and implementation of the Linear Temporal Logic of Rewriting model checker as an extension of the Maude system. The Linear Tem...
Kyungmin Bae, José Meseguer