Sciweavers

309 search results - page 39 / 62
» Model Checking Games for Branching Time Logics
Sort
View
108
Voted
CADE
2010
Springer
15 years 27 days ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise
NJC
2002
109views more  NJC 2002»
14 years 11 months ago
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
Mogens Nielsen, Catuscia Palamidessi, Frank D. Val...
FMSD
2010
118views more  FMSD 2010»
14 years 10 months ago
On simulation-based probabilistic model checking of mixed-analog circuits
In this paper, we consider verifying properties of mixed-signal circuits, i.e., circuits for which there is an interaction between analog (continuous) and digital (discrete) values...
Edmund M. Clarke, Alexandre Donzé, Axel Leg...
ICST
2009
IEEE
14 years 9 months ago
Timed Testing under Partial Observability
This paper studies the problem of model-based testing of real-time systems that are only partially observable. We model the System Under Test (SUT) using Timed Game Automata (TGA)...
Alexandre David, Kim Guldstrand Larsen, Shuhao Li,...
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 12 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari