Sciweavers

1895 search results - page 159 / 379
» Using ATL for Checking Models
Sort
View
TSE
2011
134views more  TSE 2011»
15 years 1 months ago
Verifying the Evolution of Probability Distributions Governed by a DTMC
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
YoungMin Kwon, Gul A. Agha
GI
2001
Springer
15 years 11 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
Dominique Cansell, Dominique Méry, Stephan ...
IJSI
2008
126views more  IJSI 2008»
15 years 6 months ago
Modelling Route Instructions for Robust Human-Robot Interaction on Navigation Tasks
In this paper, we demonstrate the use of qualitative spatial modelling as the foundation for the conceptual representation of route instructions, to enable robust humanrobot intera...
Hui Shi, Bernd Krieg-Brückner
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
16 years 4 days ago
Utilizing don't care states in SAT-based bounded sequential problems
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
Sean Safarpour, Görschwin Fey, Andreas G. Ven...
OOPSLA
2005
Springer
16 years 19 hour ago
Fine-grained interoperability through mirrors and contracts
As a value flows across the boundary between interoperating languages, it must be checked and converted to fit the types and representations of the target language. For simple f...
Kathryn E. Gray, Robert Bruce Findler, Matthew Fla...