Foundations of Computing group


TitleFoundations of Computing group

Latest research outputs

Sort by Date Title
An examination of counterexamples in proofs and refutations
Bagce, S. and Baskent, C. 2009. An examination of counterexamples in proofs and refutations. Philosophia Scientiae. https://doi.org/10.4000/philosophiascientiae.228

Article

A formal approach to lakatosian heuristics
Baskent, C. 2012. A formal approach to lakatosian heuristics. Logique et Analyse. 55 (217), pp. 23-46.

Article

Towards paraconsistent inquiry
Baskent, C. 2016. Towards paraconsistent inquiry. The Australian Journal of Logic. 13 (2), pp. 21-40. https://doi.org/10.26686/ajl.v13i2.2102

Article

A non-classical logical approach to social software
Baskent, C. 2017. A non-classical logical approach to social software. in: Baskent, C., Moss, L. and Ramanujam, R. (ed.) Rohit Parikh on Logic, Language and Society Springer.

Book chapter

Digital twin as risk-free experimentation aid for techno-socio-economic systems
Barat, S., Kulkarni, V., Clark, T. and Barn, B. 2022. Digital twin as risk-free experimentation aid for techno-socio-economic systems. ACM / IEEE 25th International Conference on Model Driven Engineering Languages and Systems (MODELS). Montreal, Canada 23 - 28 Oct 2022 Association for Computing Machinery (ACM). pp. 66-75 https://doi.org/10.1145/3550355.3552409

Conference paper

A game theoretical semantics for logics of nonsense
Baskent, C. 2020. A game theoretical semantics for logics of nonsense. Raskin, J. and Bresolin, D. (ed.) GandALF 2020. Brussels, Belgium [Online event] 21 - 22 Sep 2020 Open Publishing Association. pp. 66-81 https://doi.org/10.4204/EPTCS.326.5

Conference paper

Value-sensitive co-design for resilient information systems
Primiero, G., Barn, B. and Barn, R. 2020. Value-sensitive co-design for resilient information systems. Studies in Logic, Grammar and Rhetoric. 63 (1), pp. 141-164. https://doi.org/10.2478/slgr-2020-0032

Article

Topological semantics for da Costa paraconsistent logics Cω and C*ω
Baskent, C. 2015. Topological semantics for da Costa paraconsistent logics Cω and C*ω. Beziau, J., Chakraborty, M. and Dutta, S. (ed.) 5th World Congress on Paraconsistency (WCP 2014). Kolkata, India 13 - 17 Feb 2014 Springer, New Delhi. https://doi.org/10.1007/978-81-322-2719-9_19

Conference paper

A game theoretical semantics for a logic of formal inconsistency
Baskent, C. and Carrasqueira, P. 2018. A game theoretical semantics for a logic of formal inconsistency. Logic Journal of the IGPL. https://doi.org/10.1093/jigpal/jzy068

Article

Graham Priest on dialetheism and paraconsistency
Baskent, C. and Ferguson, T. (ed.) 2019. Graham Priest on dialetheism and paraconsistency. Cham, Switzerland. Springer.

Edited Book

Describing and simulating concurrent quantum systems
Bornat, R., Boender, J., Kammueller, F., Poly, G. and Nagarajan, R. 2020. Describing and simulating concurrent quantum systems. Biere, A. and Parker, D. (ed.) International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 20). Dublin 27 - 30 Apr 2020 Springer. pp. 271-277 https://doi.org/10.1007/978-3-030-45237-7_16

Conference paper

New lace and arsenic: adventures in weak memory with a program logic (v2)
Bornat, R., Alglave, J. and Parkinson, M. 2016. New lace and arsenic: adventures in weak memory with a program logic (v2). arXiv.org arXiv. https://doi.org/10.48550/arXiv.1512.01416

Other

A history based logic for dynamic preference updates
Baskent, C. and McCusker, G. 2019. A history based logic for dynamic preference updates. Journal of Logic, Language and Information. https://doi.org/10.1007/s10849-019-09307-1

Article

Tableau-based translation from first-order logic to modal logic
Perkov, T. 2019. Tableau-based translation from first-order logic to modal logic. London, UK Middlesex University London.

Technical report

A true positives theorem for a static race detector
Gkorogiannis, N., O'Hearn, P. and Sergey, I. 2019. A true positives theorem for a static race detector. POPL 2019. Cascais, Portugal 12 - 19 Jan 2019 Association for Computing Machinery (ACM). pp. 1-29 https://doi.org/10.1145/3290370

Conference paper

Bindings as bounded natural functors
Blanchette, J., Gheri, L., Popescu, A. and Traytel, D. 2019. Bindings as bounded natural functors. 46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2019). Hotel Cascais Miragem, Cascais, Portugal 13 - 19 Jan 2019 Association for Computing Machinery (ACM). https://doi.org/10.1145/3290335

Conference paper

Automated equivalence checking of concurrent quantum systems
Ardeshir-Larijani, E., Gay, S. and Nagarajan, R. 2018. Automated equivalence checking of concurrent quantum systems. ACM Transactions on Computational Logic (TOCL). 19 (4), pp. 1-32. https://doi.org/10.1145/3231597

Article

Orthogonal terrain guarding is NP-complete
Bonnet, E. and Giannopoulos, P. 2018. Orthogonal terrain guarding is NP-complete. 34th International Symposium on Computational Geometry (SoCG 2018). Budapest, Hungary 11 - 14 Jun 2018 Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. pp. 11:1-11:15 https://doi.org/10.4230/LIPIcs.SoCG.2018.11

Conference paper

Simulation of a trust and reputation based mitigation protocol for a black hole style attack on VANETs
Martorana, A., Primiero, G. and Tagliabue, J. 2018. Simulation of a trust and reputation based mitigation protocol for a black hole style attack on VANETs. 2018 IEEE European Symposium on Security and Privacy Workshops - S4CIP’18: 3rd Workshop on Safety & Security aSSurance for Critical Infrastructures Protection. London, United Kingdom 27 Apr 2018 Institute of Electrical and Electronics Engineers (IEEE). pp. 127-135 https://doi.org/10.1109/EuroSPW.2018.00025

Conference item

The logic of identity and copy for computational artefacts
Angius, N. and Primiero, G. 2018. The logic of identity and copy for computational artefacts. Journal of Logic and Computation. 28 (6), pp. 1293-1322. https://doi.org/10.1093/logcom/exy012

Article

Low-crossing spanning trees: an alternative proof and experiments
Giannopoulos, P., Konzack, M. and Mulzer, W. 2014. Low-crossing spanning trees: an alternative proof and experiments. European Workshop on Computational Geometry. Ein-Gedi, Israel 03 - 05 Mar 2014

Conference paper

Bit mask-oriented genetic algorithm for grammatical inference and premature convergence
Pandey, H., Chaudhary, A. and Mehrotra, D. 2018. Bit mask-oriented genetic algorithm for grammatical inference and premature convergence. International Journal of Bio-Inspired Computation. 12 (1), pp. 54-69. https://doi.org/10.1504/IJBIC.2018.10014202

Article

Annotated natural deduction for adaptive reasoning
Allo, P. and Primiero, G. 2019. Annotated natural deduction for adaptive reasoning. in: Baskent, C. and Ferguson, T. (ed.) Graham Priest on Dialetheism and Paraconsistency Springer.

Book chapter

A Yabloesque paradox in epistemic game theory
Baskent, C. 2018. A Yabloesque paradox in epistemic game theory. Synthese. 195 (1), pp. 441-464. https://doi.org/10.1007/s11229-016-1231-9

Article

RacerD: compositional static race detection
Blackshear, S., Gorogiannis, N., O'Hearn, P. and Sergey, I. 2018. RacerD: compositional static race detection. Association for Computing Machinery (ACM). https://doi.org/10.1145/3276514

Conference paper

Quantum error-correcting output codes
Windridge, D., Mengoni, R. and Nagarajan, R. 2018. Quantum error-correcting output codes. International Journal of Quantum Information. 16 (8). https://doi.org/10.1142/S0219749918400038

Article

QPTAS and subexponential algorithm for maximum clique on disk graphs
Bonnet, E., Giannopoulos, P., Kim, E., Rzążewski, P. and Sikora, F. 2018. QPTAS and subexponential algorithm for maximum clique on disk graphs. 34th International Symposium on Computational Geometry. Budapest, Hungary 11 - 14 Jun 2018 Dagstuhl, Germany Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany. pp. 12:1-12:15 https://doi.org/10.4230/LIPIcs.SoCG.2018.12

Conference paper

CoSMed: a confidentiality-verified social media platform
Bauereiß, T., Pesenti Gritti, A., Popescu, A. and Raimondi, F. 2018. CoSMed: a confidentiality-verified social media platform. Interactive Theorem Proving - 7th International Conference, ITP 2016, Nancy, France, August 22-25, 2016, Proceedings. Nancy, France 22 - 27 Aug 2016 Springer. https://doi.org/10.1007/s10817-017-9443-3

Conference paper

On the parameterized complexity of red-blue points separation
Bonnet, E., Giannopoulos, P. and Lampis, M. 2018. On the parameterized complexity of red-blue points separation. 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Vienna, Austria 06 - 08 Sep 2017 LIPICS Schloss Dagstuhl. pp. 8:1-8:13 https://doi.org/10.4230/LIPIcs.IPEC.2017.8

Conference paper

Biabduction (and related problems) in array separation logic
Brotherston, J., Gorogiannis, N. and Kanovich, M. 2017. Biabduction (and related problems) in array separation logic. International Conference on Automated Deduction. Gothenburg 08 - 11 Aug 2017 Springer. https://doi.org/10.1007/978-3-319-63046-5_29

Conference paper

Augmenting bug localization with part-of-speech and invocation
Zhou, Y., Tong, Y., Chen, T. and Han, J. 2017. Augmenting bug localization with part-of-speech and invocation. International Journal of Software Engineering and Knowledge Engineering. 27 (06), pp. 925-949. https://doi.org/10.1142/s0218194017500346

Article

A formalized general theory of syntax with bindings
Gheri, L. and Popescu, A. 2017. A formalized general theory of syntax with bindings. 8th International Conference Interactive Theorem Proving (ITP). Brasília, Brazil 26 - 29 Sep 2017 Springer. pp. 241-261 https://doi.org/10.1007/978-3-319-66107-0_16

Conference paper

Foundational nonuniform (co)datatypes for higher-order logic
Blanchette, J., Meier, F., Popescu, A. and Traytel, D. 2017. Foundational nonuniform (co)datatypes for higher-order logic. 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Reykjavik, Iceland 20 - 23 Jun 2017 IEEE. https://doi.org/10.1109/LICS.2017.8005071

Conference paper

Soundness and completeness proofs by coinductive methods
Blanchette, J., Popescu, A. and Traytel, D. 2017. Soundness and completeness proofs by coinductive methods. Journal of Automated Reasoning. 58 (1), pp. 149-179. https://doi.org/10.1007/s10817-016-9391-3

Article

Friends with benefits: implementing corecursion in foundational proof assistants
Blanchette, J., Bouzy, A., Lochbihler, A., Popescu, A. and Traytel, D. 2017. Friends with benefits: implementing corecursion in foundational proof assistants. 26th European Symposium on Programming, ESOP 2017. Uppsala, Sweden 22 - 29 Apr 2017 Springer. https://doi.org/10.1007/978-3-662-54434-1_5

Conference paper

From types to sets by local type definitions in higher-order logic
Kunčar, O. and Popescu, A. 2016. From types to sets by local type definitions in higher-order logic. ITP 2016: 7th International Conference on Interactive Theorem Proving. Nancy, France 22 - 25 Aug 2016 Springer. https://doi.org/10.1007/978-3-319-43144-4_13

Conference paper

CoSMed: a confidentiality-verified social media platform
Bauereiß, T., Pesenti Gritti, A., Popescu, A. and Raimondi, F. 2016. CoSMed: a confidentiality-verified social media platform. ITP 2016: 7th International Conference on Interactive Theorem Proving. Nancy, France 22 - 25 Aug 2016 Springer. pp. 87-106 https://doi.org/10.1007/978-3-319-43144-4_6

Conference paper

A proof-theoretic trust and reputation model for VANET
Primiero, G., Raimondi, F., Chen, T. and Nagarajan, R. 2017. A proof-theoretic trust and reputation model for VANET. S4CIP’17: 2nd Workshop on Safety & Security aSSurance for Critical Infrastructures Protection. Paris, France 29 Apr 2017 Institute of Electrical and Electronics Engineers (IEEE). pp. 146-152 https://doi.org/10.1109/EuroSPW.2017.64

Conference paper

Formal reasoning on infinite data values: an ongoing quest
Chen, T., Song, F. and Wu, Z. 2017. Formal reasoning on infinite data values: an ongoing quest. SETSS 2016: Second International School Engineering Trustworthy Software Systems, Tutorial Lectures. Chongqing, China 28 Mar - 02 Apr 2016 Springer. pp. 195-257 https://doi.org/10.1007/978-3-319-56841-6_6

Conference paper

ProEva: runtime proactive performance evaluation based on continuous-time markov chains
Su, G., Chen, T., Feng, Y. and Rosenblum, D. 2017. ProEva: runtime proactive performance evaluation based on continuous-time markov chains. 2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE). Buenos Aires, Argentina 20 - 28 May 2017 Institute of Electrical and Electronics Engineers (IEEE). pp. 484-495 https://doi.org/10.1109/ICSE.2017.51

Conference paper

  • 0
    total views
  • 0
    total downloads
  • 0
    views this month
  • 0
    downloads this month