Deriving labels and bisimilarity for concurrent constraint programming A Aristizábal, F Bonchi, C Palamidessi, L Pino, F Valencia Foundations of Software Science and Computational Structures: 14th …, 2011 | 36 | 2011 |
Partition refinement for bisimilarity in ccp A Aristizabal, F Bonchi, FD Valencia, LF Pino Proceedings of the 27th Annual ACM Symposium on Applied Computing, 88-93, 2012 | 14 | 2012 |
Observational and behavioural equivalences for soft concurrent constraint programming F Gadducci, F Santini, LF Pino, FD Valencia Journal of Logical and Algebraic Methods in Programming 92, 45-63, 2017 | 10 | 2017 |
A labelled semantics for soft concurrent constraint programming F Gadducci, F Santini, LF Pino, FD Valencia International Conference on Coordination Languages and Models, 133-149, 2015 | 10 | 2015 |
Reducing weak to strong bisimilarity in ccp A Aristizábal, F Bonchi, L Pino, F Valencia arXiv preprint arXiv:1212.3874, 2012 | 7 | 2012 |
A behavioral congruence for concurrent constraint programming with nondeterministic choice LF Pino, F Bonchi, FD Valencia International Colloquium on Theoretical Aspects of Computing, 351-368, 2014 | 5 | 2014 |
Efficient computation of program equivalence for confluent concurrent constraint programming LF Pino, F Bonchi, FD Valencia Proceedings of the 15th Symposium on Principles and Practice of Declarative …, 2013 | 4 | 2013 |
Weak CCP bisimilarity with strong procedures LF Pino, A Aristizabal, F Bonchi, F Valencia Science of Computer Programming 100, 84-104, 2015 | 2 | 2015 |
Efficient algorithms for program equivalence for confluent concurrent constraint programming LF Pino, F Bonchi, F Valencia Science of Computer Programming 111, 135-155, 2015 | 1 | 2015 |
Efficient Verification and New Reasoning Techniques for Concurrent Constraint Programming LFP Duque Ecole Polytechnique, 2014 | | 2014 |
Analysis of the reachability problem in fragments of the Pi-calculus L Pino | | 2010 |