Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego
Publikacje
Aleksy Schubert
2018
- Patryk Czarnik, Jacek Chrząszcz i Aleksy Andrzej Schubert, A Java Bytecode Formalisation, w: Verified Software. Theories, Tools, and Experiments - 10th International Conference, VSTTE 2018, Oxford, UK, July 18-19, 2018, Revised Selected Papers, Springer, 2018.zobacz w PBN
- Wojciech Plandowski i Aleksy Andrzej Schubert, On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note), Theoretical Computer Science 2018.zobacz w PBN
- Aleksy Andrzej Schubert i Paweł Urzyczyn, Answer set programming in intuitionistic logic, Indagationes Mathematicae-new Series 29 2018, s. 276–292.zobacz w PBN
- Aleksy Andrzej Schubert i Paweł Urzyczyn, First-order Answer Set Programming as Constructive Proof Search, Theory And Practice Of Logic Programming 18 (3-4) 2018, s. 673–690.zobacz w PBN
2017
- Aleksy Andrzej Schubert, Jacek Sroka i Jerzy Paweł Tyszkiewicz, Systematic Programming in a Spreadsheet, w: IS-EUD 2017 6th international symposium on end-user development, Eindhoven University of Technology, Eindhoven 2017, s. 10–17.zobacz w PBN
- Maciej Piotr Zielenkiewicz i Aleksy Andrzej Schubert, Automata Theory Approach to Predicate Intuitionistic Logic, w: Logic-Based Program Synthesis and Transformation - 26th International Symposium, LOPSTR 2016, Edinburgh, UK, September 6-8, 2016, Revised Selected Papers, Springer, 2017, s. 345–360.zobacz w PBN
- Jacek Chrząszcz i Aleksy Andrzej Schubert, Function definitions for compound values in object-oriented languages, w: Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09 - 11, 2017, 2017, s. 61–72.zobacz w PBN
2016
- Marcin Benke, Daria Monika Walukiewicz-Chrząszcz i Aleksy Andrzej Schubert, Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic, w: 1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, June 22-26, 2016, Porto, Portugal, Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, Niemcy 2016, s. 12:1–12:16.zobacz w PBN
- Aleksy Andrzej Schubert, Paweł Urzyczyn i Daria Monika Walukiewicz-Chrząszcz, How Hard Is Positive Quantification?, Acm Transactions On Computational Logic 17 (4) 2016, s. 30.zobacz w PBN
- Jacek Chrząszcz i Aleksy Andrzej Schubert, The role of polymorphism in the characterisation of complexity by soft types, Information And Computation 248 2016, s. 130–149.zobacz w PBN
- Aleksy Andrzej Schubert, Paweł Urzyczyn i Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, Logical Methods In Computer Science 12 (4) 2016, s. 1–25.zobacz w PBN
- Karol Pąk i Aleksy Andrzej Schubert, The impact of proof steps sequence on proof readability - experimental setting, w: Joint Proceedings of the FM4M, MathUI, and ThEdu Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2016 co-located with the 9th Conference on Intelligent Computer Mathematics (CICM 2016), Bialystok, Poland, July 25-29, 2016., 2016, s. 172–186.zobacz w PBN
2015
- Maciej Zielenkiewicz, Jacek Chrząszcz i Aleksy Schubert, Java Loops Are Mainly Polynomial, w: SOFSEM 2015: Theory and Practice of Computer Science, 2015, s. 603–614.zobacz w PBN
- Aleksy Andrzej Schubert, Paweł Urzyczyn i Konrad Zdanowski, On the Mints Hierarchy in First-Order Intuitionistic Logic, w: Foundations of Software Science and Computation Structures 18th International Conference, FOSSACS 2015, Springer, 2015, s. 451–465.zobacz w PBN
- Aleksy Andrzej Schubert, Paweł Urzyczyn i Daria Monika Walukiewicz-Chrząszcz, Restricted Positive Quantification Is Not Elementary, w: 20th International Conference on Types for Proofs and Programs, TYPES 2014, May 12-15, 2014, Paris, France, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Niemcy 2015, s. 251–273.zobacz w PBN
- Marcin Benke, Viviana Bono i Aleksy Andrzej Schubert, Lucretia - intersection type polymorphism for scripting languages, Electronic Proceedings In Theoretical Computer Science 177 2015, s. 65–78.zobacz w PBN
- Erik Poll, Joeri de Ruiter i Aleksy Andrzej Schubert, Protocol State Machines and Session Languages: Specification, implementation, and Security Flaws, w: 2015 IEEE Symposium on Security and Privacy Workshops, SPW 2015, San Jose, CA, USA, May 21-22, 2015, IEEE, 2015, s. 125–133.zobacz w PBN
- Aleksy Andrzej Schubert, Wil Dekkers i Hendrik Pieter Barendregt, Automata Theoretic Account of Proof Search, w: 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Dagstuhl, Niemcy 2015, s. 128–143.zobacz w PBN
2014
- Aleksy Andrzej Schubert i Ken-etsu Fujita, A note on subject reduction in (→, ∃)-curry with respect to complete developments, Information Processing Letters 114 (1-2) 2014.zobacz w PBN
- Ken-etsu Fujita i Aleksy Andrzej Schubert, Existential type systems between Church and Curry style (type-free style), Theoretical Computer Science 549 2014, s. 17–35.zobacz w PBN
- Tadeusz Sznuk i Aleksy Andrzej Schubert, Tool Support for Teaching Hoare Logic, w: Software Engineering and Formal Methods - 12th International Conference, SEFM 2014, Grenoble, France, September 1-5, 2014. Proceedings, Springer, 2014, s. 332–346.zobacz w PBN
2012
- Jacek Ludwik Chrząszcz, Patryk Czarnik, Aleksy Andrzej Schubert i Andrzej Tarlecki, Testing of Evolving Protocols, w: ICST, 2012, s. 901–906.zobacz w PBN
- Ken-etsu Fujita i Aleksy Schubert, The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types, Information And Computation 218 2012, s. 69–87.zobacz w PBN
- Jacek Chrząszcz i Aleksy Schubert, ML with PTIME complexity guarantees, w: CSL, 2012.zobacz w PBN
2010
- Ken-etsu Fujita i Aleksy Schubert, The Undecidability of Type Related Problems in Type-free Style System F, w: RTA, 2010.zobacz w PBN
- Jędrzej Fulara, Konrad Durnoga, Krzysztof Jakubczyk i Aleksy Schubert, Relational Abstract Domain of Weighted Hexagons, Electronic Notes In Theoretical Computer Science 267 (1) 2010, s. 59–72.zobacz w PBN
- Jacek Chrząszcz, Patryk Czarnik i Aleksy Schubert, A dozen instructions make Java bytecode, w: Bytecode, 2010.zobacz w PBN
2009
- Aleksy Schubert, The Existential Fragment of the One-Step Parallel Rewriting Theory, Lecture Notes In Computer Science 5595 2009, s. 78–92.zobacz w PBN
- Ken-etsu Fujita i Aleksy Schubert, Existential Type Systems with No Types in Terms, Lecture Notes In Computer Science 5608 2009, s. 112–126.zobacz w PBN
- Aleksy Schubert i Daria Walukiewicz-Chrząszcz, The Non-Interference Protection in BML, Electronic Notes In Theoretical Computer Science 253 (5) 2009, s. 113–127.zobacz w PBN
- Aleksy Schubert, Jacek Chrząszcz i Marieke Huisman, BML and Related Tools, Lecture Notes In Computer Science 5751 2009, s. 278–297.zobacz w PBN
2008
- Aleksy Schubert, On the building of affine retractions, Mathematical Structures In Computer Science 18 (4) 2008, s. 753–793.zobacz w PBN
- Patryk Czarnik i Aleksy Schubert, Extending Operational Semantics of the Java Bytecode, w: Trustworthy Global Computing, 2008, s. 57–72.zobacz w PBN
- Aleksy Schubert, Krzysztof Jakubczyk i Jędrzej Fulara, Supplementing Java Bytecode with Specifications, w: Software Engineering Techniques in Progress, Oficyna Wydawnicza Politechniki Wrocławskiej, Wrocław 2008.zobacz w PBN
2006
- Jacek Chrząszcz i Aleksy Schubert, ESC/Java2 as a tool to ensure security in the source code of Java applications, w: Proceedings of SET'2006, Springer, New York 2006.zobacz w PBN
- Jacek Chrząszcz, Tomasz Stachowicz, Andrzej Gąsienica-Samek i Aleksy Schubert, Minik: A tool for maintaining proper Java code structure, w: Proceedings of SET'2006, Springer, New York 2006.zobacz w PBN
- Maciej Cielecki, Jędrzej Fulara, Krzysztof Jakubczyk, Lukasz Jancewicz, Jacek Chrząszcz i Aleksy Schubert, Propagation of JML non-null annotations in Java programs, w: Proceedings of PPPJ'2006, Mannheim University Press, Mannheim 2006.zobacz w PBN
1998
- Aleksy Schubert, Second-Order Unification and Type Inference for Church-Style Polymorphism, w: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '98), 1998, s. 279–288.zobacz w PBN
1997
- Aleksy Schubert, Linear Interpolation for the Higher-Order Matching Problem, w: TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings, 1997, s. 441–452.zobacz w PBN
Nie jesteś zalogowany | zaloguj się
