Seuraa
Camilo Rocha
Camilo Rocha
Professor, Pontificia Universidad Javeriana Cali, ORCID: 0000-0003-4356-7704
Vahvistettu sähköpostiosoite verkkotunnuksessa javerianacali.edu.co - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Double-spend attack models with time advantange for bitcoin
C Pinzón, C Rocha
Electronic Notes in Theoretical Computer Science 329, 79-103, 2016
1372016
Rewriting modulo SMT and open system analysis
C Rocha, J Meseguer, C Muñoz
Journal of Logical and Algebraic Methods in Programming 86 (1), 269-297, 2017
732017
Proving safety properties of rewrite theories
C Rocha, J Meseguer
International Conference on Algebra and Coalgebra in Computer Science, 314-328, 2011
432011
Rewriting modulo SMT and open system analysis
C Rocha, J Meseguer, C Muñoz
Rewriting Logic and Its Applications: 10th International Workshop, WRLA 2014 …, 2014
352014
Towards a Maude formal environment
F Durán, C Rocha, JM Álvarez
Formal Modeling: Actors, Open Systems, Biological Systems: Essays Dedicated …, 2011
332011
Stochastic analysis of BPMN with time in rewriting logic
F Durán, C Rocha, G Salaün
Science of Computer Programming 168, 1-17, 2018
302018
Symbolic reachability analysis for rewrite theories
C Rocha
University of Illinois at Urbana-Champaign, 2013
262013
Rewriting logic semantics of a plan execution language
G Dowek, C Munoz, C Rocha
arXiv preprint arXiv:1002.2872, 2010
262010
Theorem proving modulo based on boolean equational procedures
C Rocha, J Meseguer
International Conference on Relational Methods in Computer Science, 337-351, 2008
262008
A rewriting logic approach to resource allocation analysis in business process models
F Durán, C Rocha, G Salaün
Science of Computer Programming 183, 102303, 2019
162019
Symbolic state space reduction with guarded terms for rewriting modulo SMT
K Bae, C Rocha
Science of Computer Programming 178, 20-42, 2019
162019
A formal interactive verification environment for the plan execution interchange language
C Rocha, H Cadavid, C Munoz, R Siminiceanu
Integrated Formal Methods: 9th International Conference, IFM 2012, Pisa …, 2012
162012
Constructors, sufficient completeness, and deadlock freedom of rewrite theories
C Rocha, J Meseguer
International Conference on Logic for Programming Artificial Intelligence …, 2010
152010
Tool interoperability in the Maude formal environment
F Durán, C Rocha, JM Álvarez
International Conference on Algebra and Coalgebra in Computer Science, 400-406, 2011
142011
A top-down supervised learning approach to hierarchical multi-label classification in networks
M Romero, J Finke, C Rocha
Applied Network Science 7 (1), 8, 2022
132022
Guarded terms for rewriting modulo SMT
K Bae, C Rocha
Formal Aspects of Component Software: 14th International Conference, FACS …, 2017
132017
Order-sorted equality enrichments modulo axioms
R Gutiérrez, J Meseguer, C Rocha
Science of Computer Programming 99, 235-261, 2015
132015
Order-sorted equality enrichments modulo axioms
R Gutiérrez, J Meseguer, C Rocha
International Workshop on Rewriting Logic and its Applications, 162-181, 2012
132012
A rewriting decision procedure for Dijkstra-Scholten's syllogistic logic with complements
C Rocha, J Meseguer
132007
Ground confluence of order-sorted conditional specifications modulo axioms
F Durán, J Meseguer, C Rocha
Journal of Logical and Algebraic Methods in Programming 111, 100513, 2020
122020
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20