Publications

Export 40 results:
Sort by: [ Author (Asc)] Title Type Year
Filters: First Letter Of Last Name is A  [Clear All Filters]
[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   [Show ALL]
A
P. Abad, et al., “Improving Test Generation under Rich Contracts by Tight Bounds and Incremental SAT Solving”, in IEEE Sixth International Conference on Software Testing, Verification and Validation ICST 2013, Luxembourg, 2013.PDF icon icst2013.pdf (285.71 KB)
M. Abaffy, T. Brázdil, V. Rehák, B. Bosanský, A. {\'ı}n Kucera, and J. Krčál, “Solving adversarial patrolling games with bounded error: (extended abstract)”, in International conference on Autonomous Agents and Multi-Agent Systems, {AAMAS} '14, Paris, France, May 5-9, 2014, 2014.
A
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.
S. Abriola, M. E. Descotte, and S. Figueira, “Saturation, Definability, and Separation for XPath on Data Trees”, in 9th Alberto Mendelzon International Workshop on Foundations of Data Management, 2015.
S. Abriola, M. E. Descotte, and S. Figueira, “Saturation, Definability, and Separation for XPath on Data Trees”, in Proceedings of the 9th Alberto Mendelzon International Workshop on Foundations of Data Management, Lima, Peru, May 6 - 8, 2015., 2015.
S. Abriola, M. E. Descotte, and S. Figueira, “Model Theory of XPath on Data Trees. Part II: Binary Bisimulation and Definability”, Information and Computation, In Press.
S. Abriola, M. E. Descotte, and S. Figueira, “Definability for Downward and Vertical XPath on Data Trees”, in 21th Workshop on Logic, Language, Information and Computation, 2014.
S. Abriola, M. E. Descotte, and S. Figueira, “Definability for Downward and Vertical XPath on Data Trees”, in Logic, Language, Information, and Computation - 21st International Workshop, WoLLIC 2014, Valpara{\'ı}so, Chile, September 1-4, 2014. Proceedings, 2014.
S. Abriola and S. Figueira, “A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings”, in A note on the order type of minoring orderings and some algebraic properties of ω2-well quasi-orderings, 2014.
S. Abriola, S. Figueira, and G. Senno, “Linearizing bad sequences: upper bounds for the product and majoring well quasi-orders”, in 19th Workshop on Logic, Language, Information and Computation, 2012.
S. Abriola, S. Figueira, and G. Senno, “Linearizing well-quasi orders and bounding the length of bad sequences”, Theoretical Computer Science, vol. 603, p. 3–22, 2015.
A. Acosta, C. Kilmurray, P. F. Castro, and N. Aguirre, “ Model Checking Propositional Deontic Temporal Logic via a mu-Calculus Characterization”, in 15th Brazilian Symposium on Formal Methods (SBMF 2012), Natal, Brazil, 2012.
D. Alrajeh, J. Kramer, A. Van Lamsweerde, A. Russo, and S. Uchitel, “Generating obstacle conditions for requirements completeness”, in Software Engineering (ICSE), 2012 34th International Conference on, 2012, p. 705-715.
M. S. Alvim, M. E. Andrés, K. Chatzikokolakis, P. Degano, and C. Palamidessi, “On the information leakage of differentially-private mechanisms”, Journal of Computer Security, vol. 23, p. 427–469, 2015.
M. S. Alvim, K. Chatzikokolakis, A. McIver, C. Morgan, C. Palamidessi, and G. Smith, “Additive and Multiplicative Notions of Leakage, and Their Capacities”, in Proceedings of the IEEE 27th Computer Security Foundations Symposium, (CSF) 2014, Vienna, Austria, 19-22 July, 2014, 2014.
M. S. Alvim, K. Chatzikokolakis, C. Palamidessi, and G. Smith, “Measuring Information Leakage using Generalized Gain Functions”, in Proceedings of the Computer Security Foundations Symposium (CSF), 2012, p. 265-279.PDF icon gleakage.pdf (330.44 KB)
M. S. Alvim, M. E. Andrés, and C. Palamidessi, “Quantitative information flow in interactive systems”, Journal of Computer Security, vol. 20, p. 3-50, 2012.PDF icon full.pdf (532.59 KB)
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.
M. E. Andrés, N. E. Bordenabe, K. Chatzikokolakis, and C. Palamidessi, “Geo-Indistinguishability: Differential Privacy for Location-Based Systems”, in 20th ACM Conference on Computer and Communications Security, Berlin, Germany, 2013.
A. Arcuri, G. Fraser, and J. P. Galeotti, “Automated Unit Test Generation for Classes with Environment Dependencies”, in Proceedings of the 2014 International Conference on Automated Software Engineering (ASE), 2014.PDF icon arcuri-ase-2014.pdf (280.35 KB)
C. Areces, S. Figueira, and S. Mera, “Completeness Results for Memory Logics”, Annals of Pure and Applied Logic, vol. 163, no. 7, p. 961-972, 2012.PDF icon Completeness_Results_for_Memory_Logics.pdf (401.9 KB)
C. Areces, P. Blackburn, Huertas, A., and M. Manzano, “Completeness in Hybrid Type Theory”, Journal of Philosophical Logic, vol. 43, p. 209–238, 2014.
C. Areces, R. Fervari, and G. Hoffmann, “Relation-changing modal operators”, Logic Journal of the {IGPL}, vol. 23, p. 601–627, 2015.
C. Areces, F. Bustos, M. Dominguez, and J. Hoffmann., “Optimizing Planning Domains by Automatic Action Schema Splitting”, in Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS'14), Portsmouth, NH, USA, 2014.

Pages