Sciweavers

45 search results - page 6 / 9
» fac 2006
Sort
View
FAC
1998
111views more  FAC 1998»
13 years 9 months ago
A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes
In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
Henri Korver, M. P. A. Sellink
FAC
2010
259views more  FAC 2010»
13 years 8 months ago
An algebraic approach to the design of compilers for object-oriented languages
Here we describe an algebraic approach to constructing a provably correct compiler for an object-oriented language called ROOL. We tackle the problem of compiler correctness by red...
Adolfo Duran, Ana Cavalcanti, Augusto Sampaio
FAC
2010
105views more  FAC 2010»
13 years 8 months ago
A formalization of geometric constraint systems and their decomposition
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on...
Pascal Mathis, Simon E. B. Thierry
FAC
2010
148views more  FAC 2010»
13 years 8 months ago
Automating the transformation-based analysis of visual languages
We present a novel approach for the automatic generation of model-to-model transformations given a description of the operational semantics of the source language in the form of gr...
Juan de Lara, Hans Vangheluwe
FAC
2007
94views more  FAC 2007»
13 years 9 months ago
Parametric probabilistic transition systems for system design and analysis
Abstract. We develop a model of Parametric Probabilistic Transition Systems, where probabilities associated with transitions may be parameters. We show how to find instances of th...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...