Sciweavers

2584 search results - page 203 / 517
» On the Forward Checking Algorithm
Sort
View
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
15 years 6 months ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...
APLAS
2007
ACM
15 years 6 months ago
Type-Based Verification of Correspondence Assertions for Communication Protocols
Gordon and Jeffrey developed a type system for checking correspondence assertions. The correspondence assertions, proposed by Woo and Lam, state that when a certain event (called a...
Daisuke Kikuchi, Naoki Kobayashi
ASIAN
2006
Springer
153views Algorithms» more  ASIAN 2006»
15 years 6 months ago
Automata-Based Confidentiality Monitoring
Abstract Non-interference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checkin...
Gurvan Le Guernic, Anindya Banerjee, Thomas P. Jen...
TASE
2008
IEEE
15 years 2 months ago
Perspectives in Probabilistic Verification
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
Joost-Pieter Katoen
ARSCOM
2002
53views more  ARSCOM 2002»
15 years 2 months ago
Embedding Graphs Containing K5-Subdivisions
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
Andrei V. Gagarin, William Kocay