Sciweavers

499 search results - page 56 / 100
» LTL satisfiability checking
Sort
View
JSC
2010
100views more  JSC 2010»
14 years 6 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
SIGSOFT
2005
ACM
16 years 17 days ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
SIGSOFT
2005
ACM
16 years 17 days ago
Fluent temporal logic for discrete-time event-based models
Fluent model checking is an automated technique for verifying that an event-based operational model satisfies some state-based declarative properties. The link between the event-b...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
TACAS
2004
Springer
139views Algorithms» more  TACAS 2004»
15 years 5 months ago
Error Explanation with Distance Metrics
Abstract In the event that a system does not satisfy a specification, a model checker will typically automatically produce a counterexample trace that shows a particular instance ...
Alex Groce
CONCUR
2008
Springer
15 years 1 months ago
Distributed Timed Automata with Independently Evolving Clocks
Abstract. We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of th...
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan ...