works on

From the 1 of 5.5k papers with an AI index.

output
19932026
Showing 2012 · cs.LOShow all

25 papers · 2 filters

cs.LO2012

Rewrite Closure and CF Hedge Automata

Florent Jacquemard, Michael Rusinowitch

We introduce an extension of hedge automata called bidimensional context-free hedge automata. The class of unranked ordered tree languages they recognize is shown to be preserved b…

cs.LO2012

Proceedings Quantities in Formal Methods

Uli Fahrenberg, Axel Legay, Claus Thrane

This volume contains the proceedings of the Workshop on Quantities in Formal Methods, QFM 2012, held in Paris, France on 28 August 2012. The workshop was affiliated with the 18th S…

cs.LO2012★ 7 cited

Partition Refinement for Bisimilarity in CCP

Andrés Aristizábal, Filippo Bonchi, Luis Pino +1

Saraswat's concurrent constraint programming (ccp) is a mature formalism for modeling processes (or programs) that interact by telling and asking constraints in a global medium, ca…

cs.LO2012★ 3 cited

Refinement and Difference for Probabilistic Automata

Benoît Delahaye, Uli Fahrenberg, Kim G. Larsen +1

This paper studies a difference operator for stochastic systems whose specifications are represented by Abstract Probabilistic Automata (APAs). In the case refinement fails between…

cs.LO2012

The Refined Calculus of Inductive Construction: Parametricity and Abstraction

Chantal Keller, Marc Lasson

We present a refinement of the Calculus of Inductive Constructions in which one can easily define a notion of relational parametricity. It provides a new way to automate proofs in…

cs.LO2012★ 31 cited

Adaptable processes

Mario Bravetti, Cinzia Di Giusto, Jorge A Perez +1

We propose the concept of adaptable processes as a way of overcoming the limitations that process calculi have for describing patterns of dynamic process evolution. Such patterns r…