 |
|
|
|
| Papers |
|
Papers (co-)authored by Frank Valencia
| [1] |
Andrés Aristizabal, Filippo Bonchi, Luis Pino, and Frank D. Valencia.
Reducing Weak to Strong Bisimilarity in CCP.
In Fifth Interaction and Concurrency Experience, pages 2-16,
Stockholm, Sweden, December 2012.
EPTCS. [ bib | http ] |
| [2] |
Sophia Knight, Catuscia Palamidessi, Prakash Panangaden, and Frank D. Valencia.
Spatial and Epistemic Modalities in Constraint-Based Process
Calculi.
In Proceedings of CONCUR 2012 - Concurrency Theory - 23rd
International Conference, CONCUR 2012, volume 7454, pages 317-332,
Newcastle upon Tyne, United Kingdom, September 2012. [ bib | http ] |
| [3] |
Marco Giunti, Catuscia Palamidessi, and Frank D. Valencia.
Hide and New in the Pi-Calculus.
In Combined 19th International Workshop on Expressiveness in
Concurrency and 9th Workshop on Structured Operational Semantics (EXPRESS/SOS
2012), pages 65-80, New Castle upon Tyne, United Kingdom, August 2012. [ bib | http ] |
| [4] |
Andrés Barco, Sophia Knight, and Frank D. Valencia.
K-Stores: A Spatial and Epistemic Concurrent Constraint
Interpreter.
In 21st Workshop on Functional and (Constraint) Logic
Programming (WFLP2012), Nagoya, Japan, May 2012. [ bib | http ] |
| [5] |
Andrés Aristizabal, Filippo Bonchi, Luis Pino, and Frank D. Valencia.
Partition Refinement for Bisimilarity in CCP.
In 27th ACM Symposium On Applied Computing, Trento, Italy,
2012. [ bib | http ] |
| [6] |
Andrés Aristizabal, Filippo Bonchi, Luis Pino, and Frank D. Valencia.
Partition Refinement for Bisimilarity in CCP.
In Proceedings of the 27th ACM Symposium On Applied Computing to
be held in Riva del Garda (Trento), Italy. March 26-30, 2012. ACM, 2012. [ bib | http ] |
| [7] |
Diana Hermith, Carlos Olarte, Camilo Rueda, and Frank D. Valencia.
Modeling Cellular Signaling Systems: An Abstraction-Refinement
Approach.
In Miguel P. Rocha, Juan M. Corchado Rodriguez, Florentino
Fdez-Riverola, and Alfonso Valencia, editors, PACBB, volume 93 of
Advances in Intelligent and Soft Computing, pages 321-328, Salamanca,
Spain, 2011. Springer. [ bib | http ] |
| [8] |
Andrés Aristizabal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, and
Frank D. Valencia.
Deriving Labels and Bisimilarity for Concurrent Constraint
Programming.
In Martin Hofmann, editor, Proceedings of the 14th
International Conference on Foundations of Software Science an Computation
Structures (FOSSACS 2011). , volume 6604 of Lecture Notes in Computer
Science, pages 138-152, Saarbrücken, Germany, 2011. Springer. [ bib | http ] |
| [9] |
Bas Luttik and Frank D. Valencia, editors.
Proceedings of the Eighth International Conference on
Quantitative Evaluation of SysTems, volume 64 of Electronic
Proceedings in Theoretical Computer Science. Electronic Proceedings in
Theoretical Computer Science, 2011. [ bib | www: ] |
| [10] |
Maurizio Gabbrielli, Catuscia Palamidessi, and Frank D. Valencia.
Concurrent and reactive constraint programming.
In Agostino Dovier and Enrico Pontelli, editors, A 25-Year
Perspective on Logic Programming, pages 231-253. Springer, June 2010. [ bib | http ] |
| [11] |
Jesus Aranda, Gérard Assayag, Carlos Olarte, Jorge A. Pérez, Camilo
Rueda, Mauricio Toro, and Frank D. Valencia.
An Overview of FORCES: An INRIA project on
declarative formalisms for emergent systems.
In Patricia M. Hill and David Scott Warren, editors, Proceeding
of the 25th International Conference, ICLP'09, volume 5649 of Lectures
Notes in Computer Science, pages 509-513. Springer, 2009. [ bib | http ] |
| [12] |
Carlos Olarte, Camilo Rueda, and Frank D. Valencia.
Concurrent Constraint Programming: a declarative paradigm for
modeling music systems.
In Gérard Assayag and Andrew Gerzso, editors, New
Computational Paradigms for Computer Music, pages 400-402, Paris, France,
2009. Delatour France / Ircam-Centre Pompidou. [ bib | http ] |
| [13] |
Jesus Aranda, Frank D. Valencia, and Cristian Versari.
On the Expressive Power of Restriction and Priorities in
CCS with replication.
In Luca de Alfaro, editor, Proceedings of the 12th
International Conference on Foundations of Software Science and
Computational Structures, FOSSACS'09, volume 5504 of Lectures
Notes in Computer Science, pages 242-256. Springer, 2009. [ bib | http ] |
| [14] |
Romain Beauxis, Catuscia Palamidessi, and Frank D. Valencia.
On the asynchronous nature of the asynchronous pi-calculus.
In Pierpaolo Degano, Rocco De Nicola, and José Meseguer, editors,
Concurrency, Graphs and Models, volume 5065 of Lecture Notes in
Computer Science, pages 473-492. Springer, 2008. [ bib | http | .pdf ] |
| [15] |
Jesús Aranda, Jorge A. Pérez, Camilo Rueda, and Frank D. Valencia.
Stochastic behavior and explicit discrete time in concurrent
constraint programming.
In Maria Garcia de la Banda and Enrico Pontelli, editors, 24th
International Conference on Logic Programming, volume 5366 of Lecture
Notes in Computer Science, pages 682-686. Springer, 2008. [ bib ] |
| [16] |
Carlos Olarte and Frank D. Valencia.
The expressivity of universal timed ccp: undecidability of monadic
fltl and closure operators for security.
In Sergio Antoy and Elvira Albert, editors, Proceedings of the
10th International ACM SIGPLAN Conference on Principles and Practice of
Declarative Programming, pages 8-19, 2008. [ bib | http ] |
| [17] |
Carlos Olarte and Frank D. Valencia.
Universal concurrent constraint programing: Symbolic semantics and
applications to security.
In Proceedings of the 23rd ACM Symposium on Applied Computing
(SAC), pages 145-150. ACM, 2008.
http://www.lix.polytechnique.fr/~colarte/colarte/Publications_files/sac08.pdf. [ bib | http | .pdf ] |
| [18] |
Diletta Cacciagrano, Flavio Corradini, Jesús Aranda, and Frank D. Valencia.
Linearity, persistence and testing semantics in the asynchronous
pi-calculus.
In Roberto Amadio and Thomas Hildenbrandt, editors, Proc. of
14th International Workshop on Expressiveness of Concurrency,
(EXPRESS'07), volume 194 of ENTCS, pages 59-84. Elsevier, 2008.
http://www.brics.dk/~fvalenci/papers/pers-test.pdf. [ bib ] |
| [19] |
Jesus Aranda, Cinzia Di Giusto, Catuscia Palamidessi, and Frank Valencia.
Expressiveness of recursion, replication and scope mechanisms in
process calculi.
In Frank S. de Boer and Marcello M. Bonsangue, editors,
Postproceedings of the 5th International Symposium on Formal Methods for
Components and Objects (FMCO'06), volume 4709 of Lecture Notes in
Computer Science, pages 185-206. Springer, 2007.
http://www.lix.polytechnique.fr/~fvalenci/papers/fmco07.pdf. [ bib ] |
| [20] |
J. Aranda, C. Di Giusto, M. Nielsen, and F. Valencia.
CCS with replication in the Chomsky hierarchy: The expressive
power of divergence.
In Proc. of The Fifth ASIAN Symposium on Programming Languages
(APLAS'07), number 4807 in LNCS, pages 383-398. Springer, 2007.
http://www.brics.dk/~fvalenci/papers/aplas.pdf. [ bib ] |
| [21] |
Julian Gutierrez, Jorge Perez, Camilo Rueda, and Frank D. Valencia.
Timed concurrent constraint programming for analyzing biological
systems.
In Proceedings of Workshop on Membrane Computing and
Biologically Inspired Process Calculi., volume 171 (2) of Electronic
Notes in Theoretical Computer Science, pages 117-137. Elsevier Science
B.V., 2007.
http://www.brics.dk/~fvalenci/papers/bioccp.pdf. [ bib ] |
| [22] |
Carlos Olarte, Catuscia Palamidessi, and Frank D. Valencia.
Universal timed concurrent constraint programming.
In Verónica Dahl and Ilkka Niemelä, editors, Proceedings
of the 23rd International Conference in Logic Programming (ICLP'07), volume
4670 of Lecture Notes in Computer Science, pages 464-465. Springer,
2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Carlos/iclp07DC.pdf. [ bib ] |
| [23] |
Moreno Falaschi, Carlos Olarte, Catuscia Palamidessi, and Frank D. Valencia.
Declarative diagnosis of temporal concurrent constraint programs.
In Verónica Dahl and Ilkka Niemelä, editors, Proceedings
of The 23rd International Conference in Logic Programming (ICLP'07), volume
4670 of Lecture Notes in Computer Science, pages 271-285. Springer,
2007.
http://www.lix.polytechnique.fr/~catuscia/papers/Carlos/iclp07.pdf. [ bib ] |
| [24] |
C. Palamidessi and F. Valencia.
Languages for concurrency.
Bulletin of the European Association for Theoretical Computer
Science, 90:155-171, October 2006.
Column: Programming Languages.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/EATCS_06/paper.pdf. [ bib ] |
| [25] |
Hugo A. López, Catuscia Palamidessi, Jorge, Camilo Rueda, and Frank D.
Valencia.
A declarative framework for security: Secure concurrent constraint
programming.
In Sandro Etalle and Miroslaw Truszczynski, editors, Proceedings
of the 22nd International Conference on logic Programming, (ICLP), volume
4079 of Lecture Notes in Computer Science, pages 449-450. Springer,
2006. [ bib ] |
| [26] |
Catuscia Palamidessi, Vijay A. Saraswat, Frank D. Valencia, and Björn
Victor.
On the expressiveness of linearity vs persistence in the asynchronous
pi-calculus.
In Proceedings of the Twenty First Annual IEEE Symposium on
Logic in Computer Science (LICS), pages 59-68. IEEE Computer Society, 2006.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/LICS_06/main.pdf. [ bib | http ] |
| [27] |
Catuscia Palamidessi and Frank D. Valencia.
Recursion vs replication in process calculi: Expressiveness.
Bulletin of the EATCS, 87:105-125, 2005.
Column: Concurrency.
http://www.lix.polytechnique.fr/~catuscia/papers/Frank/EATCS_05/recrep.pdf. [ bib ] |
| [28] |
Frank D. Valencia.
Decidability of infinite-state timed CCP processes and first-order
LTL.
Theoretical Computer Science, 330(3):577-607, 2005. [ bib ] |
| [29] |
Stefan S. Dantchev and Frank D. Valencia.
On the computational limits of infinite satisfaction.
In Proceedings of the 20th ACM Symposium on Applied Computing,
pages 393-397. ACM Press, 2005. [ bib | .pdf ] |
| [30] |
C. Rueda and F. Valencia.
Non-viability deductions in arc-consistency computation.
In Bart Demoen and Vladimir Lifschitz, editors, Proc. of the
Nineteenth International Conference on Logic Programming (ICLP 2004), volume
3132 of Lecture Notes in Computer Science, pages 343-355. Springer,
2004. [ bib ] |
| [31] |
Camilo Rueda and Frank D. Valencia.
On validity in modelization of musical problems by CCP.
Soft Computing, 8(9):641-648, 2004. [ bib ] |
| [32] |
Pablo Giambiagi, Gerardo Schneider, and Frank D. Valencia.
On the expressiveness of infinite behavior and name scoping in
process calculi.
In Igor Walukiewicz, editor, Proceedings of the 7th
International Conference on the Foundations of Software Science and
Computation Structures (FOSSACS 2004), volume 2987 of Lecture Notes in
Computer Science, pages 226-240. Springer, 2004. [ bib | .pdf ] |
| [33] |
Mogens Nielsen, Catuscia Palamidessi, and Frank D. Valencia.
On the expressive power of temporal concurrent constraint programming
languages.
In Proceedings of the Fourth ACM SIGPLAN Conference on
Principles and Practice of Declarative Programming, pages 156-167, New
York, October6-8 2002. ACM Press.
http://www.lix.polytechnique.fr/~catuscia/papers/ppdp02.ps. [ bib ] |
| [34] |
M. Nielsen, C. Palamidessi, and F. Valencia.
Temporal concurrent constraint programming: Denotation, logic and
applications.
Nordic Journal of Computing, 9:145-188, 2002.
http://www.lix.polytechnique.fr/ catuscia/papers/Ntcc/njc02.ps. [ bib ] |
| [35] |
Catuscia Palamidessi and Frank D. Valencia.
A temporal concurrent constraint programming calculus.
In Toby Walsh, editor, Proc. of the 7th International Conference
on Principles and Practice of Constraint Programming, volume 2239 of
Lecture Notes in Computer Science, pages 302-316. Springer, 2001.
http://www.lix.polytechnique.fr/~catuscia/papers/Ntcc/final.ps. [ bib ] |
| [36] |
Mogens Nielsen and Frank D. Valencia.
Temporal concurrent constraint programming: Applications and
behavior.
Lecture Notes in Computer Science, 2300:298-324, 2001. [ bib ] |
This file has been generated by bibtex2html 1.74
Back
Page maintainer: Catuscia Palamidessi