Publications

Export 329 results:
Sort by: 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 
W
C. Baier, J. Klein, S. Klüppelholz, and S. Wunderlich, “Weight Monitoring with Linear Temporal Logic: Complexity and Decidability”, in Proc. of the 23rd Conference on Computer Science Logic and the 29th Symposium on Logic In Computer Science (CSL-LICS), 2014.
V
R. Castaño, J. P. Galeotti, D. Garbervetsky, J. Tapicer, and E. Zoppi, “On Verifying Resource Contracts using Code Contracts”, in Proceedings First Latin American Workshop on Formal Methods, {LAFM} 2013, Buenos Aires, Argentina, August 26th 2013., 2014.
R. Castaño, J. P. Galeotti, D. Garbervetsky, J. Tapicer, and E. Zoppi, “On verifying resource contracts using Code Contracts”, in 1st Latin American Workshop on Formal Methods (LAFM 2013), co-located with Concur’13, 2013.PDF icon 1401.0968v1.pdf (380.35 KB)
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.
K. Bhargavan, C. Fournet, R. Corin, and E. Zalinescu, “Verified Cryptographic Implementations for TLS”, ACM Trans. Inf. Syst. Secur., vol. 15, p. 3, 2012.
E. E. S. Musa, “Verification of Stochastic Requirements in Supervised Plants”, SE Report, TUE. 2012.
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.
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.
U
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)
T
F. Arnold, D. Gebler, D. Guck, and H. Hatefi, “A Tutorial on Interactive Markov Chains”, in {ROCKS}, 2012.
Trustworthy Global Computing - 7th International Symposium, TGC 2012, Newcastle upon Tyne, UK, September 7-8, 2012, Revised Selected Papers”, TGC, vol. 8191. 2013.
M. Veeningen, M. Brusò, J. den Hartog, and N. Zannone, “TRIPLEX: Verifying Data Minimisation in Communication Systems”, in CCS, 2013.
M. Veeningen, M. Brusò, J. den Hartog, and N. Zannone, “TRIPLEX: verifying data minimisation in communication systems”, in ACM Conference on Computer and Communications Security , 2013.
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.
C. Baier, C. Dubslaff, and S. Klüppelholz, “Trade-off Analysis Meets Probabilistic Model Checking”, in Proc. of the 23rd Conference on Computer Science Logic and the 29th Symposium on Logic In Computer Science (CSL-LICS), 2014.
P. F. Castro, C. Kilmurray, and N. Piterman, “Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics”, in 32nd Symposium on Theoretical Aspects of Computer Science, 2015.
J. Markovski, “Towards Supervisory Control of Generally-Distributed Discrete-Event Systems”, in EPEW, 2013.
J. Markovski, “Towards Optimal Supervisory Control of Discrete-Time Stochastic Discrete-Event Processes with Data”, in ACSD, 2013.
S. Sardiña and N. D'Ippolito, “Towards Fully Observable Non-Deterministic Planning as Assumption-based Automatic Synthesis”, in Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, {IJCAI} 2015, Buenos Aires, Argentina, July 25-31, 2015, 2015.
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.
F. Arnold, H. Hermanns, R. Pulungan, and M. Stoelinga, “Time-Dependent Analysis of Attacks”, in Principles of Security and Trust - Third International Conference, {POST} 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2014, Grenoble, France, April 5-13, 2014, Proceedings, 2014.
F. Sher and J. - P. Katoen, “Tight Game Abstractions of Probabilistic Automata”, in Concurrency Theory (CONCUR), 2014.
C. E. Budde, P. R. D'Argenio, P. Sánchez Terraf, and N. Wolovick, “A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems”, in Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems - International Autumn School, {ROCKS} 2012, Vahrn, Italy, October 22-26, 2012, Advanced Lectures, vol. 8453, A. Remke and M. Stoelinga, Eds. 2014, p. 67–86.
J. - P. Katoen and D. Peled, “Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems”, in Programming Languages and Systems, ESOP 2013, 2013, vol. 7792, p. 411-430.

Pages