Sciweavers

1914 search results - page 110 / 383
» Verification by Abstract Interpretation
Sort
View
84
Voted
COOPIS
2004
IEEE
15 years 4 months ago
Checking Asynchronously Communicating Components Using Symbolic Transition Systems
Abstract. Explicit behavioural interface description languages (BIDLs, protocols) are now recognized as a mandatory feature of component languages in order to address component reu...
Olivier Maréchal, Pascal Poizat, Jean-Claud...
95
Voted
ACSD
2001
IEEE
74views Hardware» more  ACSD 2001»
15 years 4 months ago
From Code to Models
One of the corner stones of formal methods is the notion traction enables analysis. By the construction of act model we can trade implementation detail for analytical power. The i...
Gerard J. Holzmann
FMCAD
2008
Springer
15 years 2 months ago
Verifying an Arbiter Circuit
Abstract--This paper presents the verification of an asynchronous arbiter modeled at the circuit level with non-linear ordinary differential equations. We use Brockett's annul...
Chao Yan, Mark R. Greenstreet
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 23 days ago
Specifying Reusable Components
Reusable software components need well-defined interfaces, rigorously and completely documented features, and a design amenable both to reuse and to formal verification; all these...
Nadia Polikarpova, Carlo A. Furia, Bertrand Meyer
SEFM
2007
IEEE
15 years 7 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook