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

Library of Congress Subject Areas (48201)
- Q Science (13765)
  - QA Mathematics (inc Computing science) (5331)
    - QA 9 Formal systems, logics (46)

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, Cheval, Vincent, Delaune, Stéphanie (2015) Composing security protocols: from confidentiality to privacy. In: Focardi, Ricardo and Myers, Andrew, eds. Principles of Security and Trust. Lecture Notes in Computer Science . pp. 324-343. Springer Berlin Heidelberg, London, UK ISBN 978-3-662-46666-7. (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided)

Arapinis, Myrto, Cheval, Vincent, Delaune, Stéphanie (2012) Verifying Privacy-Type Properties in a Modular Way. In: 25th IEEE Computer Security Foundations Symposium (CSF'12), June 2012, Cambridge Massachusetts, USA. (doi:10.1109/CSF.2012.16)

Preview

Preview

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

Preview

B

Barrett, Edd, 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:10.1016/j.entcs.2010.09.003)

Preview

Besbeas, Panagiotis, 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: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, Demangeon, Romain (2013) Embedding Session Types in HML. In: Electronic Proceedings in Theoretical Computer Science. 137 (1). pp. 53-62. (doi:10.4204/EPTCS.137.5)

Preview

Bocchi, Laura and Yang, Weizhen and Yoshida, Nobuko (2014) Timed Multiparty Session Types. In: Baldan, Paolo and Gorla, Daniele, eds. CONCUR 2014 – Concurrency Theory 25th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 419-434. ISBN 978-3-662-44583-9. E-ISBN 978-3-662-44584-6. (doi:10.1007/978-3-662-44584-6_29)

Preview

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

Bowman, Howard, 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, Gorogiannis, Nikos, Kanovich, Max, Rowe, Reuben (2016) Model checking for symbolic-heap separation logic with inductive predicates. In: ACM. POPL '16 Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 51 (1). pp. 84-96. ACM, New York, NY, USA ISBN 978-1-4503-3549-2. (doi:10.1145/2914770.2837621)

Preview

Buchberger, Bruno, Craciun, Adrian, Jebelean, Tudor, Kovacs, Laura, Temur, Kutsia, Koji, Nakagawa, Piroi, Florina, Popov, Nikolaj, Robu, Judit, Rosenkranz, Markus, and others. (2006) Theorema: Towards computer-aided mathematical theory exploration. Journal of Applied Logic, 4 (4). pp. 470-504. ISSN 1570-8683. (doi: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: 20th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'14), Avril 2014, Grenoble, France. (doi:10.1007/978-3-642-54862-8_50)

Preview

Cheval, Vincent (2012) Automatic verification of cryptographic protocols: privacy-type properties. Doctor of Philosophy (PhD) thesis, ENS-Cachan.

Preview

Cheval, Vincent, Blanchet, Bruno (2013) Proving More Observational Equivalences with ProVerif. In: Basin, David and Mitchell, John C., eds. Second International Conference, POST 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Lecture Notes in Computer Science , 7796. pp. 226-246. Springer-Verlag Berlin, Roma, Italy ISBN 978-3-642-36829-5. E-ISBN 978-3-642-36830-1. (doi:10.1007/978-3-642-36830-1_12)

Preview

Preview

Cheval, Vincent, Comon-Lundh, Hubert, Delaune, Stéphanie (2010) Automating Security Analysis: Symbolic Equivalence of Constraint Systems. In: Giesl, Jürgen and Hähnle, Reiner, eds. Proceedings of the 5th International Joint Conference on Automated Reasoning (IJCAR'10). Lecture Notes in Computer Science , 6173. pp. 412-426. Springer-Verlag Berlin, Edinburgh, Scotland, UK ISBN 978-3-642-14202-4. E-ISBN 978-3-642-14203-1. (doi:10.1007/978-3-642-14203-1_35)

Preview

Cheval, Vincent, Comon-Lundh, Hubert, Delaune, Stéphanie (2011) Trace Equivalence Decision: Negative Tests and Non-determinism. In: 18th ACM Conference on Computer and Communications Security (CCS'11), October 2011, Chicago, Illinois, USA. (doi:10.1145/2046707.2046744)

Preview

Cheval, Vincent, Comon-Lundh, Hubert, 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:10.1016/j.ic.2017.05.004)

Preview

Cheval, Vincent, Cortier, Véronique (2015) Timing attacks: symbolic framework and proof techniques. In: Focardi, Riccardo and Myers, Andrew, eds. Lecture Notes in Computer Science. Principles of Security and Trust. . pp. 280-299. Springer Berlin Heidelberg, London, UK ISBN 978-3-662-46665-0. E-ISBN 978-3-662-46666-7. (doi:10.1007/978-3-662-46666-7_15)

Preview

Preview

Cheval, Vincent, Cortier, Véronique, Delaune, Stéphanie (2013) Deciding equivalence-based properties using constraint solving. Theoretical Computer Science, 492 . pp. 1-39. ISSN 0304-3975. (doi:10.1016/j.tcs.2013.04.016)

Preview

Cheval, Vincent, Cortier, Véronique, Plet, Antoine (2013) Lengths May Break Privacy – Or How to Check for Equivalences with Length. In: 25th International Conference on Computer Aided Verification (CAV'13), July 2013, St Petersburg, Russia. (doi:10.1007/978-3-642-39799-8_50)

Preview

Preview

Cheval, Vincent, Delaune, Stéphanie, Ryan, Mark (2014) Tests for Establishing Security Properties. In: 9th International Symposium on Trustworthy Global Computing (TGC'14), September 2014, Roma, Italy. (doi:10.1007/978-3-662-45917-1_6)

Preview

Cohen, Liron and Rowe, Reuben N. S. (2018) Infinitary and Cyclic Proof Systems for Transitive Closure Logic. Technical report. University of Kent (Submitted)

Preview

D

Delaney, Aidan, Stapleton, Gem, Taylor, John, 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: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, Mistral, Contrastin, Matthew, Danish, 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:10.1145/3133899)

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: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:10.1016/j.jcss.2017.02.003)

Preview

G

Gaboardi, Marco, Katsumata, Shin-ya, Orchard, Dominic A., Breuvart, Flavien, Uustalu, Tarmo (2016) Combining Effects and Coeffects via Grading. ACM SIGPLAN Notices, 51 (9). pp. 476-489. ISSN 0362-1340. E-ISSN 1558-1160. (doi:10.1145/2951913.2951939)

Preview

Grigore, Radu, Tzevelekos, Nikos (2016) History-Register Automata. Logical Methods in Computer Science, 12 (1). pp. 1-32. ISSN 1860-5974.

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: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, Williamson, Jon (2013) Objective Bayesianism and the maximum entropy principle. Entropy, 15 (9). pp. 3528-3591. ISSN 1099-4300. (doi: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, Paviotti, Marco (2018) Denotational semantics of recursive types in synthetic guarded domain theory. Mathematical Structures in Computer Science, . ISSN 0960-1295. (doi:10.1017/S0960129518000087)

Preview

O

Orchard, Dominic A. (2018) Complexity bounds for container functors and comonads. Information and Computation, . ISSN 0890-5401. (doi:10.1016/j.ic.2018.05.008)

Preview

Preview

Orchard, Dominic A., 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:10.1145/2837614.2837634)

Preview

P

Pei, He, Lishan, Kang, Johnson, Colin G., 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:10.1007/s11432-011-4200-4)

Preview

Petricek, Tomas, Orchard, Dominic A., 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:10.1145/2692915.2628160)

Preview

Petricek, Tomas, Orchard, Dominic A., Mycroft, Alan (2013) Coeffects: Unified static analysis of context-dependence. In: Lecture Notes in Computer Science. Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Proceedings, Part II. 7966. pp. 385-397. Springer-Verlag ISBN 978-3-642-39211-5. (doi:10.1007/978-3-642-39212-2_35)

Preview

R

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

Preview

Rowe, Reuben, Van Bakel, Steffen (2011) Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming. In: Lecture Notes in Computer Science. Typed Lambda Calculi and Applications. 6690. pp. 229-244. Springer ISBN 978-3-642-21690-9. (doi:10.1007/978-3-642-21691-6_19)

Preview

S

Smith, Connor, Kahrs, Stefan (2016) Non-omega-overlapping TRSs are UN. In: 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016). 2016 Formal Structures for Computation and Deduction. Leibniz International Proceedings in Informatics , 52. 22:1-22:17. Schloss Dagstuhl: Leibniz-Zentrum für Informatik, Porto, Portugal ISBN 978-3-95977-010-1. (doi:10.4230/LIPIcs.FSCD.2016.22)

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:10.1007/978-3-0348-0600-8_7)

Preview

Su, Li, Gomez, Rodolfo, Bowman, Howard (2014) Analysing neurobiological models using communicating automata. Formal Aspects of Computing, 26 (6). pp. 1169-1204. ISSN 0934-5043. (doi: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)

T

Thompson, Simon, Delaney, Aidan, Stapleton, Gem, Taylor, John (2014) A Normal Form for Spider Diagrams of Order. Journal of Visual Languages & Computing, .

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: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 Jul 19 22:19:06 2019 BST.