Items where Subject is "Q Science > QA Mathematics (inc Computing science) > QA 9 Formal systems, logics"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creator's name | Item Type | Date | No Grouping
Jump to: A | B | C | D | F | G | J | K | L | M | O | P | R | S | T | W
Number of items at this level: 46.

A

Arapinis, Myrto and Cheval, Vincent and Delaune, Stéphanie (2015) Composing security protocols: from confidentiality to privacy. In: 4th International Conference on Principles of Security and Trust (POST'15), April 2015, London, UK. (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)
[img] [img]

Arapinis, Myrto and Cheval, Vincent and Delaune, Stéphanie (2012) Verifying Privacy-Type Properties in a Modular Way. In: Cortier, Véronique and Zdancewic, Steve, eds. 2012 IEEE 25th Computer Security Foundations Symposium. IEEE pp. 95-109. ISBN 978-1-4673-1918-8. E-ISBN 978-0-7695-4718-3. (doi:https://doi.org/10.1109/CSF.2012.16) (Full text available)
[img]
Preview
[img]
Preview

Avanaki, Mohammad R. N. and Hojjatoleslami, Ali (2009) Speckle Reduction with Attenuation Compensation for Skin OCT Images Enhancement. In: MIUA, 14th-15th July 2009, Kingston University, London. (Unpublished) (Full text available)
[img]
Preview

B

Barrett, Edd and King, Andy (2012) Range and Set Abstraction using SAT. Electronic Notes in Theoretical Computer Science, 267 (1). pp. 93-107. ISSN 978-3-642-32468-0. (doi:https://doi.org/10.1016/j.entcs.2010.09.003) (Full text available)
[img]
Preview

Besbeas, Panagiotis and Morgan, Byron J. T. (2012) Kalman filter initialization for integrated population modelling. Journal of the Royal Statistical Society: Series C, 61 (1). pp. 151-162. ISSN 0035-9254. E-ISSN 1467-9876. (doi:https://doi.org/10.1111/j.1467-9876.2011.01012.x) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Bocchi, Laura and Demangeon, Romain (2013) Embedding Session Types in HML. In: Programming Language Approaches to Concurrency and Communication-cEntric Software (PLACES), 23rd March, 2013, Rome, Italy. (doi:https://doi.org/10.4204/EPTCS.137.5) (Full text available)
[img]
Preview

Bocchi, Laura and Yang, Weizhen and Yoshida, Nobuko (2014) Timed Multiparty Session Types. In: International Conference on Concurrency Theory (CONCUR). (doi:https://doi.org/10.1007/978-3-662-44584-6_29) (Full text available)
[img]
Preview

Boiten, Eerke Albert (2014) It’s possible to write flaw-free software, so why don’t we? . The Conversation UK Internet only. (Full text available)
[img]

Bowman, Howard and Thompson, Simon (1998) A tableau method for interval temporal logic with projection. TABLEAUX 1998: Automated Reasoning with Analytic Tableaux and Related Methods, . pp. 108-123. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Brotherston, James and Gorogiannis, Nikos and Kanovich, Max and Rowe, Reuben (2016) Model checking for symbolic-heap separation logic with inductive predicates. In: 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. POPL '16, January 20-22, 2016, St Petersburg, FL, USA. (doi:https://doi.org/10.1145/2914770.2837621) (Full text available)
[img]
Preview

Buchberger, Bruno and Craciun, Adrian and Jebelean, Tudor and Kovacs, Laura and Temur, Kutsia and Koji, Nakagawa and Piroi, Florina and Popov, Nikolaj and Robu, Judit and Rosenkranz, Markus and Windsteiger, Wolfgang (2006) Theorema: Towards computer-aided mathematical theory exploration. Journal of Applied Logic, 4 (4). pp. 470-504. ISSN 1570-8683. (doi:https://doi.org/10.1016/j.jal.2005.10.006) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

C

Cheval, Vincent (2014) APTE: An Algorithm for Proving Trace Equivalence. In: Ábrahám, Erika and Havelund, Klaus, eds. Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, 8413. Springer-Verlag Berlin, Grenoble, France pp. 587-592. ISBN 978-3-642-54861-1. E-ISBN 978-3-642-54862-8. (doi:https://doi.org/10.1007/978-3-642-54862-8_50) (Full text available)
[img]
Preview

Cheval, Vincent (2012) Automatic verification of cryptographic protocols: privacy-type properties. Doctor of Philosophy (PhD) thesis, ENS-Cachan. (Full text available)
[img]
Preview

Cheval, Vincent and Blanchet, Bruno (2013) Proving More Observational Equivalences with ProVerif. In: Basin, David and Mitchell, John C., eds. Principles of Security and Trust. Lecture Notes in Computer Science, 7796. Springer-Verlag Berlin, Roma, Italy pp. 226-246. ISBN 978-3-642-36829-5. E-ISBN 978-3-642-36830-1. (doi:https://doi.org/10.1007/978-3-642-36830-1_12) (Full text available)
[img]
Preview
[img]
Preview

Cheval, Vincent and Comon-Lundh, Hubert and Delaune, Stéphanie (2010) Automating Security Analysis: Symbolic Equivalence of Constraint Systems. In: Giesl, Jürgen and Hähnle, Reiner, eds. Automated Reasoning. Lecture Notes in Computer Science, 6173. Springer-Verlag Berlin, Edinburgh, Scotland, UK pp. 412-426. ISBN 978-3-642-14202-4. E-ISBN 978-3-642-14203-1. (doi:https://doi.org/10.1007/978-3-642-14203-1_35) (Full text available)
[img]
Preview

Cheval, Vincent and Comon-Lundh, Hubert and Delaune, Stéphanie (2011) Trace Equivalence Decision: Negative Tests and Non-determinism. In: Chen, Yan and Danezis, George and Shmatikov, Vitaly, eds. Proceedings of the 18th ACM conference on Computer and communications security - CCS '11. ACM Press pp. 321-330. ISBN 978-1-4503-0948-6. (doi:https://doi.org/10.1145/2046707.2046744) (Full text available)
[img]
Preview

Cheval, Vincent and Comon-Lundh, Hubert and Delaune, Stéphanie (2017) A procedure for deciding symbolic equivalence between sets of constraint systems. Information and Computation, 255 (part 1). pp. 94-125. ISSN 0890-5401. E-ISSN 1090-2651. (doi:https://doi.org/10.1016/j.ic.2017.05.004) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)
[img]

Cheval, Vincent and Cortier, Véronique (2015) Timing attacks: symbolic framework and proof techniques. In: 4th International Conference on Principles of Security and Trust (POST'15), April 2015, London, UK. (doi:https://doi.org/10.1007/978-3-662-46666-7_15) (Full text available)
[img]
Preview
[img]
Preview

Cheval, Vincent and Cortier, Véronique and Delaune, Stéphanie (2013) Deciding equivalence-based properties using constraint solving. Theoretical Computer Science, 492 . pp. 1-39. ISSN 0304-3975. (doi:https://doi.org/10.1016/j.tcs.2013.04.016) (Full text available)
[img]
Preview

Cheval, Vincent and Cortier, Véronique and Plet, Antoine (2013) Lengths May Break Privacy – Or How to Check for Equivalences with Length. In: Shargina, Natasha and Veith, Helmut, eds. Computer Aided Verification. Lecture Notes in Computer Science, 8044. Springer-Verlag Berlin, St Petersburg, Russia pp. 708-723. ISBN 978-3-642-39798-1. E-ISBN 978-3-642-39799-8. (doi:https://doi.org/10.1007/978-3-642-39799-8_50) (Full text available)
[img]
Preview
[img]
Preview

Cheval, Vincent and Delaune, Stéphanie and Ryan, Mark (2014) Tests for Establishing Security Properties. In: Maffei, Matteo and Tuosto, Emilio, eds. Trustworthy Global Computing. Lecture Notes in Computer Science, 8902. Springer-Verlag Berlin pp. 82-96. ISBN 978-3-662-45916-4. E-ISBN 978-3-662-45917-1. (doi:https://doi.org/10.1007/978-3-662-45917-1_6) (Full text available)
[img]
Preview

Cohen, Liron and Rowe, Reuben N. S. (2018) Infinitary and Cyclic Proof Systems for Transitive Closure Logic. Technical report. University of Kent (Submitted) (Full text available)
[img]
Preview

D

Delaney, Aidan and Stapleton, Gem and Taylor, John and Thompson, Simon (2014) A normal form for spider diagrams of order. Journal of Visual Languages and Computing, 25 (6). pp. 935-944. ISSN 1045-926X. (doi:https://doi.org/10.1016/j.jvlc.2014.10.029) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Dominic, Orchard and Mistral, Contrastin and Matthew, Danish and Andrew, Rice (2017) Verifying Spatial Properties of Array Computations. Journal of Proceedings of the ACM, 1 (OOPSLA). p. 75. ISSN 2475-1421. E-ISSN 2475-1421. (doi:https://doi.org/10.1145/3133899) (Full text available)
[img]
Preview

F

Fischer, Michael D. (1994) Applications in Computing for Social Anthropologists. ASA Research Methods . Routledge, London, 248 pp. ISBN 978-0-203-45108-3. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Fischer, Michael D. (2006) Cultural Agents: A Community of Minds. In: Engineering Societies in the Agents World VI. Springer, pp. 259-274. (doi:https://doi.org/10.1007/11759683_16) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Férée, Hugo (2017) Game semantics approach to higher-order complexity. Journal of Computer and System Sciences, 87 . pp. 1-15. ISSN 0022-0000. (doi:https://doi.org/10.1016/j.jcss.2017.02.003) (Full text available)
[img]
Preview

G

Gaboardi, Marco and Katsumata, Shin-ya and Orchard, Dominic A. and Breuvart, Flavien and Uustalu, Tarmo (2016) Combining Effects and Coeffects via Grading. Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, . pp. 476-489. ISSN 0362-1340. E-ISSN 1558-1160. (doi:https://doi.org/10.1145/2951913.2951939) (Full text available)
[img]
Preview

Grigore, Radu and Tzevelekos, Nikos (2016) History-Register Automata. Logical Methods in Computer Science, 12 (1). pp. 1-32. ISSN 1860-5974. (Full text available)
[img]
Preview

J

Jordanous, Anna (2015) Review: The POINT of creative collaborations between composers and computers. Review of: Patterns of intuition: Musical Creativity in the Light of Algorithmic Composition (Springer, 2015 ) by UNSPECIFIED. ACM Computing Reviews, (184827). p. 1. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

K

Kahrs, Stefan (2013) Infinitary rewriting: closure operators, equivalences and models. Acta Informatica, 50 (2). pp. 123-156. ISSN 0001-5903. (doi:https://doi.org/10.1007/s00236-012-0174-y) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

L

Landes, Jürgen and Williamson, Jon (2013) Objective Bayesianism and the maximum entropy principle. Entropy, 15 (9). pp. 3528-3591. ISSN 1099-4300. (doi:https://doi.org/10.3390/e15093528) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

M

Møgelberg, Rasmus and Paviotti, Marco (2018) Denotational semantics of recursive types in synthetic guarded domain theory. Mathematical Structures in Computer Science, . ISSN 0960-1295. (doi:https://doi.org/10.1017/S0960129518000087) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)
[img]

O

Orchard, Dominic A. (2018) Complexity bounds for container functors and comonads. Information and Computation, . ISSN 0890-5401. (doi:https://doi.org/10.1016/j.ic.2018.05.008) (Full text available)
[img]
Preview
[img]
Preview

Orchard, Dominic A. and Yoshida, Nobuko (2016) Effects as Sessions, Sessions as Effects. Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2016, . pp. 568-581. (doi:https://doi.org/10.1145/2837614.2837634) (Full text available)
[img]
Preview

P

Pei, He and Lishan, Kang and Johnson, Colin G. and Shi, Ying (2011) Hoare Logic-based Genetic Programming. Science China Information Sciences, 54 (3). pp. 623-637. ISSN 1674-733X. E-ISSN 1869-1919. (doi:https://doi.org/10.1007/s11432-011-4200-4) (Full text available)
[img]
Preview

Petricek, Tomas and Orchard, Dominic A. and Mycroft, Alan (2014) Coeffects: A calculus of context-dependent computation. Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 49 (9). pp. 123-135. ISSN 0362-1340. E-ISSN 1558-1160. (doi:https://doi.org/10.1145/2692915.2628160) (Full text available)
[img]
Preview

Petricek, Tomas and Orchard, Dominic A. and Mycroft, Alan (2013) Coeffects: Unified static analysis of context-dependence. In: Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, July 8-12, 2013, Riga, Latvia. (doi:https://doi.org/10.1007/978-3-642-39212-2_35) (Full text available)
[img]
Preview

R

Rowe, Reuben N.S. and van Bakel, S.J. (2014) Semantic Types and Approximation for Featherweight Java. Theoretical Computer Science, 517 . pp. 34-74. ISSN 0304-3975. (doi:https://doi.org/10.1016/j.tcs.2013.08.017) (Full text available)
[img]
Preview

Rowe, Reuben and Van Bakel, Steffen (2011) Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming. In: Typed Lambda Calculi and Applications. Springer pp. 229-244. ISBN 978-3-642-21690-9. (doi:https://doi.org/10.1007/978-3-642-21691-6_19) (Full text available)
[img]
Preview

S

Smith, Connor and Kahrs, Stefan (2016) Non-omega-overlapping TRSs are UN. In: Formal Structures for Computation and Deduction, 22-26 Jun 2016, Porto, Portugal. (doi:https://doi.org/10.4230/LIPIcs.FSCD.2016.22) (Full text available)
[img]
Preview

Stapleton, Gem and Howse, John and Thompson, Simon and Taylor, John and Chapman, Peter (2013) On the Completeness of Spider Diagrams Augmented with Constants. In: Moktefi, Amirouche and Shin, Sun-Joo, eds. Visual Reasoning with Diagrams. Studies in Universal Logic . Birkhauser, pp. 101-133. ISBN 978-3-0348-0599-5. E-ISBN 978-3-0348-0600-8. (doi:https://doi.org/10.1007/978-3-0348-0600-8_7) (Full text available)
[img]

Su, Li and Gomez, Rodolfo and Bowman, Howard (2014) Analysing neurobiological models using communicating automata. Formal Aspects of Computing, 26 (6). pp. 1169-1204. ISSN 0934-5043. (doi:https://doi.org/10.1007/s00165-014-0294-y) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)
[img]

T

Thompson, Simon and Delaney, Aidan and Stapleton, Gem and Taylor, John (2014) A Normal Form for Spider Diagrams of Order. Journal of Visual Languages & Computing, . (Full text available)
[img]
Preview

W

Wheeler, Gregory and Williamson, Jon (2011) Evidential Probability and Objective Bayesian Epistemology. In: Bandyopadhyay, Prasanta S. and Forster, Malcolm R., eds. Philosophy of statistics. Handbook of the Philosophy of Science, 7 . Elsevier Science & Technology/ North Holland, Oxford, pp. 307-331. ISBN 978-0-444-51862-0. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

Windsteiger, Wolfgang and Buchberger, Bruno and Rosenkranz, Markus (2006) Theorema. In: Wiedijk, Freek, ed. The Seventeen Provers of the World. Lecture Notes in Artificial Intelligence, 3600 . Springer, pp. 96-107. ISBN 978-3-540-30704-4. (doi:https://doi.org/10.1007/11542384_1) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

This list was generated on Fri Jan 18 00:00:48 2019 GMT.
University of Kent | About this repository | Feedback | Latest additions