Sciweavers

1914 search results - page 111 / 383
» Verification by Abstract Interpretation
Sort
View
CADE
2006
Springer
16 years 5 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
CCECE
2006
IEEE
15 years 11 months ago
A Formal CSP Framework for Message-Passing HPC Programming
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
John D. Carter, William B. Gardner
ASE
2008
102views more  ASE 2008»
15 years 5 months ago
Model driven code checking
Model checkers were originally developed to support the formal verification of high-level design models of distributed system designs. Over the years, they have become unmatched in...
Gerard J. Holzmann, Rajeev Joshi, Alex Groce
TPLP
2002
69views more  TPLP 2002»
15 years 4 months ago
Soundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
144
Voted
ACSD
2004
IEEE
95views Hardware» more  ACSD 2004»
15 years 8 months ago
Guided Model Checking with a Bayesian Meta-heuristic
Abstract. This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by a...
Kevin D. Seppi, Michael Jones, Peter Lamborn