Export 329 results:
Sort by: Author Title Type [ Year (Asc)]
S. Abramsky, M. W. Mislove, and C. Palamidessi, “Special issue dedicated to a selection of papers of the conference Mathematical Foundations of Programming Semantics (MFPS XXV)”, Theor. Comput. Sci., vol. 430, p. 1-2, 2012.
G. Regis, N. Ricci, N. Aguirre, and T. S. E. Maibaum, “Specifying and Verifying Declarative Fluent Temporal Logic Properties of Workflows”, in Formal Methods: Foundations and Applications - 15th Brazilian Symposium, {SBMF} 2012, Natal, Brazil, September 23-28, 2012. Proceedings, 2012.PDF icon WorkflowPropVerification.pdf (433.21 KB)
M. Bozga, et al., “State-of-the-art tools and techniques for quantitative modeling and analysis of embedded systems”, in 2012 Design, Automation {&} Test in Europe Conference {&} Exhibition, DATE 2012, Dresden, Germany, March 12-16, 2012, 2012.
R. Bruni, H. C. Melgratti, and U. Montanari, “A survey on basic connectors and buffers”, in Formal Methods for Components and Objects - 10th International Symposium, FMCO 2011. Revised Papers, 2012.
C. Areces, G. Hoffmann, and E. Orbe, “Symmetries in Modal Logics: A Coinductive Approach”, in Proceedings of the 7th Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2012), Rio de Janeiro, 2012.
R. Corin and F. Manzano, “Taint Analysis of Security Code in the KLEE Symbolic Execution Engine”, in 2012 International Conference on Information and Communications Security (ICICS), Hong Kong, 2012.PDF icon 76180264 (1).pdf (252.37 KB)
D. Cousineau, D. Doligez, L. Lamport, S. Merz, D. Ricketts, and H. Vanzetto, “TLA+ Proofs”, in 18th Intl. Symp. Formal Methods (FM 2012), Paris, France, 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.
F. Arnold, D. Gebler, D. Guck, and H. Hatefi, “A Tutorial on Interactive Markov Chains”, in {ROCKS}, 2012.
V. S. Bengolea, N. Aguirre, D. Marinov, and M. F. Frias, “Using Coverage Criteria on RepOK to Reduce Bounded Exhaustive Test Suites”, in International Conference on Tests and Proofs TAP 2012, vol. 7305, 2012, p. 19 - 34.PDF icon testsuite-reduction.pdf (262.31 KB)
L. M. Ferrer Fioriti, E. M. Hahn, H. Hermanns, and B. Wachter, “Variable Probabilistic Abstraction Refinement”, in Automated Technology for Verification and Analysis - 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings, 2012, vol. 7561, p. 300-316.
T. Brázdil, H. Hermanns, J. Krčál, J. Kret\'ınský, and V. Rehák, “Verification of Open Interactive Markov Chains”, in IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, 2012.
E. E. S. Musa, “Verification of Stochastic Requirements in Supervised Plants”, SE Report, TUE. 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.
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.
J. Markovski and M. A. Reniers, “Verifying Performance of Supervised Plants”, in ACSD, 2012.
B. Delahaye, et al., “Abstract Probabilistic Automata”, Information and Computation, vol. 232, p. 66 - 116, 2013.
S. Hamadou, V. Sassone, and M. Yang, “An analysis of trust in anonymity networks in the presence of adaptive attackers”, Mathematical Structures in Computer Science, p. to appear, 2013.
G. Scilingo, M. M. Novaira, R. Degiovanni, and N. Aguirre, “Analyzing formal requirements specifications using an off-the-shelf model checker”, in XXXIX Latin American Computing Conference (CLEI), Caracas (Naiguata), Venezuela, October 7-11, 2013, 2013.PDF icon analisis-scr-model-checking.pdf (188.48 KB)
E. Pavese, V. A. Braberman, and S. Uchitel, “Automated reliability estimation over partial systematic explorations”, in Proceedings of the 2013 International Conference on Software Engineering, Piscataway, NJ, USA, 2013, p. 602-611 .PDF icon Automated Reliability Estimation over Partial-icse2013.pdf (644.77 KB)
H. Czemerinski, V. A. Braberman, and S. Uchitel, “Behaviour Abstraction Coverage as Black-Box Adequacy Criteria”, in ICST, Luxembourg, 2013.PDF icon Behaviour Abstraction Coverage as Black-Box Adequacy Criteria-icst.pdf (221.23 KB)
L. Bocchi and H. C. Melgratti, “On the Behaviour of General-Purpose Applications on Cloud Storages”, in Web Services and Formal Methods - 10th International Workshop, {WS-FM} 2013, Beijing, China, August 2013, Revised Selected Papers, 2013.
L. Song, L. Zhang, and J. C. Godskesen, “Bisimulations Meet PCTL Equivalences for Probabilistic Automata”, Logical Methods in Computer Science, vol. 9, 2013.
J. Geldenhuys, N. Aguirre, M. F. Frias, and W. Visser, “Bounded Lazy Initialization”, in NASA Formal Methods, 5th International Symposium, NFM 2013, Moffett Field, CA, USA, 2013.
K. Chatzikokolakis, M. E. Andrés, N. E. Bordenabe, and C. Palamidessi, “Broadening the Scope of Differential Privacy Using Metrics”, in The 13th Privacy Enhancing Technologies Symposium, Bloomington, Indiana, United States, 2013.