Sciweavers

FAC
2008
123views more  FAC 2008»
13 years 4 months ago
Interface synthesis and protocol conversion
Given deterministic interfaces P and Q, we investigate the problem of synthesising an interface R such that P composed with R refines Q. We show that a solution exists iff P and Q ...
Purandar Bhaduri, S. Ramesh
FAC
2008
100views more  FAC 2008»
13 years 4 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
FAC
2008
139views more  FAC 2008»
13 years 4 months ago
Network invariants for real-time systems
We extend the approach of model checking parameterized networks of processes by means of network invariants to the setting of real-time systems. We introduce timed transition stru...
Olga Grinchtein, Martin Leucker
FAC
2008
64views more  FAC 2008»
13 years 4 months ago
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of th...
Robert M. Hierons, Florentin Ipate
FAC
2008
117views more  FAC 2008»
13 years 4 months ago
Model checking Duration Calculus: a practical approach
Abstract. Model checking of real-time systems against Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. The existing algo...
Roland Meyer, Johannes Faber, Jochen Hoenicke, And...
FAC
2008
100views more  FAC 2008»
13 years 4 months ago
Bisimulations in calculi modelling membranes
Abstract. Bisimulations are well
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...
FAC
2008
108views more  FAC 2008»
13 years 4 months ago
Property-directed incremental invariant generation
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...
Aaron R. Bradley, Zohar Manna
FAC
2008
92views more  FAC 2008»
13 years 4 months ago
Capture-avoiding substitution as a nominal algebra
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
Murdoch James Gabbay, Aad Mathijssen
FAC
2008
88views more  FAC 2008»
13 years 4 months ago
The certification of the Mondex electronic purse to ITSEC Level E6
Ten years ago the Mondex electronic purse was certified to ITSEC Level E6, the highest level of assuranceforsecuresystems.ThisinvolvedbuildingformalmodelsintheZnotation,linkingthem...
Jim Woodcock, Susan Stepney, David Cooper, John A....
FAC
2008
114views more  FAC 2008»
13 years 4 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe