Sciweavers

5 search results - page 1 / 1
» Embedding Imperative Synchronous Languages in Interactive Th...
Sort
View
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
13 years 8 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider
ICFEM
2003
Springer
13 years 9 months ago
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
Mickaël Kerboeuf, David Nowak, Jean-Pierre Ta...
TPHOL
2009
IEEE
13 years 11 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
ENTCS
2007
137views more  ENTCS 2007»
13 years 4 months ago
Formal Sequentialization of Distributed Systems via Program Rewriting
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...
CLIMA
2004
13 years 6 months ago
Metareasoning for Multi-agent Epistemic Logics
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
Konstantine Arkoudas, Selmer Bringsjord