Foundations of Computing group
| Title | Foundations of Computing group |
|---|
Latest research outputs
Sort by Date Title
A typed natural deduction calculus to reason about secure trust
Primiero, G. and Raimondi, F. 2014. A typed natural deduction calculus to reason about secure trust. 2014 Twelfth Annual Conference on Privacy, Security and Trust (PST). Toronto, Canada 23 - 24 Jul 2014 Institute of Electrical and Electronics Engineers (IEEE). pp. 379-382 https://doi.org/10.1109/PST.2014.6890963Conference paper
A taxonomy of errors for information systems
Primiero, G. 2014. A taxonomy of errors for information systems. Minds and Machines. 24 (3), pp. 249-273. https://doi.org/10.1007/s11023-013-9307-5Article
Quantitative verification of implantable cardiac pacemakers over hybrid heart models
Chen, T., Diciolla, M., Kwiatkowska, M. and Mereacre, A. 2014. Quantitative verification of implantable cardiac pacemakers over hybrid heart models. Information and Computation. 236, pp. 87-101. https://doi.org/10.1016/j.ic.2014.01.014Article
Some non-classical approaches to the Brandenburger–Keisler paradox
Baskent, C. 2015. Some non-classical approaches to the Brandenburger–Keisler paradox. Logic Journal of the IGPL. 23 (4), pp. 533-552. https://doi.org/10.1093/jigpal/jzv001Article
The role of resilience and value for effective co-design of information systems
Barn, B., Barn, R. and Primiero, G. 2014. The role of resilience and value for effective co-design of information systems. in: Proceedings of the Conference of the International Association for Computing and Philosophy (IACAP 14) Springer Synthese Library.Book chapter
Constraint satisfaction problems over the integers with successor
Bodirsky, M., Martin, B. and Mottet, A. 2015. Constraint satisfaction problems over the integers with successor. 42nd ICALP 2015. Kyoto, Japan 06 - 10 Jul 2015 Heidelberg, Germany Springer Berlin. Heidelberg. pp. 256-267 https://doi.org/10.1007/978-3-662-47672-7_21Conference paper
Foundational extensible corecursion: a proof assistant perspective
Blanchette, J., Popescu, A. and Traytel, D. 2015. Foundational extensible corecursion: a proof assistant perspective. 20th ACM SIGPLAN International Conference on Functional Programming (ICFP). Vancouver, Canada 31 Aug - 02 Sep 2015 Association for Computing Machinery (ACM). pp. 192-204 https://doi.org/10.1145/2784731.2784732Conference paper
On the role of value sensitive concerns in software engineering practice
Barn, B., Barn, R. and Raimondi, F. 2015. On the role of value sensitive concerns in software engineering practice. 37th International Conference on Software Engineering, ICSE 2015. Florence, Italy 16 - 24 May 2015 IEEE. pp. 497-500 https://doi.org/10.1109/ICSE.2015.182Conference paper
An approach to early evaluation of informational privacy requirements
Barn, B., Primiero, G. and Barn, R. 2015. An approach to early evaluation of informational privacy requirements. 30th Annual ACM Symposium on Applied Computing. Salamanca, Spain 13 - 17 Apr 2015 Association for Computing Machinery (ACM). pp. 1370-1375 https://doi.org/10.1145/2695664.2695788Conference paper
A racket-based robot to teach first-year computer science
Androutsopoulos, K., Gorogiannis, N., Loomes, M., Margolis, M., Primiero, G., Raimondi, F., Varsani, P., Weldin, N. and Zivanovic, A. 2014. A racket-based robot to teach first-year computer science. 7 th European Lisp Symposium. IRCAM, Paris, France 05 - 06 May 2014 pp. 54-61Conference paper
J-Calc: a typed lambda calculus for intuitionistic justification logic
Pouliasis, K. and Primiero, G. 2014. J-Calc: a typed lambda calculus for intuitionistic justification logic. Electronic Notes in Theoretical Computer Science. 300, pp. 71-87. https://doi.org/10.1016/j.entcs.2013.12.012Article
Managing the complexity of large free and open source package-based software distributions
Mancinelli, F., Boender, J., Di Cosmo, R., Vouillon, J., Durak, B., Leroy, X. and Treinen, R. 2006. Managing the complexity of large free and open source package-based software distributions. Automated Software Engineering, 2006. ASE '06. 21st IEEE/ACM International Conference on. https://doi.org/10.1109/ASE.2006.49Article
Small world characteristics of FLOSS distributions
Boender, J. and Fernandes, S. 2014. Small world characteristics of FLOSS distributions. in: Counsell, S. and Núñez, M. (ed.) Software Engineering and Formal Methods : SEFM 2013 Collocated Workshops: BEAT2, WS-FMDS, FM-RAIL-Bok, MoKMaSD, and OpenCert, Madrid, Spain, September 23-24, 2013, Revised Selected Papers Springer International Publishing. pp. 417-429Book chapter
On the correctness of a branch displacement algorithm
Boender, J. and Sacerdoti Coen, C. 2014. On the correctness of a branch displacement algorithm. in: Ábrahám, E. and Havelund, K. (ed.) Tools and Algorithms for the Construction and Analysis of Systems : 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings Springer.Book chapter
Algorithmic check of standards for information quality dimensions
Primiero, G. 2014. Algorithmic check of standards for information quality dimensions. in: Floridi, L. and Illari, P. (ed.) The philosophy of information quality Springer.Book chapter
Verification of concurrent quantum protocols by equivalence checking
Ardeshir-Larijani, E., Gay, S. and Nagarajan, R. 2014. Verification of concurrent quantum protocols by equivalence checking. TACAS 2014: 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Grenoble, France 05 - 13 Apr 2014 Springer. https://doi.org/10.1007/978-3-642-54862-8_42Conference paper
A decision procedure for satisfiability in separation logic with inductive predicates
Brotherston, J., Fuhs, C., Pérez, J. and Gorogiannis, N. 2014. A decision procedure for satisfiability in separation logic with inductive predicates. CSL-LICS 2014. Vienna, Austria 14 - 18 Jul 2014 Association for computing machinery. pp. 1-10 https://doi.org/10.1145/2603088.2603091Conference paper
Model checking degrees of belief in a system of agents
Primiero, G., Raimondi, F. and Rungta, N. 2014. Model checking degrees of belief in a system of agents. AAMAS 2014: 13th International Conference on Autonomous Agents and Multiagent Systems. Paris, France 05 - 09 May 2014 International Foundation for Autonomous Agents and Multiagent Systems. pp. 133-140Conference paper
The semantics of untrustworthiness
Primiero, G. and Laszlo, K. 2016. The semantics of untrustworthiness. Topoi. 35 (1). https://doi.org/10.1007/s11245-013-9227-2Article
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
Dantchev, S. and Martin, B. 2013. Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Computational Complexity. 22 (1), pp. 191-213. https://doi.org/10.1007/s00037-012-0049-1Article
Towards automatic stability analysis for rely-guarantee proofs
Amjad, H. and Bornat, R. 2009. Towards automatic stability analysis for rely-guarantee proofs. in: Jones, N. and Müller-Olm, M. (ed.) Verification, model checking, and abstract interpretation: 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings Springer.Book chapter
Ready to preorder: the case of weak process semantics
Chen, T., Fokkink, W. and Van Glabbeek, R. 2008. Ready to preorder: the case of weak process semantics. Information Processing Letters. 109 (2), pp. 104-111. https://doi.org/10.1016/j.ipl.2008.09.003Article
Proceeding in abstraction. From concepts to types and the recent perspective on information
Primiero, G. 2009. Proceeding in abstraction. From concepts to types and the recent perspective on information. History and Philosophy of Logic. 30 (3), pp. 257-282. https://doi.org/10.1080/01445340902872630Article
On the axiomatizability of priority II
Aceto, L., Chen, T., Ingolfsdottir, A., Luttik, B. and Van de Pol, J. 2011. On the axiomatizability of priority II. Theoretical Computer Science. 412 (28), pp. 3035-3044. https://doi.org/10.1016/j.tcs.2011.02.033Article
On finite alphabets and infinite bases
Chen, T., Fokkink, W., Luttik, B. and Nain, S. 2008. On finite alphabets and infinite bases. Information and Computation. 206 (5), pp. 492-519. https://doi.org/10.1016/j.ic.2007.09.003Article
Model checking of continuous-time Markov chains against timed automata specifications
Chen, T., Han, T., Katoen, J., Mereacre, A. and Jagadeesan, R. 2011. Model checking of continuous-time Markov chains against timed automata specifications. Logical Methods in Computer Science. 7 (1). https://doi.org/10.2168/LMCS-7(1:12)2011Article
Context-aware adaptive applications: fault patterns and their automated identification
Sama, M., Elbaum, S., Raimondi, F., Rosenblum, D. and Wang, Z. 2010. Context-aware adaptive applications: fault patterns and their automated identification. IEEE Transactions on Software Engineering. 36 (5), pp. 644-661. https://doi.org/10.1109/TSE.2010.35Article
Automatic verification of competitive stochastic systems
Chen, T., Forejt, V., Kwiatkowska, M., Parker, D. and Simaitis, A. 2013. Automatic verification of competitive stochastic systems. Formal Methods in System Design. 43 (1), pp. 61-92. https://doi.org/10.1007/s10703-013-0183-7Article
An epistemic logic for becoming informed
Primiero, G. 2009. An epistemic logic for becoming informed. Synthese. 167 (2), pp. 363-389. https://doi.org/10.1007/s11229-008-9413-8Article
A modal type theory for formalizing trusted communications
Primiero, G. and Taddeo, M. 2012. A modal type theory for formalizing trusted communications. Journal of Applied Logic. 10 (1), pp. 92-114. https://doi.org/10.1016/j.jal.2011.12.002Article
Model checking for communicating quantum processes
Davidson, T., Gay, S., Mlnařík, H., Nagarajan, R. and Papanikolaou, N. 2012. Model checking for communicating quantum processes. International Journal of Unconventional Computing. 8 (1), pp. 73-98.Article
Lossless quantum prefix compression for communication channels that are always open
Müller, M., Rogers, C. and Nagarajan, R. 2009. Lossless quantum prefix compression for communication channels that are always open. Physical Review A. 79 (1). https://doi.org/10.1103/PhysRevA.79.012302Article
Equivalence checking of quantum protocols
Ardeshir-Larijani, E., Gay, S. and Nagarajan, R. 2013. Equivalence checking of quantum protocols. in: Piterman, N. and Smolka, S. (ed.) Tools and Algorithms for the Construction and Analysis of Systems : 19th International Conference Proceedings (TACAS 2013). Berlin Springer.Book chapter
Separation logic and concurrency
Bornat, R. 2010. Separation logic and concurrency. in: Boca, P., Bowen, J. and Siddiqi, J. (ed.) Formal Methods: State of the Art and New Directions London Springer Verlag. pp. 217-248Book chapter
QMC: a model checker for quantum systems
Gay, S., Nagarajan, R. and Papanikolaou, N. 2008. QMC: a model checker for quantum systems. in: Gupta, A. and Malik, S. (ed.) Computer Aided Verification : 20th International Conference, (CAV 2008) Proceedings Berlin Springer.Book chapter
Inter-process buffers in separation logic with rely-guarantee
Bornat, R. and Amjad, H. 2010. Inter-process buffers in separation logic with rely-guarantee. Formal Aspects of Computing. 22 (6), pp. 735-772. https://doi.org/10.1007/s00165-009-0141-8Article
Explanation of two non-blocking shared-variable communication algorithms
Bornat, R. and Amjad, H. 2011. Explanation of two non-blocking shared-variable communication algorithms. Formal Aspects of Computing. https://doi.org/10.1007/s00165-011-0213-4Article
Cyclic proofs of program termination in separation logic
Brotherston, J., Bornat, R. and Calcagno, C. 2008. Cyclic proofs of program termination in separation logic. ACM SIGPLAN Notices - POPL '08. 43 (1), pp. 101-112. https://doi.org/10.1145/1328897.1328453Article
Hierarchies in fragments of monadic strict NP
Martin, B. and Madelaine, F. 2007. Hierarchies in fragments of monadic strict NP. in: Cooper, B., Löwe, B. and Sorbi, A. (ed.) Computation and logic in the real world: Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings Springer Berlin. Heidelberg.Book chapter
Evaluation of collaborative filtering algorithms using a small dataset
Roda, F., Liberti, L. and Raimondi, F. 2011. Evaluation of collaborative filtering algorithms using a small dataset. WEBIST 2011. http://www.webist.org/WEBIST2011/Conference paper
0
total views0
total downloads0
views this month0
downloads this month