Aleksy Schubert | University of Wafsaw (original) (raw)

Uploads

Papers by Aleksy Schubert

Research paper thumbnail of Technical Aspects of Class Specification in Java Byte Code

Research paper thumbnail of A Note on Observational Equivalence in the Simply Typed lambda-calculus

Higher-order unification is a problem to solve equations in the λ-calculus with simple types. The... more Higher-order unification is a problem to solve equations in the λ-calculus with simple types. The higher-order matching problem is a special kind of higher-order unification. This consists in solving equations with unknowns only on one side. This additional constraint is real simplification ...

Research paper thumbnail of Immutable objects in Java

Phys Chem Chem Phys, 2006

Research paper thumbnail of Rigorous specifications of the SSH Transport Layer

Abstract. This document presents (semi-) formal specifications of the security protocol SSH, more... more Abstract. This document presents (semi-) formal specifications of the security protocol SSH, more specifically the transport layer protocol, and describe a source code review of OpenSSH, the leading implementation of SSH, using these specifications. Our ...

Research paper thumbnail of BML and Related Tools

Formal Methods For Components and Objects, 2008

The Bytecode Modeling Language (BML) is a specification language for Java bytecode, that provides... more The Bytecode Modeling Language (BML) is a specification language for Java bytecode, that provides a high level of abstraction, while not restricting the format of the bytecode. Notably, BML specifications can be stored in class files, so that they can be shipped together with ...

Research paper thumbnail of Minik: A Tool for Maintaining Proper Java Code Structure

Ifip Tc2 Publications, 2006

Maintaining discipline of code in an evolving software project is known to be difficult. We prese... more Maintaining discipline of code in an evolving software project is known to be difficult. We present Minik, an automatic tool written in Java and for Java, that assists technical managers to enforce high and medium level design decisions on programmers. The tool supports hierarchical encapsulation of software components and helps to maintain order in dependencies between parts of the project’s

Research paper thumbnail of Lucretia - a type system for objects in languages with reflection

Object-oriented scripting languages such as JavaScript or Python gain in popularity due to their ... more Object-oriented scripting languages such as JavaScript or Python gain in popularity due to their flexibility. Still, the growing code bases written in the languages call for methods that make possible to automatically control the properties of the programs that ensure their stability in the running time. We propose a type system, called Lucretia, that makes possible to control the object structure of languages with reflection. Subject reduction and soundness of the type system with respect to the semantics of the language is proved.

Research paper thumbnail of A Self-dependency Constraint in the Simply Typed Lambda Calculus

Lecture Notes in Computer Science, 2005

Research paper thumbnail of Java Virtual Machine restrictions for the mobile platform

CLDC is defined as a Java 2 Micro Edition (J2ME) configuration. This has certain important implic... more CLDC is defined as a Java 2 Micro Edition (J2ME) configuration. This has certain important implications for the CLDC Specification. In particular this specification is the lowest common denominator of Java technology and the features included in the configuration must be applicable to ...

Research paper thumbnail of Security protocols from the software verification perspective

Research paper thumbnail of A Note on Observational Equivalence in the Simply Typed λ-calculus

Higher-order unification is a problem to solve equations in the λ-calculus with simple types. The... more Higher-order unification is a problem to solve equations in the λ-calculus with simple types. The higher-order matching problem is a special kind of higher-order unification. This consists in solving equations with unknowns only on one side. This additional constraint is real simplification ...

Research paper thumbnail of Supplementing Java Bytecode with Specifications

Research paper thumbnail of The Role of Polymorphism in the Characterisation of Complexity by Soft Types

Lecture Notes in Computer Science, 2011

Soft type assignment systems STA, STA+, and STA B characterise by means of reduction of terms the... more Soft type assignment systems STA, STA+, and STA B characterise by means of reduction of terms the computation in complexity classes PTIME, NP, and PSPACE, respectively. All these systems are inspired by linear logic and include polymorphism similar to the one of ...

Research paper thumbnail of On the Mints Hierarchy in First-Order Intuitionistic Logic

Lecture Notes in Computer Science, 2015

Research paper thumbnail of Minik: A Tool for Maintaining Proper Java Code Structure

IFIP International Federation for Information Processing, 2006

Maintaining discipline of code in an evolving software project is known to be difficult. We prese... more Maintaining discipline of code in an evolving software project is known to be difficult. We present Minik, an automatic tool written in Java and for Java, that assists technical managers to enforce high and medium level design decisions on programmers. The tool supports ...

Research paper thumbnail of Lucretia -intersection type polymorphism for scripting languages

Electronic Proceedings in Theoretical Computer Science, 2015

Research paper thumbnail of Positive Logic Is 2-Exptime Hard

Research paper thumbnail of CoJaq: a hierarchical view on the Java bytecode formalised in Coq

Research paper thumbnail of On the Complexity of Negative Quantification

Research paper thumbnail of On multiply-exponential write-once Turing machines

Research paper thumbnail of Technical Aspects of Class Specification in Java Byte Code

Research paper thumbnail of A Note on Observational Equivalence in the Simply Typed lambda-calculus

Higher-order unification is a problem to solve equations in the λ-calculus with simple types. The... more Higher-order unification is a problem to solve equations in the λ-calculus with simple types. The higher-order matching problem is a special kind of higher-order unification. This consists in solving equations with unknowns only on one side. This additional constraint is real simplification ...

Research paper thumbnail of Immutable objects in Java

Phys Chem Chem Phys, 2006

Research paper thumbnail of Rigorous specifications of the SSH Transport Layer

Abstract. This document presents (semi-) formal specifications of the security protocol SSH, more... more Abstract. This document presents (semi-) formal specifications of the security protocol SSH, more specifically the transport layer protocol, and describe a source code review of OpenSSH, the leading implementation of SSH, using these specifications. Our ...

Research paper thumbnail of BML and Related Tools

Formal Methods For Components and Objects, 2008

The Bytecode Modeling Language (BML) is a specification language for Java bytecode, that provides... more The Bytecode Modeling Language (BML) is a specification language for Java bytecode, that provides a high level of abstraction, while not restricting the format of the bytecode. Notably, BML specifications can be stored in class files, so that they can be shipped together with ...

Research paper thumbnail of Minik: A Tool for Maintaining Proper Java Code Structure

Ifip Tc2 Publications, 2006

Maintaining discipline of code in an evolving software project is known to be difficult. We prese... more Maintaining discipline of code in an evolving software project is known to be difficult. We present Minik, an automatic tool written in Java and for Java, that assists technical managers to enforce high and medium level design decisions on programmers. The tool supports hierarchical encapsulation of software components and helps to maintain order in dependencies between parts of the project’s

Research paper thumbnail of Lucretia - a type system for objects in languages with reflection

Object-oriented scripting languages such as JavaScript or Python gain in popularity due to their ... more Object-oriented scripting languages such as JavaScript or Python gain in popularity due to their flexibility. Still, the growing code bases written in the languages call for methods that make possible to automatically control the properties of the programs that ensure their stability in the running time. We propose a type system, called Lucretia, that makes possible to control the object structure of languages with reflection. Subject reduction and soundness of the type system with respect to the semantics of the language is proved.

Research paper thumbnail of A Self-dependency Constraint in the Simply Typed Lambda Calculus

Lecture Notes in Computer Science, 2005

Research paper thumbnail of Java Virtual Machine restrictions for the mobile platform

CLDC is defined as a Java 2 Micro Edition (J2ME) configuration. This has certain important implic... more CLDC is defined as a Java 2 Micro Edition (J2ME) configuration. This has certain important implications for the CLDC Specification. In particular this specification is the lowest common denominator of Java technology and the features included in the configuration must be applicable to ...

Research paper thumbnail of Security protocols from the software verification perspective

Research paper thumbnail of A Note on Observational Equivalence in the Simply Typed λ-calculus

Higher-order unification is a problem to solve equations in the λ-calculus with simple types. The... more Higher-order unification is a problem to solve equations in the λ-calculus with simple types. The higher-order matching problem is a special kind of higher-order unification. This consists in solving equations with unknowns only on one side. This additional constraint is real simplification ...

Research paper thumbnail of Supplementing Java Bytecode with Specifications

Research paper thumbnail of The Role of Polymorphism in the Characterisation of Complexity by Soft Types

Lecture Notes in Computer Science, 2011

Soft type assignment systems STA, STA+, and STA B characterise by means of reduction of terms the... more Soft type assignment systems STA, STA+, and STA B characterise by means of reduction of terms the computation in complexity classes PTIME, NP, and PSPACE, respectively. All these systems are inspired by linear logic and include polymorphism similar to the one of ...

Research paper thumbnail of On the Mints Hierarchy in First-Order Intuitionistic Logic

Lecture Notes in Computer Science, 2015

Research paper thumbnail of Minik: A Tool for Maintaining Proper Java Code Structure

IFIP International Federation for Information Processing, 2006

Maintaining discipline of code in an evolving software project is known to be difficult. We prese... more Maintaining discipline of code in an evolving software project is known to be difficult. We present Minik, an automatic tool written in Java and for Java, that assists technical managers to enforce high and medium level design decisions on programmers. The tool supports ...

Research paper thumbnail of Lucretia -intersection type polymorphism for scripting languages

Electronic Proceedings in Theoretical Computer Science, 2015

Research paper thumbnail of Positive Logic Is 2-Exptime Hard

Research paper thumbnail of CoJaq: a hierarchical view on the Java bytecode formalised in Coq

Research paper thumbnail of On the Complexity of Negative Quantification

Research paper thumbnail of On multiply-exponential write-once Turing machines

Research paper thumbnail of Automata Theoretic Account of Proof Search

Techniques from automata theory are developed that handle search for inhabitants in the simply ty... more Techniques from automata theory are developed that handle search for inhabitants in the simply typed lambda calculus. The resulting method for inhabitant search, which can be viewed as proof search by the Curry-Howard isomorphism, is proven to be adequate by a reduction of the inhabitant existence problem to the emptiness problem for appropriately defined automata. To strengthen the claim, it is demonstrated that the latter has the same complexity as the former. We also discuss the basic closure properties of the automata.