Sciweavers

314 search results - page 56 / 63
» Sanity Checks in Formal Verification
Sort
View
OOPSLA
2010
Springer
14 years 7 months ago
Composable specifications for structured shared-memory communication
In this paper we propose a communication-centric approach to specifying and checking how multithreaded programs use shared memory to perform inter-thread communication. Our approa...
Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan G...
POPL
2007
ACM
15 years 10 months ago
Variance analyses from invariance analyses
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
Josh Berdine, Aziem Chawdhary, Byron Cook, Dino Di...
ECAI
2008
Springer
14 years 11 months ago
Temporal Logic Patterns for Querying Qualitative Models of Genetic Regulatory Networks
Formal verification based on model checking provides a powerful technology to query qualitative models of dynamical systems. The application of model-checking approaches is hamper...
Pedro T. Monteiro, Delphine Ropers, Radu Mateescu,...
72
Voted
CORR
2010
Springer
98views Education» more  CORR 2010»
14 years 9 months ago
Extended Computation Tree Logic
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
Roland Axelsson, Matthew Hague, Stephan Kreutzer, ...
JUCS
2006
124views more  JUCS 2006»
14 years 9 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Wan Fokkink, Jun Pang