107 search results - page 9 / 22 » Using Abstraction in Modular Verification of Synchronous Ada... |
FM
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
VSTTE
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Theorem-prover based modular checkers have the potential to perform scalable and precise checking of user-defined properties by combining pathsensitive intraprocedural re...
CCECE
2006
IEEE
14 years 3 months ago
2006
IEEE
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first...
ESWS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This demo proposal aims at providing support for the localization of ontologies, and as a result at obtaining multilingual ontologies. We briefly present an advanced ver...