Publications

Export 329 results:
Sort by: Author Title [ Type (Desc)] Year
Journal Article
J. Markovski and M. A. Reniers, “Verifying Performance of Supervised Plants”, 2010 10th International Conference on Application of Concurrency to System Design, p. 52-61, 2012.
K. Bhargavan, C. Fournet, R. Corin, and E. Zalinescu, “Verified Cryptographic Implementations for TLS”, ACM Trans. Inf. Syst. Secur., vol. 15, p. 3, 2012.
M. D. Lee, D. Gebler, and P. R. D'Argenio, “Tree rules in probabilistic transition system specifications with negative and quantitative premises”, Electronic Proceedings in Theoretical Computer Science, vol. 89, p. 115 - 130, 2012.
B. C. Parrino, J. P. Galeotti, D. Garbervetsky, and M. F. Frias, “TacoFlow: optimizing SAT program verification using dataflow analysis”, Software & Systems Modeling, p. 1–19, 2014.
B. C. Parrino, J. P. Galeotti, D. Garbervetsky, and M. F. Frias, “TacoFlow: optimizing {SAT} program verification using dataflow analysis”, Software and System Modeling, vol. 14, p. 45–63, 2015.
G. E. Sibay, V. A. Braberman, S. Uchitel, and J. Kramer, “Synthesizing Modal Transition Systems from Triggered Scenarios”, IEEE Transactions on Software Engineering, vol. 39, p. 975-1001, 2013.PDF icon Synthesising Modal Transition Systems from Triggered Scenarios_2013.pdf (658.89 KB)
C. Baier, J. Klein, and S. Klüppelholz, “Synthesis of Reo Connectors for Strategies and Controllers”, Fundamenta Informaticae, vol. 130, p. 1–20, 2014.
D. E. Nadales Agut, D. A. van Beek, and J. E. Rooda, “Syntax and semantics of the compositional interchange format for hybrid systems”, J. Log. Algebr. Program., vol. 82, p. 1-52, 2013.
C. Areces and E. Orbe, “Symmetries in Modal Logics”, Bulletin of Symbolic Logic, 2015.
C. Areces and E. Orbe, “Symmetric blocking”, Theoretical Computer Science, 2015.
N. Jansen, et al., “Symbolic counterexample generation for large discrete-time Markov chains”, Sci. Comput. Program., vol. 91, p. 90-114, 2014.
C. Areces, R. Fervari, and G. Hoffmann, “Swap logic”, Logic Journal of IGPL, vol. 22, no. 2, p. 309-332, 2014.PDF icon swap-op.pdf (459.55 KB)
V. A. Braberman, D. Garbervetsky, S. Hym, and S. Yovine, “Summary-based inference of quantitative bounds of live heap objects”, Sci. Comput. Program., vol. 92, p. 56–84, 2014.
V. A. Braberman, D. Garbervetsky, S. Hym, and S. Yovine, “Summary-based inference of quantitative bounds of live heap objects”, Science of Computer Programming, vol. 92, p. 56–84, 2014.PDF icon 1-s2.0-S0167642313003298-main.pdf (515.25 KB)
N. Bertrand, et al., “Stochastic Timed Automata”, Logical Methods in Computer Science (LMCS), vol. 10, p. 1–73, 2014.
F. Asteasuain and V. A. Braberman, “Specification Patterns: Formal and Easy”, International Journal of Software Engineering and Knowledge Engineering, vol. 25, p. 669–700, 2015.
M. E. Andrés, C. Palamidessi, and G. Smith, “Special issue on quantitative information flow”, Mathematical Structures in Computer Science, vol. 25, p. 203–206, 2015.

Pages