Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Universal concurrent constraint programing: symbolic semantics and applications to security
The utcc calculus allows for the specification of mobile behaviours in the sense of Milner's π-calculus: Generation and communication of private channels or links and it is shown that utcc has a strong connection with Pnueli's Temporal Logic.
A Declarative Language for Dynamic Multimedia Interaction Systems
A model for dynamic interactive scores where interactive points can be defined to adapt the hierarchical structure of the score depending on the information inferred from the environment and a music improvisation system based on the factor oracle that scales up to situations involving several players, learners and improvisers are proposed.
The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security
It is shown that in contrast to tcc, utcc is Turingpowerful by encoding Minsky machines, and shows that mobility can be captured as closure operators over an underlying constraint system.
Declarative Diagnosis of Temporal Concurrent Constraint Programs
This work presents a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints and shows that, given the intended specification of D, it is possible to check the correctness of D by a single step of TD.
A General Proof System for Modalities in Concurrent Constraint Programming
It is shown how a proper structure of the subexponential signature in SELL$^\Cap$ allows for the specification of concurrent systems with timed, spatial, and epistemic modalities, thus providing a proof-theoretic foundations for those calculi.
Foundations for Reliable and Flexible Interactive Multimedia Scores
This paper introduces ReactiveIS, a programming language that fully captures the temporal structure of IS during both composition and execution and proposes a semantics based on tree-like structures representing the execution state of the score at each point in time.
Subexponential concurrent constraint programming
Towards a Unified Framework for Declarative Structured Communications
A unified framework for the declarative analysis of structured communications by relying on a (timed) concurrent constraint programming language and a tight correspondence with logic, which formally relates session execution and linear-time temporal logic formulas is presented.
A framework for abstract interpretation of timed concurrent constraint programs
This paper considers the denotational semantics for tcc, and extends it to a "collecting" semantics for utcc based on closure operators over sequences of constraints, and formalizes the first general framework for data flow analyses of tcc and utcc programs by abstract interpretation techniques.