Publications

Export 74 results:
Author [ Title(Desc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
I
D. Barsotti, Implementación eficiente de construcciones de alto nivel para la programación concurrente, Universidad Nacional de Córdoba, Córdoba, 2011.PDF icon paper-173.pdf (1.38 MB)
P. R. D'Argenio, Lee, M. D., and Monti, R. E., Input/Output Stochastic Automata - Compositionality and Determinism, in Formal Modeling and Analysis of Timed Systems - 14th International Conference, FORMATS 2016, Quebec, QC, Canada, August 24-26, 2016, Proceedings, vol. 9884, M. Fränzle and Markey, N. Springer, 2016, pp. 53–68.PDF icon paper-654.pdf (1.49 MB)
J
C. E. Budde, Dehnert, C., Hahn, E. Moritz, Hartmanns, A., Junges, S., and Turrini, A., JANI: Quantitative Model and Tool Interaction, in Tools and Algorithms for the Construction and Analysis of Systems: 23rd International Conference, TACAS 2017, Berlin, Heidelberg: Springer Berlin Heidelberg, 2017, pp. 151–168.PDF icon paper-726.pdf (223.9 KB)
M
M. Fränzle, Hahn, E. M., Hermanns, H., Wolovick, N., and Zhang, L., Measurability and safety verification for stochastic hybrid systems, in Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2011, 2011, pp. 43-52.
H. C. Bohnenkamp, D'Argenio, P. R., Hermanns, H., and Katoen, J. - P., MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems, IEEE Trans. Software Eng., vol. 32, no. 10, pp. 812-830, 2006.PDF icon paper-22.pdf (1.78 MB)
O
N. Wolovick, D'Argenio, P. R., and Qu, H., Optimizing Probabilities of Real-Time Test Case Execution, in ICST 2009, Second International Conference on Software Testing Verification and Validation, 2009, pp. 446-455.
P
C. Baier, D'Argenio, P. R., and Größer, M., Partial Order Reduction for Probabilistic Branching Time, Electr. Notes Theor. Comput. Sci., vol. 153, no. 2, pp. 97-116, 2006.PDF icon paper-21.pdf (432.14 KB)
S. Giro, D'Argenio, P. R., and Ferrer Fioriti, L. M., Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers, in CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009, vol. LNCS 5710, pp. 338-353.PDF icon paper-14.pdf (469.3 KB)
P. R. D'Argenio and Niebert, P., Partial Order Reduction on Concurrent Probabilistic Programs, in 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004, pp. 240-249.PDF icon paper-28.pdf (884.87 KB)
F. S. de Boer, Bravetti, M., Grabe, I., Lee, M. D., Steffen, M., and Zavattaro, G., A Petri Net Based Analysis of Deadlocks for Active Objects and Futures, in Formal Aspects of Component Software, 9th International Symposium, FACS 2012, Mountain View, CA, USA, September 12-14, 2012. Revised Selected Papers, 2013, vol. 7684, pp. 110-127.
P. R. D'Argenio and Lee, M. D., Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation, in Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, 2012, vol. 7213, pp. 452-466.PDF icon paper-123.pdf (269.47 KB)
S. Andova, McIver, A., D'Argenio, P. R., Cuijpers, P. J. L., Markovski, J., Morgan, C., and Núñez, M., Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications, QFM, vol. 13. 2009.
R
C. E. Budde, D'Argenio, P. R., and Hermanns, H., Rare Event Simulation with Fully Automated Importance Splitting, in Computer Performance Engineering - 12th European Workshop, {EPEW} 2015, Madrid, Spain, August 31 - September 1, 2015, Proceedings, vol. 9272, M. Beltrán, Knottenbelt, W. J., and Bradley, J. T. Springer, 2015, pp. 275–290.PDF icon paper-552.pdf (309.05 KB)
J. Markovski, D'Argenio, P. R., Baeten, J. C. M., and de Vink, E. P., Reconciling real and stochastic time: the need for probabilistic refinement, Formal Aspects of Computing, vol. 24, pp. 497-518, 2012.PDF icon paper-124.pdf (568 KB)
M. D. Lee and D'Argenio, P. R., A Refinement Based Notion of Non-interference for Interface Automata: Compositionality, Decidability and Synthesis, in SCCC 2010, Proceedings of the XXIX International Conference of the Chilean Computer Science Society, 2010, pp. 280-289.PDF icon paper-10.pdf (320.38 KB)
M. D. Lee and de Vink, E. P., Rooted branching bisimulation as a congruence for probabilistic transition systems, in Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems, London, UK, 11th-12th April 2015, vol. 194, N. Bertrand and Tribastone, M. Open Publishing Association, 2015, pp. 79-94.PDF icon paper-572.pdf (233.09 KB)
S
J. Planul, Corin, R., and Fournet, C., Secure Enforcement for Global Process Specifications, in CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings, 2009, pp. 511-526.
G. Barthe, D'Argenio, P. R., and Rezk, T., Secure information flow by self-composition, Mathematical Structures in Computer Science, vol. 21, no. 6, pp. 1207-1252, 2011.PDF icon paper-9.pdf (411.05 KB)

Pages

Powered by Drupal