Foundations of Computing group
| Title | Foundations of Computing group |
|---|
Latest research outputs
Sort by Date Title
QCSP on semicomplete digraphs
Dapić, P., Marković, P. and Martin, B. 2014. QCSP on semicomplete digraphs. 41st International Colloquium on Automata, Languages and Programming, ICALP 2014. Copenhagen, Denmark 08 - 11 Jul 2014 Springer. pp. 847-858Conference paper
On the complexity of computing maximum entropy for Markovian models
Chen, T. and Han, T. 2014. On the complexity of computing maximum entropy for Markovian models. 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014. New Delhi, India 15 - 17 Dec 2014 Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. pp. 571-583Conference paper
On the axiomatizability of impossible futures
Chen, T., Fokkink, W. and Van Glabbeek, R. 2015. On the axiomatizability of impossible futures. Logical Methods in Computer Science. 11 (3), pp. 1-30. https://doi.org/10.2168/LMCS-11(3:17)2015Article
A consistent foundation for Isabelle/HOL
Kunčar, O. and Popescu, A. 2015. A consistent foundation for Isabelle/HOL. 6th conference on Interactive Theorem Proving (ITP). Nanjing, China 24 - 27 Aug 2015 Springer. pp. 234-252 https://doi.org/10.1007/978-3-319-22102-1_16Conference paper
Towards cyber-physical systems as services: the ASIP protocol
Bordoni, M., Bottone, M., Fields, B., Gorogiannis, N., Margolis, M., Primiero, G. and Raimondi, F. 2015. Towards cyber-physical systems as services: the ASIP protocol. 2015 IEEE/ACM 1st International Workshop on Software Engineering for Smart Cyber-Physical Systems (SEsCPS). Florence, Italy 17 - 17 May 2015 IEEE. pp. 52-55 https://doi.org/10.1109/SEsCPS.2015.18Conference paper
The complexity of separating points in the plane
Cabello, S. and Giannopoulos, P. 2016. The complexity of separating points in the plane. Algorithmica. 74 (2), pp. 643-663. https://doi.org/10.1007/s00453-014-9965-6Article
Foundations for decision problems in separation logic with general inductive predicates
Antonopoulos, T., Gorogiannis, N., Haase, C., Kanovich, M. and Ouaknine, J. 2014. Foundations for decision problems in separation logic with general inductive predicates. 17th International Conference on the Foundations of Software Science and Computation Structures, FOSSACS 2014. Grenoble, France 05 - 13 Apr 2014 Springer. https://doi.org/10.1007/978-3-642-54830-7_27Conference paper
Cyclic abduction of inductively defined safety and termination preconditions
Brotherston, J. and Gorogiannis, N. 2014. Cyclic abduction of inductively defined safety and termination preconditions. 21st International Static Analysis Symposium, SAS 2014. Munich, Germany 11 - 13 Sep 2014 Springer. https://doi.org/10.1007/978-3-319-10936-7_5Conference paper
A generic cyclic theorem prover
Brotherston, J., Gorogiannis, N. and Petersen, R. 2012. A generic cyclic theorem prover. APLAS 2012. https://doi.org/10.1007/978-3-642-35182-2_25Conference paper
The complexity of abduction for separated heap abstractions
Gorogiannis, N., Kanovich, M. and O’Hearn, P. 2011. The complexity of abduction for separated heap abstractions. SAS 2011. https://doi.org/10.1007/978-3-642-23702-7_7Conference paper
Requirements, specifications, and minimal refinement
Gorogiannis, N. and Ryan, M. 2002. Requirements, specifications, and minimal refinement. WoLLIC 2002: 9th Workshop on Logic, Language, Information and Computation. Rio de Janeiro, Brazil 30 Jul - 02 Aug 2002 Elsevier. https://doi.org/10.1016/S1571-0661(04)80550-4Conference paper
Minimal refinements of specifications in modal and temporal logics
Gorogiannis, N. and Ryan, M. 2007. Minimal refinements of specifications in modal and temporal logics. Formal Aspects of Computing. 19 (4), pp. 417-444. https://doi.org/10.1007/s00165-007-0040-9Article
Formal verification of a theory of packages
Boender, J. 2011. Formal verification of a theory of packages. ECEASST. 48.Article
Certified Complexity (CerCo)
Amadio, R., Ayache, N., Bobot, F., Boender, J., Campbell, B., Garnier, I., Madet, A., McKinna, J., Mulligan, D., Piccolo, M., Pollack, R., Régis-Gianas, Y., Sacerdoti Coen, C., Stark, I. and Tranquilli, P. 2014. Certified Complexity (CerCo). Third International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2013). Bertinoro, Italy 29 - 31 Aug 2013 https://doi.org/10.1007/978-3-319-12466-7_1Conference paper
Weak bisimilarity coalgebraically
Popescu, A. 2009. Weak bisimilarity coalgebraically. Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009. Udine, Italy 07 - 10 Sep 2009 Springer. pp. 157-172Conference paper
A semantic approach to interpolation
Popescu, A., Şerbănuţă, T. and Roşu, G. 2009. A semantic approach to interpolation. Theoretical Computer Science. 410 (12-13), pp. 1109-1128. https://doi.org/10.1016/j.tcs.2008.09.038Article
Incremental pattern-based coinduction for process algebra and its Isabelle formalization
Popescu, A. and Gunter, E. 2010. Incremental pattern-based coinduction for process algebra and its Isabelle formalization. Foundations of Software Science and Computation Structures (FOSSACS). Paphos, Cyprus 20 - 28 Mar 2010 Springer. pp. 109-127Conference paper
More SPASS with Isabelle: superposition with hard sorts and configurable simplification
Blanchette, J., Popescu, A., Wand, D. and Weidenbach, C. 2012. More SPASS with Isabelle: superposition with hard sorts and configurable simplification. Interactive Theorem Proving (ITP), Third International Conference. Princeton, New Jersey, US 13 - 15 Aug 2012 Springer. pp. 345-360Conference paper
Proving concurrent noninterference
Popescu, A., Hölzl, J. and Nipkow, T. 2012. Proving concurrent noninterference. 2nd International Conference on Certified Programs and Proofs (CPP 2012). Kyoto, Japan 13 - 15 Dec 2012 Springer. pp. 109-125Conference paper
Formal verification of language-based concurrent noninterference
Popescu, A., Hölzl, J. and Nipkow, T. 2013. Formal verification of language-based concurrent noninterference. Journal of Formalized Reasoning. 6 (1), pp. 1-30. https://doi.org/10.6092/issn.1972-5787/3690Article
Noninterfering schedulers: when possibilistic noninterference implies probabilistic noninterference
Popescu, A., Hölzl, J. and Nipkow, T. 2013. Noninterfering schedulers: when possibilistic noninterference implies probabilistic noninterference. 5th Conference on Algebra and Coalgebra in Computer Science (CALCO). Warsaw, Poland 03 - 06 Sep 2013 Springer. pp. 236-252Conference paper
Mechanizing the metatheory of sledgehammer
Blanchette, J. and Popescu, A. 2013. Mechanizing the metatheory of sledgehammer. 9th International Symposium on Frontiers of Combining Systems (FroCoS 2013). Nancy, France 18 - 20 Sep 2013 Springer. pp. 245-260Conference paper
Formalizing probabilistic noninterference
Popescu, A., Hölzl, J. and Nipkow, T. 2013. Formalizing probabilistic noninterference. 3rd International Conference on Certified Programs and Proofs (CPP 2013). Melbourne, VIC, Australia 11 - 13 Dec 2013 Springer International Publishing. pp. 259-275Conference paper
Nonfree datatypes in Isabelle/HOL: animating a many-sorted metatheory
Schropp, A. and Popescu, A. 2013. Nonfree datatypes in Isabelle/HOL: animating a many-sorted metatheory. Certified Programs and Proofs (CPP). Melbourne, Australia 11 - 13 Dec 2013 Springer. pp. 114-130 https://doi.org/10.1007/978-3-319-03545-1_8Conference paper
Witnessing (co)datatypes
Blanchette, J., Popescu, A. and Traytel, D. 2015. Witnessing (co)datatypes. 24th European Symposium on Programming (ESOP 2015). London, UK 11 - 18 Apr 2015 Springer. pp. 359-382Conference paper
Unified classical logic completeness: a coinductive pearl
Blanchette, J., Popescu, A. and Traytel, D. 2014. Unified classical logic completeness: a coinductive pearl. 7th International Joint Conference on Automated Reasoning (IJCAR). Vienna, Austria 19 - 22 Jul 2014 Springer International Publishing. pp. 46-60Conference paper
Externalizing behaviour for analysing system models
Ivanova, M., Probst, C., Hansen, R. and Kammueller, F. 2013. Externalizing behaviour for analysing system models. 5th International Workshop on Managing Insider Security Threats, MIST, 2013..Conference paper
Invalidating policies using structural information
Kammueller, F. and Probst, C. 2014. Invalidating policies using structural information. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications. 5 (2), pp. 59-79. https://doi.org/10.22667/JOWUA.2014.06.31.059Article
Confinement for active objects
Kammueller, F. 2015. Confinement for active objects. International Journal of Advanced Computer Science and Applications. 6 (2), pp. 246-261. https://doi.org/10.14569/IJACSA.2015.060236Article
Making security type systems less ad hoc
Nipkow, T. and Popescu, A. 2014. Making security type systems less ad hoc. Information Technology. 56 (6), pp. 267-272. https://doi.org/10.1515/itit-2014-1060Article
Strong normalization for System F by HOAS on top of FOAS
Popescu, A., Gunter, E. and Osborn, C. 2010. Strong normalization for System F by HOAS on top of FOAS. 25th Annual IEEE Symposium on Logic in Computer Science (LICS). Edinburgh, United Kingdom 11 - 14 Jul 2010 Institute of Electrical and Electronics Engineers. pp. 31-40Conference paper
Recursion principles for syntax with bindings and substitution
Popescu, A. and Gunter, E. 2011. Recursion principles for syntax with bindings and substitution. The 16th ACM SIGPLAN International Conference on Functional Programming. Tokyo 19 - 21 Sep 2011 Association for Computing Machinery (ACM). pp. 346-358Conference paper
Foundational, compositional (co)datatypes for higher-order logic: category theory applied to theorem proving
Traytel, D., Popescu, A. and Blanchette, J. 2012. Foundational, compositional (co)datatypes for higher-order logic: category theory applied to theorem proving. 27th Annual IEEE Symposium on Logic in Computer Science (LICS). Dubrovnik, Croatia 25 - 28 Jun 2012 Institute of Electrical and Electronics Engineers (IEEE). pp. 596-605 https://doi.org/10.1109/LICS.2012.75Conference paper
Truly modular (co)datatypes for Isabelle/HOL
Blanchette, J., Hölzl, J., Lochbihler, A., Panny, L., Popescu, A. and Traytel, D. 2014. Truly modular (co)datatypes for Isabelle/HOL. 5th International Conference on Interactive Theorem Proving (ITP). Vienna, Austria 14 - 17 Jul 2014 Springer International Publishing. pp. 93-110Conference paper
Cardinals in Isabelle/HOL
Blanchette, J., Popescu, A. and Taytel, D. 2014. Cardinals in Isabelle/HOL. 5th International Conference on Interactive Theorem Proving. Vienna, Austria 14 - 17 Jul 2014 Springer. pp. 111-127Conference paper
Term-generic logic
Popescu, A. and Roşu, G. 2015. Term-generic logic. Theoretical Computer Science. 577, pp. 1-24. https://doi.org/10.1016/j.tcs.2015.01.047Article
On malfunctioning software
Floridi, L., Fresco, N. and Primiero, G. 2015. On malfunctioning software. Synthese. 192 (4), pp. 1199-1220. https://doi.org/10.1007/s11229-014-0610-3Article
On the ontology of the computing process and the epistemology of the computed
Primiero, G. 2014. On the ontology of the computing process and the epistemology of the computed. Philosophy & Technology. 27 (3), pp. 485-489. https://doi.org/10.1007/s13347-014-0174-7Article
Facing computing as technique: towards a history and philosophy of computing
De Mol, L. and Primiero, G. 2014. Facing computing as technique: towards a history and philosophy of computing. Philosophy & Technology. 27 (3), pp. 321-326. https://doi.org/10.1007/s13347-014-0169-4Article
Modeling human behaviour with higher order logic: insider threats
Boender, J., Ivanova, M., Kammueller, F. and Primiero, G. 2014. Modeling human behaviour with higher order logic: insider threats. 4th Workshop on Socio-Technical Aspects in Security and Trust (STAST 2014). Vienna, Austria 18 Jul 2014 Institute of Electrical and Electronics Engineers. pp. 31-39 https://doi.org/10.1109/STAST.2014.13Conference paper
0
total views0
total downloads0
views this month0
downloads this month