Sciweavers

JAR
2008
81views more  JAR 2008»
14 years 13 days ago
Automatic Symmetry Detection for Promela
We introduce a specification language, Promela-Lite, which captures the essential features of Promela but which, unlike Promela, has a formally defined semantics. We show how we ca...
Alastair F. Donaldson, Alice Miller
JAR
2008
115views more  JAR 2008»
14 years 13 days ago
Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks
The spreading of multicast technology enables the development of group communication and so dealing with digital streams becomes more and more common over the Internet. Given the f...
Roberto Gorrieri, Fabio Martinelli, Marinella Petr...
JAR
2008
88views more  JAR 2008»
14 years 13 days ago
Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables
Statistical quantities, such as expectation (mean) and variance, play a vital role in the present age probabilistic analysis. In this paper, we present some formalization of expect...
Osman Hasan, Sofiène Tahar
JAR
2008
70views more  JAR 2008»
14 years 13 days ago
Assumption-Commitment Support for CSP Model Checking
We present a simple formulation of Assumption-Commitment reasoning using CSP. In our formulation, an assumption-commitment style property of a process SYS takes the form COM SYS A...
Nick Moffat, Michael Goldsmith
JAR
2008
89views more  JAR 2008»
14 years 13 days ago
An Extensible Encoding of Object-oriented Data Models in hol
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
Achim D. Brucker, Burkhart Wolff
JAR
2008
107views more  JAR 2008»
14 years 13 days ago
Differential Dynamic Logic for Hybrid Systems
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equat...
André Platzer
JAR
2008
77views more  JAR 2008»
14 years 13 days ago
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
JAR
2008
124views more  JAR 2008»
14 years 13 days ago
Formal Verification of a C-like Memory Model and Its Uses for Verifying Program Transformations
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...
Xavier Leroy, Sandrine Blazy
JAR
2008
105views more  JAR 2008»
14 years 13 days ago
Proof Synthesis and Reflection for Linear Arithmetic
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
Amine Chaieb, Tobias Nipkow
JAR
2008
98views more  JAR 2008»
14 years 13 days ago
A Mechanical Analysis of Program Verification Strategies
We analyze three proof strategies commonly used in deductive verification of deterministic sequential programs formalized with operational semantics. The strategies are: (i) stepw...
Sandip Ray, Warren A. Hunt Jr., John Matthews, J. ...