uk: Комп'ютерні науки

description: Out of the box, Plone's accessibility compliance is outstanding, especially Plone 5. However when building a real site things can go wrong - in the theme, in add-ons, and in customizations. In this talk I'll describe the things that went wrong on a highly customized academic Plone site, which were discovered by an institutional audit. I'll describe the types of errors that were found, how common they were and how difficult to fix. I'll provide guidance on what to look out for when developing a new site. And I'll give my wishlist of Plone accessibility improvements.

uk: вхід без авторизації

name: Accessibility in Plone: the Good, the Bad, and the Ugly


Alternative Approach to Plone Theming

Stefan Antonelli

type: Person

cs: Informatika

de: Informatik

fi: tietojenkäsittelytiede

uk: Комп'ютерні науки

en: Computer Science

fr: Informatique

da: Datalogi

es: Ciencias de la Computación

nl: Informatica

cs: Technické vědy

de: Ingenieurwissenschaften

fi: tekniikka

uk: Інженерія

en: Engineering Sciences

fr: Ingénierie

da: Ingeniørvidenskab

es: Ingeniería

nl: Engineering

description: There are lots of use cases where you want to keep Plone's default UI for anonymous and authenticated users. An alternative approach to Plone adds a custom mobile first theme based on Barceloneta without diving into Diazo rules and resource registry.

TIB AV-Portal

type: Service

type: WebContent

type: MediaObject

@language: en

cs: přihlášení není vyžadováno

de: keine Anmeldung erforderlich

uk: вхід без авторизації

en: no login required

nl: geen login vereist

Plone Foundation

type: Organization

cs: Video

de: Video

fi: Video

uk: Відео

en: Video

fr: Vidéo

da: Video

nl: Video

es: Video


uk: Комп'ютерні науки

description: Inspired by Plone since its beginning, Guillotina is now a production-ready stack allowing to build powerful applications. This talk will present the Onna platform (100% based on Guillotina), and it will give a focus on the frontend development specific practices we have defined to with a headless solution. It will also be an opportunity to introduce interesting libraries and tooling we are maintaining (mr-developer for frontend, traversal for frontend, Pastanaga UI, Guillotina admin UI, etc.), aiming to bring the Plone wisdom to the frontend world.

uk: вхід без авторизації

name: Building a business solution with Guillotina


uk: Комп'ютерні науки

description: In this talk, Érico will present a case of building an internal knowledge base portal about taxes using Plone, Oauth, plone.restapi and eea.facetednavigation.

uk: вхід без авторизації

name: Building a Tax Knowledge base with Plone


uk: Комп'ютерні науки

description: I introduce an original CI testing system based on zc.buildout that Nexedi uses everyday for running unit tests, functional tests and scalability tests. All code is published as free software.

uk: вхід без авторизації

name: Buildout Powered CI Testing System: nexedi


uk: Комп'ютерні науки

description: We have often wondered what we could do to motivate our dev teams and enhance team performance in our day-to-day business. Our solution: gamification. This lively case study demonstrates the introduction of gamification into our company and Scrum teams of Plone developers.

uk: вхід без авторизації

name: Game of Plones - Plone as a Gamification Platform


Guillotina - Internals and Future

uk: Комп'ютерні науки

description: Guillotina its mature and ready for production! The talks cover the main functionalities and coding examples to develop your applications on top of it: - Resources / Behaviors / Fields - Security Policy - Configuration strategy - Serialization and Deserialization - DB design One big question I will try to explain is the future ideas that we are working on.

uk: вхід без авторизації


Keynote: State of ZODB

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

description: We implemented a proof of concept package that allow management of scientific publications.

uk: вхід без авторизації

name: Organizing your Scientific (Mathematical) Publications


Plone-React

uk: Комп'ютерні науки

description: A tour of all the functionality of Plone-React and a walkthrough of the architecture and code.

uk: вхід без авторизації


Plone-React Extensibility story

uk: Комп'ютерні науки

description: How do you extend a Plone-React instance? How to use Create-Plone-React-App for create a basic boilerplate package, how to override components, reuse reducers and actions and create a new ones. How to integrate third party components. Demos and walkthroughs. The Pastanaga SVG icon system. How to add new icons.

uk: вхід без авторизації


Plone 5 Upgrades In Real Life

uk: Комп'ютерні науки

description: Although Plone 5 has been released for 2 years, there are still lots of Plone 4.3 sites in the wild. A number of Jazkarta's clients have large, heavily customized Plone 4.3 sites and we have been upgrading them one at a time. As we have gained experience, we have developed strategies for these upgrade projects that minimize risk and spread the work over several mini-projects. In this short talk I will share what we have learned.

uk: вхід без авторизації


Plone Loves Python 3

uk: Комп'ютерні науки

description: The upcoming version Plone 5.2 will support Plone 3, what does that mean for you? When should you start to use Python 3 in your new Plone projects? When and how should you migrate existing projects to Python 3? How do you migrate addons and your custom code? Drawing from the experience with the migration of Plone itself I'll answer all the questions that arise from moving to Python 3.

uk: вхід без авторизації


Portal Modelo - Plone for parliaments

uk: Комп'ютерні науки

description: This talk is about Plone customization for Parliaments. The participants will see an integration between Plone + EEA Daviz + Portal Modelo + Ombudsman Office System.

uk: вхід без авторизації


Privacy best practice and Plone

uk: Комп'ютерні науки

description: A big focus for web development this year was the EU's General Data Protection Regulations entering into force. This talk will counter some of the misinformation about GDPR and privacy-centred design in general, as well as introduce a Plone add-on to make it easy to deploy sites that respect users' privacy.

uk: вхід без авторизації


Pyramid Services

uk: Комп'ютерні науки

description: Pyramid includes zope.interface and its own component registry. pyramid-services is the pyramid add-on to use registry easily. I talk about to use pyramid-services and this internals.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Plone Intranet has evolved over the past years from a platform for sharing content to an engine that protects people from repetitive work strain. While earlier talks on Plone Intranet were technical and design oriented, this talk now describes applications of Plone Intranet from real customer projects. It shows examples where saving a bit of time for everybody highly exceeds saving a lot of time for a few and what a system must do to get really popular.

uk: вхід без авторизації

name: Digitize Processes - Plone Intranet in Real Life


uk: Комп'ютерні науки

description: How can we handle complex authorization? Yes, Pyramid has great security framework, and we can use ACLAuthorizationPolicy. Then, how can we use it with Django? I created django-keeper to do this. On this talk, you can learn what problem Django has, and how to solve it by using django-keeper. django-keeper can handle complex permission assignment. There is permission feature on Django, but I think it's not enough for most purposes.

uk: вхід без авторизації

name: Great authorization for Django, like Pyramid


Guillotina CMS - The missing link

uk: Комп'ютерні науки

description: With Guillotina Framework ready for production and the Plone React becoming ready, Guillotina CMS provides the missing link on the connection between both. The talk covers how to use and create a basic project with Guillotina CMS: - Basic types and Behaviors, - Workflow, - Vocabularies, - PubSub, - Login

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Real examples of building complex websites without having to teach buildout, packaging, ZCML, ZCA and other hard things. Will touch on how we do multi-tenanted Plone using docker and rancher.

uk: вхід без авторизації

name: How we reduced Plone's learning curve with DIY serverless


uk: Комп'ютерні науки

description: The talk will present the Elm language and ecosystem. Elm is a strongly typed, immutable, functional language that compiles to Javascript. It does compete with modern JS frameworks to build client-side UI.

uk: вхід без авторизації

name: elm: A delightful language for reliable webapps: Generate JavaScript with great performance and no runtime exceptions


Plone Conf 2018 - Keynote by Aida

uk: Комп'ютерні науки

@language: ja

uk: вхід без авторизації


uk: Комп'ютерні науки

description: This is a case study of a large scale software that has been in operation for over 10 years and is still expanding. The latest addition is coming from a big automotive OEM and completes the chain from risk identification to staff training. This project demonstrates that Plone projects are very well maintainable over time and can adapt to new challenges. As a result there is now a framework to assess thinks - not necessarily risks - and act upon them. Maintainability, flexibility and modern technology don't necessarily exclude each other.

uk: вхід без авторизації

name: Online interactive Risk Assessment - more safety, less paper


Pipenv: Python Dev Workflow for Humans

uk: Комп'ютерні науки

description: Pipenv is a tool that aims to bring the best of packaging worlds (bundler, composer, npm, cargo, yarn, etc.) to the Python world. At Niteo we’ve migrated all our Pyramid-based projects away from zc.buildout to pipenv and the results are good. In this talk, I’ll share the goods and the bads of the transition.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: The Talk include the idea to make Plone-react package as a dependency to other packages and make ( use ) a create-react-app like app generator to generate the example boilerplate( Pastanaga ) which fits with the package.

uk: вхід без авторизації

name: Volto as Library (create-volto-app Feature)


uk: Комп'ютерні науки

description: In this talk, we will present how we successfully delivered multiple client projects in 2018 with Plone and React.

uk: вхід без авторизації

name: Plone-React Case Studies: When Stability and Security meet Speed and a Modern User Interface


Plone, quo vadis?

uk: Комп'ютерні науки

description: Many developers have blinders when considering their technologies. We tend to fade out the sometimes hard-to-learn skills and hurdles in dealing with the system, and sometimes look contemptuously at other technologies that repeat the same mistakes that our community has already made. We rant about the hurdles we have with our own system, but forgets about the many smart elements that comes for free. This presentation is meant to be a self-critical analysis of our "Plone" system and the community behind it, and to provide a discussion stimulus for the future of Plone.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Q & A session.

uk: вхід без авторизації

name: Plone Community and Japanese Frontend Community Meetup


uk: Комп'ютерні науки

description: 2020 is coming fast, and the journey toward Python 3 compatibility is almost complete — for Plone core itself. But what will it take to migrate an actual Plone website? I’ll review the internal changes that have happened to make Plone run on Python 3, and offer advice on how to approach the upgrade for add-ons and Plone-based projects. Including: - What has changed in Zope 4, - Running Plone under WSGI, - How to migrate your ZODB, - Suggestions of areas that will need careful attention.

uk: вхід без авторизації

name: Plone + Python 3: How to make the switch


State of Plone performance

uk: Комп'ютерні науки

description: Web performance is an important part of user experience. In this talk we will address the questions of why and how web performance matters from a business perspective. What is the real-world difference if a webpage loads in 3 versus 6 seconds? We will have a look at the available data in public big data projects to understand the performance of the Plone ecosystem. We will answer questions like how much faster or slower Plone sites are compared to other content management systems. We will then have a look at possible bottlenecks and how to address performance issues on a project and community level.

uk: вхід без авторизації


Theming Plone-React

uk: Комп'ютерні науки

description: How theming is done in Plone-React using SemanticUI. Introduction and basic concepts of this CSS Framework, and how to effectively build a theme on Pastanaga UI (or build a completely new one from scratch. How to add new React components to the theme and apply the correct patterns. Apply a proven development workflow to build a theme using Create React App.

uk: вхід без авторизації


Visual Regression Testing

uk: Комп'ютерні науки

description: More than often it happens, that design changes of websites include unintended side-effects. Visual regression testing is one of few ways to get notified about those side-effects early on. I want to present our implementation of visual regression testing based on the RobotFramework and point out some challenges we had to face. With this approach we intend to test the university website of TU Dresden, which is a large-scaled Plone deployment.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: In this talk, I am going to demonstrate a suite of tools and techniques that simplify the process of moving from an idea to a deployed product. The presentation showcase how we at Alteroo, the only development shop in Jamaica that uses Plone, use our current stack to get things done quickly. Parts of the stack that I am going to demonstrate includes the following: - Roosite.launchkit for starting new projects. - Mosaic Styles and Tiles, - Auto-deployment of Plone Themes with rollback functionality powered by Gitlab CI/CD. - Predefined Diazo and XSLT rules for content and theme manipulation. - Faceted and filtered results using collective.filters, - Indexable JSON values by making DataGridField into metadata. The vision is to make it easier for future developers to start, build, update and deploy with little backend changes as possible while having the ability to do so if needed. Plone CLI: The new way of creating Plone extensions. The Plone CLI let's you create a Plone addon and add features like content_types, views, viewlets and portlets to it. It makes is easier and faster to get started and also gives you a good the structure of code and tests.

uk: вхід без авторизації

name: What are Jamaicans doing with Plone? Plone CLI


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Analysis of space-time satellite data for disease ecology applications with GRASS GIS and R stats


uk: Комп'ютерні науки

uk: вхід без авторизації

name: sfnetworks: Tidy Geospatial Networks in R


Spherical geometry

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Analyzing spatial point patterns with spatstat


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Design-based methods for assessing map accuracy


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Classifying remote sensing time series with SITS


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Area of applicability of spatial prediction models


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Geocomputation with R/ spatial segmentation


Geosimulation using fields and agents

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Analyzing massive amounts of EO data in the cloud with R, gdalcubes, and STAC


Visualisation of spatial data

uk: Комп'ютерні науки

uk: вхід без авторизації


Modelling Spatiotemporal dependence

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Analysing spatiotemporal disease/health data


Pastanaga UI: Resistance is Futile

uk: Комп'ютерні науки

description: Earlier this year, we presented to the Plone community in diverse forums the Pastanaga UI project. This aims to be a new generic proposal for building a powerful and modern UI for powering generic CMSs. Pastanaga UI is not only about how things look and how they feel but also about overall UX and interaction: a new guide that will provide common ground for creating elements through all views and forms, allowing a unified and coherent structure and how to create new components in an homogeneus way. Pastanaga also presents a new way to create and interact with your content via a brand new editor, simplified and ready for modern times. Do you want to see a sneak peek of Pastanaga UI and Pastanaga editor? Do you want to help make Pastanaga happen?

uk: вхід без авторизації


Doing the impossible

uk: Комп'ютерні науки

description: Zope and Plone are fantastic systems that provide a lot of features out of the box. A primary focus of Zope and Plone has always been about security and empowering of users, and one of the things that provides this is RestrictedPython. A lot of code in Zope and Plone has become legacy and remained unmaintained for several years, RestrictedPython was one of those core packages that got less attention and became the major blocker for the porting of Zope and Plone to Python 3. Many thought it would be impossible to port RestrictedPython to Python 3, but in May 2017 we released a version that is compatible with both Python 2.7 and Python 3.4-3.6 and even PyPy. Nothing is impossible within the Plone community! This talk will focus on RestrictedPython: • what it is, • how and who could use it, • what was the problem with porting to Python 3, • why things seem impossible and why that is almost always not true, • thoughts on Zope/Plone and other framework security

uk: вхід без авторизації


Modern Python testing

uk: Комп'ютерні науки

description: I will present modern approaches to testing Python applications, including a comparison of test frameworks, test invocation frameworks, and Continuous Integration services such as Travis-CI. I will cover tox, pytest, and ideas for better ways of testing and enforcing code conventions in Plone.

uk: вхід без авторизації


Intranets must simply be social

uk: Комп'ютерні науки

description: Intranets have always been the ultimate challenge for an organisation, be it from a technical point of view, from the information design, productivity wise or socially. People who love their intranet are scarce. This has to change, the focus must be on people, content and ease of use. Ploneintranet is an effort by 12 Plone companies from Europe and the US, addressing the issue that an intranet solution must be more than just the sum of its add-ons. The talk gives ° an overview on the background of PloneIntranet ° its philosophy ° where it heads to ° how to quickly set it up yourself ° and how to get involved.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: In a serverless world Firebase can fulfill a promise of providing your app with realtime notifications. Firebase can be a great shortcut when you want to have real time notifications between your client apps by leveraging the observable streams Firebase provides in your React components. After the talk building a real time notification system will be simpler to maintain and come with scalability built in. I will try to leverage the real-time Firebase database for building a subscriber component for my application so that I get notifications as they are available. 1. How would I normally do real time notifications: Using redis with PUB/SUB and websockets to subscribe to publish and consume data 2. What is Firebase: Firebase is a real time datbase that takes over some of the complexity of managing your data. It has many language wrappers and is very easy to use 3. Wrapping Firebase library in a react component: In order to preserve the one way directional flow in React you need to wrap your firebase library inside a component to take advantage of the lifecycle 4. How Firebase and React work with the Redux state management: Once the firebase library is wrapped you can map the properties and dispatch actions when new data is available via Redux 5. Putting it all together: This is a wrap up and lets you know how all the pieces fit together 6. Live Demo: We will have a component that does a very basic insert into a firebase bucket, and updates the firebase letting the other users know that new data is available, followed by a live demo of the app

uk: вхід без авторизації

name: Hacking real time messaging with Firebase


uk: Комп'ютерні науки

description: Plone ships with built-in batteries for building sophisticated content management solutions without writing a single line of new Python code. We present how to use these features to customize content types, workflows, permissions and user interface elements directly in your custom theme. We also show how to deploy all these new features instantly, without running buildout nor restarting instances.

uk: вхід без авторизації

name: Building instant features with advanced Plone themes


uk: Комп'ютерні науки

description: What did Meryl Streep, Henry Ford and Albert Einstein have in common? All of them suffered from different problems in their professional lives. This talk is not about development. Instead of code, this inspirational and motivational talk will turn the debugger on ourselves as humans to analyse the bugs most of us face in our day-to-day jobs as developers. Among other things, we will be talking about: Perfectionism, Imposter Syndrome, Burnout But these are not limited to developers and are applicable to much wider audience. It will be about psychology, neuroscience, work-life balance, work quality and… us.

uk: вхід без авторизації

name: debugger; For Developers: What did Meryl Streep, Henry Ford and Albert Einstein have in common?


New EEA Plone Adds ons

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

description: A group of social scientists at the University of California Berkeley received a large grant last year to develop tools for rigorous social science research, initially focused on collective identity formation. Jazkarta has been helping them develop Dallinger, a tool to automate experiments that use large numbers of subjects recruited on platforms like Mechanical Turk. They chose Jazkarta because of our web development and project management expertise, but also because of our familiarity with large, open source software projects - which is a goal for Dallinger. Join members ot the Jazkarta team (David Glick, Alec Mitchell, Matthew Wilkes, and me) to hear about how we've put the lessons of Plone to work setting up this new open source project. We'll leave plenty of time for Q&A and can also describe how the technology stack (Python, Redis, Web Sockets, Heroku, AWS/Mechanical Turk/boto, Flask, PostgreSQL/SQLAlchemy, Gunicorn, Pytest, gevent) has been working for us.

uk: вхід без авторизації

name: JAZKARTA - An Open Source platform for Social Science research


Solr and Plone: Search and beyond

uk: Комп'ютерні науки

description: Integration of Apache Solr into Plone is well-established for powering fast, scalable full-text search with highly relevant results. The many amazing features of Solr like faceting, hit highlighting and suggestions add real value for the user. Even when search is not explicitly the given task, Solr can be extremely helpful as a portal_catalog replacement to filter content for speeding up complex views and generating overview pages and navigation. In this talk I will relate my experiences and outline the ways in which we use Solr with Plone at Syslab.com. I will highlight the benefits of Solr as well as report some caveats and lessons learned over the years. Previous experience with Solr will help you get the most out of hearing this talk but is not a requirement.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: In the past few months I’ve been going through the latest updates in the Artificial Intelligence field. Turns out that the tooling has matured considerable and it is no longer required that one has a Ph D in math to use deep learning and similar techniques. Quite on the contrary! Any Python coder, with basic high school math can build and train highly accurate models for categorising images, translation machines, recommender systems and more. In this talk I’ll share my findings, point to good resources to look into and provide some ideas on how AI can be used in your Python projects.

uk: вхід без авторизації

name: State of the art image recognition in 7 lines of Python


uk: Комп'ютерні науки

description: The usage and the concept of the Plone add-on 'plone.jsonapi.routes' will be shown in the web browser to the audience. This will encompass basic content retrieval, as well as create/update/delete operations. Afterwards, a modern JavaScript web application that communicates with Plone over the JSON API will be demonstrated. A small excursion to the JavaScript developer console provides some deeper insights into the asynchronous data retrieval. Finally, ways to extend `plone.jsonapi.routes` will be discussed.

uk: вхід без авторизації

name: Using a Plone JSON API to interface modern Web Apps


uk: Комп'ютерні науки

description: We organized our first ever Plone development sprint in summer 2017 at University of Jyväskylä. I will discuss the importance of sprints to an open source community, how to organize a Plone sprint, what went well in our case and what could be improved in the future.

uk: вхід без авторизації

name: Organizing a Plone Sprint - Lessons Learned, case Midsummersprint 2017


uk: Комп'ютерні науки

description: At Technical University of Dresden we developed an open source chat package for Plone as part of our website infrastructure. It is used by multiple institutions of the university, for example our Central Student Information and Counselling Service, to enhance our service communication capabilities. Different chat sessions are scheduled for different topics depending on the target audience. They are moderated, can be public or private and support familiar moderation functionality. In this talk, we will introduce our use case, discuss the overall architecture and employed technologies (AJAX Requests, MySQL, Beaker, Robot Tests) and give a short demonstration of the final product.

uk: вхід без авторизації

name: TUD Chat: A moderated chat Add on for Plone


Our Castle's strength

uk: Комп'ютерні науки

description: Castle CMS is an enhanced distribution of Plone, released under GPL2, for large sites and security-conscious organizations. Castle CMS is created and maintained by Wildcard Corp., provider of cybersecurity and open source web site solutions. Find out about Castle CMS's content editing enhancements that make it easier to create and manage large amounts of content and its many integrated services for improved search, archiving, and collaboration. Learn about Castle CMS's upcoming features and release roadmap, and how Castle CMS is in turn affecting the Plone roadmap.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Timo will talk about how the Plone community faces the exciting challenge of keep up with new technologies and which efforts and projects are in the making to make it a reality.

uk: вхід без авторизації

name: Building bridges: The headless future of Plone


Modern frontend development with VueJS

uk: Комп'ютерні науки

description: Browsing Hacker News or the #javascript hash tag on Twitter may leave one with the impression that there are only two options to build a Single Page Application: Angular and React. Each with its own strengths and weaknesses, with its own vocal community and the tech giant behind it. Each portraying the other side as the Sith. Vue is the open source framework that brings a third alternative to the table, combining the strengths of both Angular and React while trying to weed out their weaknesses. The result is an easy to use, lightweight and versatile framework. In this talk we will explore Vue's architecture, see how components interact among themselves, have a look at the event model and in the end, how to wrap everything together in a SPA using Webpack.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: If we think of using Plone as a customer journey we can begin to break down the journey into key touch points. How can we improve each touch point so that they become more Useful, Usable and Delightful?

uk: вхід без авторизації

name: The Plone experience: Useful, Usable and Delightful


How to design a great API using Flask

uk: Комп'ютерні науки

description: Flask is a very light weight micro-framework for Python. Compared to other bulky frameworks, Flask is easier to get started and is often more open/modular, allowing developers to use their preferred packages and dependencies. For many teams, this flexible modularity comes at a cost, developers implement suboptimal patterns that prevent their apps/apis from fully scaling and creating tech-debt that lowers productivity. In this talk I'll cover an intro to the Flask framework, why it's a great option for some teams, and how it works. I'll share some real-world examples of best practices, common pitfalls (and how to avoid them), and design patterns that make APIs integrators love using and developers love building. Some specific topics I'll cover: Flask architecture, request lifecycles, security & auth packages, REST + CRUD API patterns, ORMs, separation of concerns, information hiding.

uk: вхід без авторизації


This is 2017, let's go frontend

uk: Комп'ютерні науки

description: In 2017, frontend development is everywhere, accomplishing great things and transforming the web. Still, many CMSes don't seem to embrace it totally. Plone offers nows an Angular SDK which brings all the power of Plone to frontend developers. This talk explains the Plone Angular SDK core principles, and details some real use cases.

uk: вхід без авторизації


The State of Plone and Pastanaga UI

uk: Комп'ютерні науки

description: The stories we tell, how they preserve our past and shape our future

uk: вхід без авторизації


Newsletter and mailing for Plone

uk: Комп'ютерні науки

description: We show how you can setup a newsletter solution based on Plone, using the Products.EasyNewsletter add-on, in its newest 3.x version. Starting with simple setups, we will show the flexibility of EasyNewsletter in terms of customizing and extending the standard behaviour. We will have a look into the future of EasyNewletter, including Dexterity support and a new editor UI for creating newsletters.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: An application’s performance significantly influences its acceptance and therefore also its commercial success. However, there is no simple adjustable screw for performance tuning in single-page applications: several influencing factors need to be considered. Angular addresses these aspects with its architecture and offers some possibilities to provide breathtaking performance. This session shows how to use these possibilities by means of a systematically optimized application. Attendees learn how to leverage Ahead-of-Time Compilation (AOT), Tree Shaking and Lazy Loading to dramatically improve application startup performance. The OnPush optimization strategy to speed up data binding performance in your solutions is also demonstrated. Service Worker for caching and instant loading is covered, as well as Server-Side Rendering to improve the perceived loading time.

uk: вхід без авторизації

name: The Fastest SPA in all Mexico: Angular Performance Tuning


uk: Комп'ютерні науки

description: Learn about the exciting new REST Resource API powered by Python's new asyncio library. In this talk you'll learn about some of the amazing things you can do with Guillotina and how you can leverage it to build your next JavaScript web application.

uk: вхід без авторизації

name: Guillotina: The asyncio REST resource API


uk: Комп'ютерні науки

description: One of the standout features of progressive web applications ("PWA") is their offline functionality. I'm going to elaborate on the use of service workers which made this feature possible, how editing and commenting offline have been handled, and how the download offline feature works to make the whole PWA available for offline reading. I will include a demo and discuss the features in detail. The app I've developed makes use of Plone as backend with Plone REST API.

uk: вхід без авторизації

name: Plone PWA: building an offline website with Ionic


An omnivore's perspective

uk: Комп'ютерні науки

description: In my 25 years of developing, designing, and maintaining websites both on a technical and content level for a wide range of organisations, I've used an even wider range of tools. And to this day, I use a good dozen different systems besides Plone. Some of these make me very happy, some drive me crazy. All of them have lessons to be learned. Especially when you don't just deliver websites, but also maintain them for a couple of years. An opinionated view on where we can learn, what we should stop doing, and how choices play out. Including but not limited to: • why WYSIWYG editing might have to go, in favor of simpler formats combined with integration, • simplicity and beauty deliver real value, in terms of training and maintenance costs, • "mobile first" has consequences. We should embrace it fully, • our core market is longer-term, higher volume content. Make that easier to maintain, find, present, repurpose, • smart integration beats own innovation, • oh heck, forms. We need to do better.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: A year ago our university started a massive website renewal process - upgrading from Plone 4 to Plone 5, designing a new theme and moving to a new organizational structure. In my presentation last year I tried to anticipate the challenges we would face and how Plone 5 could help us. Now it's time to look back (and forward) on how things went, where we are and what we could learn from the experience. This is about Plone 5, theming, Mosaic, agile, and people.

uk: вхід без авторизації

name: Beyond infinity with Plone 5, Are we there yet?


uk: Комп'ютерні науки

description: This talk will be a demonstration of the import-export addon for Plone developed during Google Summer of Code 2017. This will also cover the addon's architecture, and how it is tightly coupled with Plone REST API.

uk: вхід без авторизації

name: Developing the Plone content import export Add on


uk: Комп'ютерні науки

description: To provide high availability in distributed systems, object replicas allow concurrent updates. Although replicas eventually converge, they may diverge temporarily, for instance when the network fails. This makes it difficult for the developer to reason about the object’s properties, and in particular, to prove invariants over its state. For the subclass of state-based distributed systems, we propose a proof methodology for establishing that a given object maintains a given invariant, taking into account any concurrency control. Our approach allows reasoning about individual operations separately. We demonstrate that our rules are sound, and we illustrate their use with some representative examples. We automate the rule using Boogie, an SMT-based tool.

uk: вхід без авторизації

name: Proving the safety of highly-available distributed objects

name: European Joint Conferences on Theory and Practice of Software - ETAPS - e. V.


Runners in action

uk: Комп'ютерні науки

description: Runners of algebraic effects, also known as comodels, provide a mathematical model of resource management. We show that they also give rise to a programming concept that models top-level external resources, as well as allows programmers to modularly define their own intermediate "virtual machines". We capture the core ideas of programming with runners in an equational calculus λ-coop, which we equip with a sound and coherent denotational semantics that guarantees the linear use of resources and execution of finalisation code. We accompany λ-coop with examples of runners in action, provide a prototype language implementation in OCaml, as well as a Haskell library based on λ-coop.

uk: вхід без авторизації


keywords:
operational semantics
type soundness

uk: Комп'ютерні науки

description: We propose a general proof technique to show that a predicate is \emph{sound}, that is, prevents stuck computation, with respect to a big-step semantics. This result may look surprising, since in big-step semantics there is no difference between non-terminating and stuck computations, hence soundness cannot even be expressed. The key idea is to define constructions yielding an extended version of a given arbitrary big-step semantics, where the difference is made explicit. The extended semantics are exploited in the meta-theory, notably they are necessary to show that the proof technique works. However, they remain transparent when using the proof technique, since it consists in checking three conditions on the original rules only, as we illustrate by several examples.

uk: вхід без авторизації

name: Soundness conditions for big-step semantics


keywords:
separation logic
program synthesis

uk: Комп'ютерні науки

description: In program synthesis there is a well-known trade-off between concise and strong specifications: if a specification is too verbose, it might be harder to write than the program; if it is too weak, the synthesised program might not match the user's intent. In this work we explore the use of annotations for restricting memory access permissions in program synthesis, and show that they can make specifications much stronger while remaining surprisingly concise. Specifically, we enhance Synthetic Separation Logic (SSL), a framework for synthesis of heap-manipulating programs, with the logical mechanism of read-only borrows. We observe that this minimalistic and conservative SSL extension benefits the synthesis in several ways, making it more (a) expressive (stronger correctness guarantees are achieved with a modest annotation overhead), (b) ffective (it produces more concise and easier-to-read programs), (c) efficient (faster synthesis), and (d) robust (synthesis efficiency is less affected by the choice of the search heuristic). We explain the intuition and provide formal treatment for read-only borrows. We substantiate the claims (a){(d) by describing our quantitative evaluation of the borrowing-aware synthesis implementation on a series of standard benchmark specifications for various heap-manipulating programs.

uk: вхід без авторизації

name: Concise Read-Only Specifications for Better Synthesis of Programs with Pointers


keywords:
distributed systems
separation logic
program verification

uk: Комп'ютерні науки

description: Building network-connected programs and distributed systems is a powerful way to provide scalability and availability in a digital, always-connected era. However, with great power comes great complexity. Reasoning about distributed systems is well-known to be difficult. In this paper we present Aneris, a novel framework based on separation logic supporting modular, node-local reasoning about concurrent and distributed systems. The logic is higher-order, concurrent, with higher-order store and network sockets, and is fully mechanized in the Coq proof assistant. We use our framework to verify an implementation of a load balancer that uses multi-threading to distribute load amongst multiple servers and an implementation of the two-phase commit protocol with a replicated logging service as a client. The two examples certify that Aneris is well-suited for both horizontal and vertical modular reasoning.

uk: вхід без авторизації

name: Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems


keywords:
compiler correctness
secure compilation

uk: Комп'ютерні науки

uk: вхід без авторизації

name: Trace-Relating Compiler Correctness and Secure Compilation


uk: Комп'ютерні науки

description: A key open problem with multiparty session types (MPST) concerns their expressiveness: current MPST have inflexible choice, no existential quantification over participants, and limited parallel composition. This precludes many real protocols to be represented by MPST. To overcome these bottlenecks of MPST, we explore a new technique using weak bisimilarity between global types and endpoint types, which guarantees deadlock-freedom and absence of protocol violations. Based on a process algebraic framework, we present well-formed conditions for global types that guarantee weak bisimilarity between a global type and its endpoint types and prove their check is decidable. Our main practical result, obtained through benchmarks, is that our well-formedness conditions can be checked orders of magnitude faster than directly checking weak bisimilarity using a state-of-the-art model checker.

uk: вхід без авторизації

name: Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types


keywords:
Verification
Weak Consistency
Data Structures

uk: Комп'ютерні науки

description: Multithreaded programs generally leverage efficient and thread-safe concurrent objects like sets, key-value maps, and queues. While some concurrent-object operations are designed to behave atomically, each witnessing the atomic effects of predecessors in a linearization order, others forego such strong consistency to avoid complex control and synchronization bottlenecks. For example, contains (value) methods of key-value maps may iterate through key-value entries without blocking concurrent updates, to avoid unwanted performance bottlenecks, and consequently overlook the effects of some linearization-order predecessors. While such weakly-consistent operations may not be atomic, they still offer guarantees, e.g., only observing values that have been present.

uk: вхід без авторизації

name: Verifying Visibility-Based Weak Consistency


Mixed Sessions

keywords:
Type Systems
Session Types
Mixed Choice

uk: Комп'ютерні науки

description: Session types describe patterns of interaction on communicating channels. Traditional session types include a form of choice whereby servers offer a collection of options, of which each client picks exactly one. This sort of choice constitutes a particular case of separated choice: offering on one side, selecting on the other. We introduce mixed choices in the context of session types and argue that they increase the flexibility of program development at the same time that they reduce the number of synchronisation primitives to exactly one.

uk: вхід без авторизації


keywords: verification ownership CHC Rust

uk: Комп'ютерні науки

description: Reduction to the satisfiability problem for constrained Horn clauses (CHCs) is a widely studied approach to automated program verification. The current CHC-based methods for pointer-manipulating programs, however, are not very scalable. This paper proposes a novel translation of pointer-manipulating Rust programs into CHCs, which clears away pointers and memories by leveraging ownership. We formalize the translation for a simplified core of Rust and prove its correctness. We have implemented a prototype verifier for a subset of Rust and confirmed the effectiveness of our method.

uk: вхід без авторизації

name: RustHorn: CHC-based Verification for Rust Programs


keywords:
blockchain
smart contracts
solidity
ethereum
memory model
SMT

uk: Комп'ютерні науки

description: Solidity is the dominant programming language for Ethereum smart contracts. This paper presents a high-level formalization of the Solidity language with a focus on the memory model. The presented formalization covers all features of the language related to managing state and memory. In addition, the formalization we provide is effective: all but few features can be encoded in the quantifier-free fragment of standard SMT theories. This enables precise and efficient reasoning about the state of smart contracts written in Solidity. The formalization is implemented in the solc-verify verifier and we provide an extensive set of tests that covers the breadth of the required semantics. We also provide an evaluation on the test set that validates the semantics and shows the novelty of the approach compared to other Solidity-level contract analysis tools.

uk: вхід без авторизації

name: SMT-Friendly Formalization of the Solidity Memory Model


uk: Комп'ютерні науки

description: We develop a theory for two recently-proposed spreadsheet mechanisms: gridlets allow for abstraction and reuse in spreadsheets, and build on spilled arrays, where an array value spills out of one cell into nearby cells. We present the first formal calculus of spreadsheets with spilled arrays. Since spilled arrays may collide, the semantics of spilling is an iterative process to determine which arrays spill successfully and which do not. Our first theorem is that this process converges deterministically. To model gridlets, we propose the grid calculus, a higher-order extension of our calculus of spilled arrays with primitives to treat spreadsheets as values. We define a semantics of gridlets as formulas in the grid calculus. Our second theorem shows the correctness of a remarkably direct encoding of the Abadi and Cardelli object calculus into the grid calculus. This result is the first rigorous analogy between spreadsheets and objects; it substantiates the intuition that gridlets are an object-oriented counterpart to functional programming extensions to spreadsheets, such as sheet-defined functions.

uk: вхід без авторизації

name: Higher-Order Spreadsheets with Spilled Arrays


keywords:
Separation logic
Data Structures
Local reasoning
Graph algorithm
Flow framework

uk: Комп'ютерні науки

description: Separation logics are widely used for verifying programs that manipulate complex heap-based data structures. These logics build on so-called separation algebras, which allow expressing properties of heap regions such that modifications to a region do not invalidate properties stated about the remainder of the heap. This concept is key to enabling modular reasoning and also extends to concurrency. While heaps are naturally related to mathematical graphs, many ubiquitous graph properties are non-local in character, such as reachability between nodes,path lengths, acyclicity and other structural invariants, as well as data invariants which combine with these notions. Reasoning modularly about such graph properties remains notoriously difficult, since a local modification can have side-effects on a global property that cannot be easily confined to a small region.

uk: вхід без авторизації

name: Local Reasoning for Global Graph Properties


Plone as a Conference Management System

uk: Комп'ютерні науки

description: The Institute of Mathematics of The National University of Mexico organizes more than fifty meetings every year. We show how Plone can help organizers with the complex and boring work before and after the meetings.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: We present different tools that we use to get and analyse the productivity of faculty members using Plone.

uk: вхід без авторизації

name: A case study: Measuring Productivity in Education


uk: Комп'ютерні науки

description: Taking over maintenance of an existing open source application can be a scary prospect yet exciting and fun at the same time. I want to talk a little bit about how I ended up taking over maintenance of WebOb a Python HTTP request/response library that is used heavily by a huge variety of projects. An overview of what I will cover: ° About me ° Taking over maintenance for WebOb ° What WebOb is ° Who uses it, and why it is important ° Backwards compatibility…? ° Where do you go from here? ° Questions!!!

uk: вхід без авторизації

name: I broke what? Taking over maintenance on existing (well loved) projects.


uk: Комп'ютерні науки

description: Final remarks from the conference, wrap up, thank you's and announcement of the next Plone Conference 2018.

uk: вхід без авторизації

name: Plone Conf 2017 - Day 3: Lightning Talks


uk: Комп'ютерні науки

description: ReactJS is a front-end JavaScript library that is improving developer productivity, enabling easier development of scalable web-app front-ends, and is rapidly gaining marketplace adoption. In this talk I'll cover an intro to the ReactJS framework (including Redux), why it's powerful, and how it works. I'll share real-world examples of best practices, common pitfalls (and how to avoid them), and lean architecture patterns for creating robust applications that have high-performance and minimize tech-debt. Some specific topics I'll cover: JSX, virtual dom, React app architectures, component lifecycle and declarations, redux stores, reducer normalization, lean state & network lifecycle management.

uk: вхід без авторизації

name: Lean React - Patterns for High-Performance


uk: Комп'ютерні науки

description: Plone provides, out of the box, a very good and user-friendly SEO story but with the brave new world of single page applications and headless CMS this could change. In this talk I summarize the last 3 years of challenges and integrations needed to make a Headless Plone plus Angular application SEO friendly.

uk: вхід без авторизації

name: SEO challenges of a single page application using Plone


uk: Комп'ютерні науки

description: I will showcase the new pas.plugins.ldap LDAP integration for Plone and demonstrate what is needed to enable full user search through the user directory in the search control panel.

uk: вхід без авторизації

name: LDAP integration with user/group search: ( in pas.plugins.ldap)


uk: Комп'ютерні науки

description: TriMet runs the public transportation system for the city of Portland, Oregon, and the surrounding area. Over several years, TriMet's Plone-based intranet had accumulated lots of content, and the built-in search was not working very well anymore. For this case study, I will show how we solved the problem by focusing on content quality. Faceted search was helpful both in the push for content quality, as well as in the final search functionality. These ideas can help any Plone site, large or small, and should be considered for additional default features of Plone.

uk: вхід без авторизації

name: Have content quality, will search your Intranet


Zope on Python 3

uk: Комп'ютерні науки

description: Learn about the current status of Python 3 support for the Zope Toolkit, the Zope 2 application server and the Zope CMF and the road ahead. We'll also cover some related changes in the upcoming Zope 4 release.

uk: вхід без авторизації


Resource registry demystified

uk: Комп'ютерні науки

description: Plone's resource registry has changed significantly with Plone 5 and its adoption of RequireJS and Less.js. Now we can define JavaScript modules and their dependencies and use the power of LESS to better structure CSS code. We can even use Webpack to bundle our resources. This talk demystifies the resource registry by explaining its concepts, outlining workflows to accomplish common integration tasks and by giving tips and tricks to make it work for your project. I will also give an overview of Webpack-based resource bundling and discuss the future role of the resource registry.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: We will cover the main differences between sync and async servers. After that we'll go through a few example scenarios and benchmarks showing their strengths and weaknesses.

uk: вхід без авторизації

name: Skyscanner: Putting sync async servers to test


uk: Комп'ютерні науки

description: Developing and maintaining a content management system is a huge undertaking that constantly requires facing and overcoming new challenges. Are there any organizational characteristics that make it easier to accomplish such a monumental task? Which is better suited to the task, an open source community or a business organisation? Using the Plone community as an example, we will focus on two such characteristics: emotion and culture.

uk: вхід без авторизації

name: Keynote: Building a cathedral over decade


uk: Комп'ютерні науки

description: I'll show new bobtemplates.plone features such as subtemplates and the new, more modular structure. We also plan to create a plonecli (command line interface) which will use bobtemplates.plone but will be easier to use. It will make the process of learning to develop with Plone easier than ever before.

uk: вхід без авторизації

name: Subtemplates in bobtemplates plone or the way to plonecli


uk: Комп'ютерні науки

description: The web has gone from back-end server-rendered pages, to client-side SPAs,... and back again?? Let's take a deep dive into how server-rendered Angular applications work, and why you might want to consider using it for your next application. Learn how to bring great search engine optimization, social media previews, deep-linking, and improved perceived performance by rendering your application on the server.

uk: вхід без авторизації

name: Rendering JavaScript on the Server: Angular Universal


The future of Plone's Theme Editor

uk: Комп'ютерні науки

description: During summer 2017, I worked on improving the Plone Theme Editor through Google Summer of Code (GSoC). I will show the new features of and improvements in the Plone theme editor and will discuss its future. Part of the future vision is to showcase the newly implemented Rapido store where Rapido apps can be imported and installed from another theme and/or a remote repository of Rapido apps. I will also briefly share my experience with GSoC and the Plone Foundation during summer 2017.

uk: вхід без авторизації


Free Accessibility testing tools

uk: Комп'ютерні науки

description: There is a bunch of uncertainty on how to test for accessibility on your website. Many of the tools are quite expensive. JAWS is around $900 just for the home version. Thankfully there are some very good free tools around to help save the day. I will show you many of these and how to use them.

uk: вхід без авторизації


Getting paid without GetPaid

uk: Комп'ютерні науки

description: The venerable Plone add-on GetPaid's warranty was expiring, so in 2013 when we needed to build a payment component for The Mountaineers' website (mountaineers), we started with a simple Javascript shopping cart and a Stripe integration and went from there. Over time, more features were added and additional clients needed e-commerce, so we extracted the generic bits into a new add-on, jazkarta.shop. It allows for pluggable payment processors, shipping providers, and APIs for calculating state and local taxes, and it can now be used with Plone 4.3 and 5. We'll talk about why we went down this path and describe the use cases jazkarta.shop is designed to handle.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: In 2013 the Technical University of Dresden set out to relaunch their website. The plan was to replace the Plone2-based CMS with a modern Plone4 setup. Four years later, the process is now completed. In this talk I will present some of the challenges we met in the project and show how we did overcome them with Plone technologies: ° large-scale Plone deployment architecture ° migration of 1/2 million legacy content objects ° management of an editorial team consisting of more than 1000 members ° performance bottlenecks and their solutions ° QA with Robot Tests

uk: вхід без авторизації

name: TU Dresden: A large-scale Plone deployment case study


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Plone Conf 2017 - Day 2: Lightning Talks


Documentation: Do's and don'ts

uk: Комп'ютерні науки

description: In the beginning we will learn why documentation is important and how it can help you and your customers. From here we will move on to the main topic of this talk. With the help of real world examples, we will discover the good, the bad and the ugly. This will cover items such as: - Header - Line-length - File-length - Wording - Audience - Consistency - Code examples - PEP8 and friends - Many more In the last part we will talk about structure, planning, helper tools and such. This talk will use real examples out of the Plone world, but it is not limited to it.

uk: вхід без авторизації


Introduction to Python Asyncio

uk: Комп'ютерні науки

description: Dive into Python asyncio programming! This talk will cover basics of using Python asyncio, tips, gotchas and explanations on why asyncio is amazing.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Under Mosaic and its JavaScript-based editor, there is a whole powerful layout ecosystem making Diazo, portlets and viewlets almost obsolete. This talk is about the building blocks of Mosaic: layouts, tiles, slots, and panels. After I used Mosaic blocks myself in a project with twelve sites I trained two customer teams to use it. The talk will include with an overview. I will show how to build and integrate layouts, how to write a simple reusable tile and use it in the layout. I will go more into the detail of what happens behind the scenes, such as subrequests and transform chains.

uk: вхід без авторизації

name: Blocks: Utilizing the Screed under Mosaic to build sites


uk: Комп'ютерні науки

description: Our client had a 15-year old ASP/VBScript application but wasn’t prepared to rewrite it: the logic was working well enough, but it wasn’t attractive by today’s standards or usable on mobile devices. “Can’t we just give it a new look and feel?” they asked. We’ve used the Diazo theme engine to build mobile.nasa.gov, retheming www.nasa.gov before it was mobile-friendly, so we knew we could do the same for this client. Our solution for this new project was to build a modern responsive theme, tailored for their each of their different content types and sections. In this talk, we discuss our experience in building Diazo into nginx with a patched XSLT module, and how we deploy into AWS on a load-balanced cluster of inexpensive EC2 instances. We cover how our front-end developers work with paster, and our full-stack developers work with Docker. Finally, we talk about the challenges of providing too much power and splitting content control between the origin server and Diazo.

uk: вхід без авторизації

name: Second Skin: Real-Time Retheming a Legacy Web Application with Diazo in the Cloud


uk: Комп'ютерні науки

description: On mailing lists, IRC, Stack Overflow, and bug trackers, we often act viciously toward newcomers. Why? Why do we start out trying to be generous to beginners, then turn against them? Similarly, we often say that we welcome pull requests, but when a newcomer offers one we ignore it or respond rudely. Why do we reject the generosity of others? I'll propose a theory for why generosity turns to rage, and a method for maintaining our composure and enjoying our interactions with beginners.

uk: вхід без авторизації

name: Keynote: Why generosity turns to rage, and what to do about it


uk: Комп'ютерні науки

description: Managing directories full of gigabytes of ZODB blob data can become cumbersome. This talk introduces collective.s3blobs, a newly developed tool making it possible to offload selected blobs to cloud storage on Amazon S3. It will discuss how it works, how to set it up, and how to tell if it is the right solution.

uk: вхід без авторизації

name: Nice blobs! It'd be a shame if anything happened to them...


Syntax-Guided Quantifier Instantiation

uk: Комп'ютерні науки

uk: вхід без авторизації

name: European Joint Conferences on Theory and Practice of Software - ETAPS - e. V.


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Deductive Stability Proofs for Ordinary Differential Equations


uk: Комп'ютерні науки

uk: вхід без авторизації

name: cake_lpr: Verified Propagation Redundancy Checking in CakeML


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Deductive Verification of Floating-Point Java Programs in KeY


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Helmholtz: A Verifier for Tezos Smart Contracts Based on Refinement Types


uk: Комп'ютерні науки

uk: вхід без авторизації

name: SyReNN: A Tool for Analyzing Deep Neural Networks


uk: Комп'ютерні науки

uk: вхід без авторизації

name: dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts


uk: Комп'ютерні науки

uk: вхід без авторизації

name: HLola: a Very Functional Tool for Extensible Stream Runtime Verification


uk: Комп'ютерні науки

uk: вхід без авторизації

name: AMulet 2.0 for Verifying Multiplier Circuits


Momba: JANI Meets Python

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: A Game for Linear-time–Branching-time Spectroscopy


On Satisficing in Quantitative Games

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Generating Extended Resolution Proofs with a BDD-Based SAT Solver


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Bounded Model Checking for Hyperproperties


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays


uk: Комп'ютерні науки

uk: вхід без авторизації

name: SAT Solving with GPU Accelerated Inprocessing


uk: Комп'ютерні науки

uk: вхід без авторизації

name: FOREST: An Interactive Multi-tree Synthesizer for Regular Expressions


Finding Provably Optimal Markov Chains

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Inductive Synthesis for Probabilistic Programs Reaches New Horizons


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Analysis of Markov Jump Processes under Terminal Constraints


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Multi-objective Optimization of Long-run Average and Total Rewards

name: European Joint Conferences on Theory and Practice of Software - ETAPS - e. V.


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Probabilistic and Systematic Coverage of Consecutive Test-Method Pairs for Detecting Order-Dependent Flaky Tests


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Timed Automata Relaxation for Reachability


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Synthesizing Context-free Grammars from Recurrent Neural Networks


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Improving Neural Network Verification through Spurious Region Guided Refinement


Resilient Capacity-Aware Routing

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Network Traffic Classification by Program Synthesis


uk: Комп'ютерні науки

uk: вхід без авторизації

name: General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Directed Reachability for Infinite-State Systems


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Bridging Arrays and ADTs in Recursive Proofs


uk: Комп'ютерні науки

uk: вхід без авторизації

name: A Two-Phase Approach for Conditional Floating-Point Verification


Symbolic Coloured SCC Decomposition

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Local Search with a SAT Oracle for Combinatorial Optimization


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Analyzing Infrastructure as Code to Prevent Intra-update Sniping Vulnerabilities


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Certifying Proofs in the First-Order Theory of Rewriting


uk: Комп'ютерні науки

description: ACM A.M. Turing Award and Nevanlinna Prize recipient Robert Endre Tarjan sat down for an informal discussion with Alfred Vaino Aho and Jeffrey David Ullman, who received the 2020 ACM A.M. Turing Award. The 8th Heidelberg Laureate Forum took place from September 20–23, 2021. #HLF21 The opinions expressed in the videos do not necessarily reflect the views of the Heidelberg Laureate Forum Foundation or any other person or associated institution involved in the making and distribution of the videos. More information about the Heidelberg Laureate Forum: Website: https://www.heidelberg-laureate-forum.org/ Blog: https://scilogs.spektrum.de/hlf/ Twitter: https://twitter.com/HLForum Facebook: https://www.facebook.com/HeidelbergLaureateForum Flickr: https://www.flickr.com/hlforum

uk: вхід без авторизації

name: Laureate Dialogue: Robert Endre Tarjan, Alfred Vaino Aho, Jeffrey David Ullman


uk: Комп'ютерні науки

description: In Fall 2019, a team at Google made the first-ever claim of "quantum computational supremacy"---that is, a clear quantum speedup over a classical computer for some task---using a 53-qubit programmable superconducting chip called Sycamore. Since then, a group at USTC in China has made several additional claims of quantum supremacy, using both superconducting qubits and "BosonSampling" (a proposal by me and Alex Arkhipov from 2011) with ~70 photons in an optical network. In addition to engineering, these experiments built on a decade of research in quantum complexity theory. This talk will discuss questions like: what exactly were the contrived computational problems that were solved? How does one verify the outputs using a classical computer? And crucially, how confident can we be that the problems are really classically hard? Scott J. Aaronson – ACM Prize in Computing 2020 The 8th Heidelberg Laureate Forum took place from September 20–23, 2021. #HLF21 The opinions expressed in the videos do not necessarily reflect the views of the Heidelberg Laureate Forum Foundation or any other person or associated institution involved in the making and distribution of the videos.

uk: вхід без авторизації

name: Lecture: Quantum Computational Supremacy


cs: Matematika

de: Mathematik

fi: matematiikka

uk: Математика

en: Mathematics

fr: Mathématiques

da: Matematik

es: Matemáticas

nl: Wiskunde

de: Mathematik, Naturwissenschaften

uk: Математика, природничі науки

en: Mathematics, Natural Sciences

description: The Value of Errors in Proofs (a fascinating journey from Turing's seminal 1936 R ≠\neq RE to the 2020 breakthrough of MIP* = RE) Last year, a group of theoretical computer scientists posted a paper on the Arxiv with the strange-looking title "MIP* = RE", impacting and surprising not only complexity theory but also some areas of math and physics. Specifically, it resolved, in the negative, the "Connes' embedding conjecture" in the area of von-Neumann algebras, and the "Tsirelson problem" in quantum information theory. You can find the paper here https://arxiv.org/abs/2001.04383 As it happens, both acronyms MIP* and RE represent proof systems, of a very different nature. To explain them, we'll take a meandering journey through the classical and modern definitions of proof. I hope to explain how the methodology of computational complexity theory, especially modeling and classification (both problems and proofs) by algorithmic efficiency, naturally leads to the generation of new such notions and results (and more acronyms, like NP). A special focus will be on notions of proof which allow interaction, randomness, and errors, and their surprising power and magical properties. The talk does not assume any special background. Avi Wigderson – Nevanlinna Prize 1994, Abel Prize 2021 The 8th Heidelberg Laureate Forum took place from September 20–23, 2021. #HLF21 The opinions expressed in the videos do not necessarily reflect the views of the Heidelberg Laureate Forum Foundation or any other person or associated institution involved in the making and distribution of the videos.

uk: вхід без авторизації

name: Lecture Mathematics: The Value of Erro in Proofs


uk: Комп'ютерні науки

uk: Бібліотекознавство, документознавство

en: Information and Library Sciences

de: Geisteswissenschaften

uk: Гуманітарні науки

en: Humanities

description: The COVID-19 pandemic, climate change, artificial intelligence, the opioid epidemic, and the Mars expedition are just a few of the complex science topics in the news today. Regrettably, many of these topics have been politicized, leading to vaccine hesitancy, climate change denialism, and other undesirable outcomes. Fortunately, a recent Pew Research Center survey found that public confidence in scientists exceeds that of confidence in elected officials. Scientists who are willing to engage with the public—via writing, exhibitions, TED talks, infographics, art, and more—not only have an opportunity to enhance public science literacy but may find the experience personally and professionally rewarding. In this panel you will hear from mathematicians, a computer scientist, and a science journalist who engage the public in science in creative ways, including writing and editing books and articles aimed at nonexperts, curating public exhibitions, and producing videos that go viral. Moderator: Susan D'Agostino - Bulletin of the Atomic Scientists Panelists: Vinton Gray Cerf – ACM A.M. Turing Award 2004 Bill Andrews – Quanta Magazine Jürgen Richter-Gebert – Technical University of Munich Talithia Williams – Harvey Mudd College The 8th Heidelberg Laureate Forum took place from September 20–23, 2021. #HLF21 The opinions expressed in the videos do not necessarily reflect the views of the Heidelberg Laureate Forum Foundation or any other person or associated institution involved in the making and distribution of the videos. More information about the Heidelberg Laureate Forum: Website: https://www.heidelberg-laureate-forum.org/ Blog: https://scilogs.spektrum.de/hlf/ Twitter: https://twitter.com/HLForum Facebook: https://www.facebook.com/HeidelbergLaureateForum Flickr: https://www.flickr.com/hlforum

uk: вхід без авторизації

name: Panel Discussion: Scientists Get Creative to Engage the Public in Science


uk: Комп'ютерні науки

description: The Scientific Vocation Revisited – Can Future Discoveries be Made by Artificial Intelligence? Science as a vocation and institution undergoes rapid institutional changes in the 21st century. The question of where, by whom and by which research institutions major breakthroughs and scientific discoveries are made more often remains an issue of international cooperation and competition. Everybody is looking for talents and “brains” to advance knowledge and technology for national gain. But what will scientific discovery look like in the future? Will Artificial Intelligence have an impact on how we discover new knowledge? This panel of experts will review state of the art methods in scientific discovery, analyzing some trends to see whether there is a role to play for Artificial Intelligence in creative research. Moderator: Volker Stollorz – Science Media Center Germany Panelists: Jeffrey A. Dean – ACM Prize in Computing 2012 Harry Collins – Cardiff University Dafna Shahaf – The Hebrew University of Jerusalem The 8th Heidelberg Laureate Forum took place from September 20–23, 2021. #HLF21 The opinions expressed in the videos do not necessarily reflect the views of the Heidelberg Laureate Forum Foundation or any other person or associated institution involved in the making and distribution of the videos. More information about the Heidelberg Laureate Forum: Website: https://www.heidelberg-laureate-forum.org/ Blog: https://scilogs.spektrum.de/hlf/ Twitter: https://twitter.com/HLForum Facebook: https://www.facebook.com/HeidelbergLaureateForum Flickr: https://www.flickr.com/hlforum

uk: вхід без авторизації

name: Panel Discussion: The Scientific Vocation Revisited - Can Future Discoveries be Made by Artifical Intelligence


uk: Комп'ютерні науки

description: ACM A.M. Turing Award recipients Leslie Lamport and Whitfield Diffie sat down for an informal discussion. The 8th Heidelberg Laureate Forum took place from September 20–23, 2021. #HLF21 The opinions expressed in the videos do not necessarily reflect the views of the Heidelberg Laureate Forum Foundation or any other person or associated institution involved in the making and distribution of the videos.

uk: вхід без авторизації

name: Laureate Dialogue: Leslie Lamport, Whitfield Diffie


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Ethical, Societal and Environmental Implications of Information Technology


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Laureate Discussion: Advances in Computer Science, Mathematics and Computing


keywords:
Rare event simulation
Dynamic fault trees
System reliability analysis
Importance splitting
Statistical model checking

uk: Комп'ютерні науки

description: Dynamic fault trees (DFTs) are widely adopted in industry to assess the dependability of safety-critical equipment. Since many systems are too large to be studied numerically, DFTs dependability is often analysed using Monte Carlo simulation. A bottleneck here is that many simulation samples are required in the case of rare events, e.g. in highly reliable systems where components fail seldomly. Rare event simulation (RES) provides techniques to reduce the number of samples in the case of rare events. We present a RES technique based on importance splitting, to study failures in highly reliable DFTs. Whereas RES usually requires meta-information from an expert, our method is fully automatic: By cleverly exploiting the fault tree structure we extract the so-called importance function. We handle DFTs with Markovian and non-Markovian failure and repair distributions—for which no numerical methods exist—and show the efficiency of our approach on several case studies.

uk: вхід без авторизації

name: Rare event simulation for non-Markovian repairable fault trees

name: European Joint Conferences on Theory and Practice of Software - ETAPS - e. V.


uk: Комп'ютерні науки

description: This paper presents Discourje: a runtime verification framework for communication protocols in Clojure. Discourje guarantees safety of protocol implementations relative to specifications, based on an expressive new version of multiparty session types. The framework has a formal foundation and is itself implemented in Clojure to offer a seamless specification-implementation experience. Benchmarks show Discourje's overhead can be less than 5% for real/existing concurrent programs.

uk: вхід без авторизації

name: Discourje: Runtime Verification of Communication Protocols in Clojure


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Multi-Agent Safety Verification using Symmetry Transformations


keywords:
Concurrency verification
Model checking
Parallel graph searching

uk: Комп'ютерні науки

description: Model checking algorithms are typically complex graph algorithms, whose correctness is crucial for the usability of a model checker. However, establishing the correctness of such algorithms can be challenging and is often done manually. Mechanisation of the verification process is crucially important, because model checking algorithms are often parallelised for efficiency reasons, which makes them even more error-prone.

uk: вхід без авторизації

name: Automated Verification of Parallel Nested DFS


keywords:
software verification
witness validation
violation witnesses

uk: Комп'ютерні науки

description: As software verification is gaining traction in academia and industry the number and complexity of verification tools is growing constantly. This initiated research and interest into exchangeable verification witnesses as well as tools for automated witness validation. Initial witness validators used model checkers that were amended to benefit from guidance information provided by the witness. This approach comes with substantial overhead. Second-generation execution-based validators traded speed for reduced strength in case of incomplete and non-exact witnesses. This was done by extracting test harnesses and compiling them with the original program. We present the NITWIT tool, a new interpretation-based violation witness validator for C programs that is trimmed to be fast and memory efficient. It verifies a record number of witnesses of SV-COMP'20 in the ReachSafety category. Our novel tool exchanges initial compilation overhead and optimized execution for rapid startup performance. NITWIT borrows C semantics from the compiler used for compilation. This offloads this hard-to-get-right task and enables using several compilers in parallel to inspect possible semantic differences.

uk: вхід без авторизації

name: Interpretation-Based Violation Witness Validation for C: NITWIT


uk: Комп'ютерні науки

description: This paper introduces Farkas certificates for lower and upper bounds on minimal and maximal reachability probabilities in Markov decision processes (MDP), which we derive using an MDP-variant of Farkas’ Lemma. The set of all such certificates is shown to form a polytope whose points correspond to witnessing subsystems of the model and the property. Using this correspondence we can translate the problem of finding minimal witnesses to the problem of finding vertices with a maximal number of zeros. While computing such vertices is computationally hard in general, we derive new heuristics from our formulations that exhibit competitive performance compared to state-of-the-art techniques. As an argument that asymptotically better algorithms cannot be hoped for, we show that the decision version of finding minimal witnesses is NP-complete even for acyclic Markov chains.

uk: вхід без авторизації

name: Farkas certificates and minimal witnesses for probabilistic reachability constraints


keywords:
Software verification
Program analysis
Invariant generation
Property-directed reachability (PDR)
k -Induction

uk: Комп'ютерні науки

description: Property-directed reachability (PDR) is a SAT/SMT-based reachability algorithm that incrementally constructs inductive invariants. After it was successfully applied to hardware model checking, several adaptations to software model checking have been proposed. We contribute a replicable and thorough comparative evaluation of the state of the art: We (1) implemented a standalone PDR algorithm and, as improvement, a PDR-based auxiliary-invariant generator for k -induction, and (2) performed an experimental study on the largest publicly available benchmark set of C verification tasks, in which we explore the effectiveness and efficiency of software verification with PDR. The main contribution of our work is to establish a reproducible baseline for ongoing research in the area by providing a well-engineered reference implementation and an experimental evaluation of the existing techniques.

uk: вхід без авторизації

name: Software Verification with PDR: An Implementation of the State of the Art


keywords:
Energy Measurement
RAPL
Benchmarking
BenchExec

uk: Комп'ютерні науки

description: Verification algorithms are among the most resource-intensive computation tasks. Saving energy is important for our living environment and to save cost in data centers. Yet, researchers compare the efficiency of algorithms still in terms of consumption of CPU time (or even wall time). Perhaps one reason for this is that measuring energy consumption of computational processes is not as convenient as measuring the consumed time and there is no sufficient tool support. To close this gap, we contribute CPU Energy Meter , a small tool that takes care of reading the energy values that Intel CPUs track inside the chip. In order to make energy measurements as easy as possible, we integrated CPU Energy Meter into BenchExec , a benchmarking tool that is already used by many researchers and competitions in the domain of formal methods. As evidence for usefulness, we explored the energy consumption of some state-of-the-art verifiers and report some interesting insights, for example, that energy consumption is not necessarily correlated with CPU time.

uk: вхід без авторизації

name: CPU Energy Meter: A Tool for Energy-Aware Algorithms Engineering


keywords:
Java standard library
Deductive verification
Java Modeling Language
Case study
Bug

uk: Комп'ютерні науки

description: As a particular case study of the formal verification of state-of-the-art, real software, we discuss the specification and verification of a corrected version of the implementation of a linked list as provided by the Java Collection framework.

uk: вхід без авторизації

name: Verifying OpenJDK’s LinkedList using KeY


keywords:
Petri Nets
Kosaraju's Algorithm
Reachability
Vector Addition Systems
Coverability

uk: Комп'ютерні науки

description: We present KReach, a tool for deciding reachability in general Petri nets. The tool is a full implementation of Kosaraju’s original 1982 decision procedure for reachability in VASS. We believe this to be the first implementation of its kind. We include a comprehensive suite of libraries for development with Vector Addition Systems (with States) in the Haskell programming language. KReach serves as a practical tool, and acts as an effective teaching aid for the theory behind the algorithm. Preliminary tests suggest that there are some classes of Petri nets for which we can quickly show unreachability. In particular, using KReach for coverability problems, by reduction to reachability, is competitive even against state-of-the-art coverability checkers.

uk: вхід без авторизації

name: KReach: A Tool for Reachability in Petri Nets


keywords:
identification in the limit
characteristic sets
verification
grammatical inference
passive automata learning
omega-regular languages

uk: Комп'ютерні науки

uk: вхід без авторизації

name: Polynomial Identification of $\omega$-Automata


uk: Комп'ютерні науки

description: We characterize the class of nondeterministic

uk: вхід без авторизації

name: Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning


uk: Комп'ютерні науки

description: We present a full-program induction technique for proving (a sub-class of) quantified as well as quantifier-free properties of programs manipulating arrays of parametric size N . Instead of inducting over individual loops, our technique inducts over the entire program (possibly containing multiple loops) directly via the program parameter N . Significantly, this does not require generation or use of loop invariants. We have developed a prototype tool Vajra to assess the efficacy of our technique. We demonstrate the performance of Vajra vis-a-vis several state-of-the-art tools on a set of array manipulating benchmarks.

uk: вхід без авторизації

name: Verifying Array Manipulating Programs with Full-Program Induction


keywords:
change impact analysis
regression test selection

uk: Комп'ютерні науки

description: Change impact analysis techniques determine the components affected by a change to a software system, and are used as part of many program analysis techniques and tools, e.g., in regression test selection, build systems, and compilers. The correctness of such analyses usually depends both on domain-specific properties and change impact analysis, and is rarely established formally, which is detrimental to trustworthiness. We present a formalization of change impact analysis with machine-checked proofs of correctness in the Coq proof assistant. Our formal model factors out domain-specific concerns and captures system components and their interrelations in terms of dependency graphs. Using compositionality, we also capture hierarchical impact analysis formally for the first time, which, e.g., can capture when impacted files are used to locate impacted tests inside those files. We refined our verified impact analysis for performance, extracted it to efficient executable OCaml code, and integrated it with a regression test selection tool, one regression proof selection tool, and one build system, replacing their existing impact analyses. We then evaluated the resulting toolchains on several open source projects, and our results show that the toolchains run with only small differences compared to the original running time. We believe our formalization can provide a basis for formally proving domain-specific techniques using change impact analysis correct, and our verified code can be integrated with additional tools to increase their reliability.

uk: вхід без авторизації

name: Practical Machine-Checked Formalization of Change Impact Analysis


Learning One-Clock Timed Automata

keywords:
Automaton learning
Active Learning
One-clock timed automata
Timed language

uk: Комп'ютерні науки

description: We present an algorithm for active learning of deterministic timed automata with a single clock. The algorithm is within the framework of Angluin’s L∗ algorithm and inspired by existing work on the active learning of symbolic automata. Due to the need of guessing for each transition whether it resets the clock, the algorithm is of exponential complexity in the size of the learned automata. Before presenting this algorithm, we propose a simpler version where the teacher is assumed to be smart in the sense of being able to provide the reset information. We show that this simpler setting yields a polynomial complexity of the learning process. Both of the algorithms are implemented and evaluated on a collection of randomly generated examples. We furthermore demonstrate the simpler algorithm on the functional specification of the TCP protocol.

uk: вхід без авторизації


Relational Differential Dynamic Logic

keywords:
hybrid systems
cyber-physical systems
formal verification
theorem proving
dynamic logic

uk: Комп'ютерні науки

description: In the field of quality assurance of hybrid systems, Platzer's differential dynamic logic (dL) is widely recognized as a deductive verification method with solid mathematical foundations and sophisticated tool support. Motivated by case studies provided by our industry partner, we study a relational extension of dL, aiming to formally prove statements such as "an earlier engagement of the emergency brake yields a smaller collision speed." A main technical challenge is to combine two dynamics, so that the powerful inference rules of dL (such as the differential invariant rules) can be applied to such relational reasoning, yet in such a way that we relate two different time points. Our contributions are a semantical theory of time stretching, and the resulting synchronization rule that expresses time stretching by the syntactic operation of Lie derivative. We implemented this rule as an extension of KeYmaera X, by which we successfully verified relational properties of a few models taken from the automotive domain.

uk: вхід без авторизації


keywords:
Bisimulation
Concurrency
Model checking
Mu-calculus

uk: Комп'ютерні науки

description: We showed in a recent paper that, when verifying a modal $\mu$-calculus formula, the actions of the system under verification can be partitioned into sets of so-called weak and strong actions, depending on the combination of weak and strong modalities occurring in the formula. In a compositional verification setting, where the system consists of processes executing in parallel, this partition allows us to decide whether each individual process can be minimized for either divergence-preserving branching (if the process contains only weak actions) or strong (otherwise) bisimilarity, while preserving the truth value of the formula. In this paper, we refine this idea by devising a family of bisimilarity relations, named sharp bisimilarities, parameterized by the set of strong actions. We show that these relations have all the nice properties necessary to be used for compositional verification, in particular congruence and adequacy with the logic. We also illustrate their practical utility on several examples and case-studies, and report about our success in the RERS 2019 model checking challenge.

uk: вхід без авторизації

name: Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities


keywords:
Branching bisimilarity
Algorithm
Labelled transition system

uk: Комп'ютерні науки

description: Branching bisimilarity is a behavioural equivalence relation on labelled transition systems (LTSs) that takes internal actions into account. It has the traditional advantage that algorithms for branching bisimilarity are more efficient than ones for other weak behavioural equivalences, especially weak bisimilarity. With m the number of transitions and n the number of states, the classic O(mn) algorithm was recently replaced by an O(m(log |Act| + log n)) algorithm [Groote/Jansen/Keiren/Wijs, ACM ToCL 2017], which is unfortunately rather complex. This paper combines its ideas with the ideas from Valmari [PETRI NETS 2009], resulting in a simpler O(m log n) algorithm. Benchmarks show that in practice this algorithm is also faster and often far more memory efficient than its predecessors, making it the best option for branching bisimulation minimisation and preprocessing for calculating other weak equivalences on LTSs.

uk: вхід без авторизації

name: An O(m log n) algorithm for branching bisimilarity on labelled transition systems


keywords: European Joint Conferences on Theory and Practice of Software, ETAPS 2021

uk: Комп'ютерні науки

description: Symbolic model checking has become an important part of the verification flow in industrial hardware design. However, its use is still limited due to scaling issues. One way to address this is to exploit the large amounts of symmetry present in many real world designs. In this paper, we adapt partial order reduction for bounded model checking of synchronous hardware and introduce a novel technique that makes partial order reduction practical in this new domain. These approaches are largely automatic, requiring only minimal manual effort. We evaluate our technique on open-source and commercial packet mover circuits – designs containing FIFOs and arbiters.

uk: вхід без авторизації

name: Partial Order Reduction for Deep Bug Finding in Synchronous Hardware


keywords: European Joint Conferences on Theory and Practice of Software 2021

uk: Комп'ютерні науки

description: The Debian distribution includes more than 28 thousand maintainer scripts, almost all of them are written in Posix shell. These scripts are executed with root privileges at installation, update, and removal of a package, which make them critical for system maintenance. While Debian policy provides guidance for package maintainers producing the scripts, few tools exist to check the compliance of a script to it. We report on the application of a formal verification approach based on symbolic execution to find violations of some non-trivial properties required by Debian policy in maintainer scripts. We present our methodology and give an overview of our toolchain. We obtained promising results: our toolchain is effective in analysing a large set of Debian maintainer scripts and it pointed out over 150 policy violations that lead to reports (more than half already fixed) on the Debian Bug Tracking system.

uk: вхід без авторизації

name: Analysing installation scenarios of Debian packages

name: European Joint Conferences on Theory and Practice of Software - ETAPS - e. V.


keywords:
Mean-Payoff Games
Progress Measure
Quasi dominion

uk: Комп'ютерні науки

description: We propose a novel algorithm for the solution of mean-payoff games that merges together two seemingly unrelated concepts introduced in the context of parity games, small progress measures and quasi dominions. We show that the integration of the two notions can be highly beneficial and significantly speeds up convergence to the problem solution. Experiments show that the resulting algorithm performs orders of magnitude better than the asymptotically-best solution algorithm currently known, without sacrificing on the worst-case complexity.

uk: вхід без авторизації

name: Solving Mean-Payoff Games via Quasi Dominions


keywords:
Strategy Synthesis
Multi-objective optimization
Markov Decision Processes
Probabilistic Systems

uk: Комп'ютерні науки

description: We consider the verification of multiple expected reward objectives at once on Markov decision processes (MDPs). This enables a trade-off analysis among multiple objectives by obtaining the Pareto front. We focus on strategies that are easy to employ and implement. That is, strategies that are pure (no randomization) and have bounded memory. We show that checking whether a point is achievable by a pure stationary strategy is NP-complete, even for two objectives, and we provide an MILP encoding to solve the corresponding problem. The bounded memory case can be reduced to the stationary one by a product construction. Experimental results using Storm and Gurobi show the feasibility of our algorithms.

uk: вхід без авторизації

name: Simple Strategies in Multi-Objective MDPs


uk: Математика, природничі науки

description: I am going to explain a series of conjectures due to D.Gaiotto which provide a geometric realization of categories of representations of certain quantum super-groups (such as U_q(gl(M|N)) via the affine Grassmannian of certain (purely even) algebraic groups. These conjectures generalize both the well-known geometric Satake equivalence and the so called Fundamental Local Equivalence of Gaitsgory and Lurie (which will be recalled in the talk). In the 2nd part of the talk I will explain a recent proof of this conjecture for U_q(N|N-1) (for generic q), based on a joint work with Finkelberg and Travkin.

uk: вхід без авторизації

name: Gaiotto Conjectures for Quantum Super-groups

name: Institut des Hautes Études Scientifiques (IHÉS)

addressCountry: FR

addressLocality: Bures-sur-Yvette

addressRegion: Île-de-France


uk: Математика, природничі науки

description: In the first part of the course, I will give an overview of Donaldson-Thomas theory for Calabi-Yau threefold geometries, and its cohomological refinement. In the second part, I will explain a conjectural ansatz (from joint work with Y. Toda) for defining Gopakumar-Vafa invariants via moduli of one-dimensional sheaves, emphasizing some examples where we can understand how they relate to curve-counting via stable pairs. If time permits, I will discuss some recent work on χ-independence phenomena in this setting (joint with J. Shen).

uk: вхід без авторизації

name: 3/5 Stable Pairs and Gopakumar-Vafa Invariants


uk: Математика, природничі науки

uk: вхід без авторизації

name: 1/5 Stable Pairs and Gopakumar-Vafa Invariants


uk: Математика, природничі науки

uk: вхід без авторизації

name: 5/5 Stable Pairs and Gopakumar-Vafa Invariants


uk: Математика, природничі науки

uk: вхід без авторизації

name: 2/5 Stable Pairs and Gopakumar-Vafa Invariants


uk: Математика, природничі науки

uk: вхід без авторизації

name: 4/5 Stable Pairs and Gopakumar-Vafa Invariants


uk: Математика, природничі науки

description: Khovanov and Rozansky defined a link homology theory which categorifies the HOMFLY-PT polynomial. This homology is relatively easy to define, but notoriously hard to compute. I will discuss recent breakthroughs in understanding and computing Khovanov-Rozansky homology, focusing on connections to the algebraic geometry of Hilbert schemes of points, affine Springer fibers and braid varieties.

uk: вхід без авторизації

name: 5/5 Algebra and Geometry of Link Homology


uk: Математика, природничі науки

description: In the 21st century, there has been a great interest in the study of symplectic resolutions, such as cotangent bundles of flag varieties, hypertoric varieties, quiver varieties, and affine Grassmannian slices. Mathematicians, especially Braden-Licata-Proudfoot-Webster, and physicists observed that these spaces come in dual pairs: this phenomenon is known as 3d mirror symmetry or symplectic duality. In physics, these dual pairs come from Higgs and Coulomb branches of 3d supersymmetric field theories. In a remarkable 2016 paper, Braverman-Finkelberg-Nakajima gave a mathematical definition of the Coulomb branch associated to a 3d gauge theory. We will discuss all these developments, as well as recent progress building on the work of BFN. We will particularly study the Coulomb branches associated to quiver gauge theories: these are known as generalized affine Grassmannian slices.

uk: вхід без авторизації

name: 4/5 Symplectic Resolutions, Coulomb Branches, and 3d Mirror Symmetry


uk: Математика, природничі науки

uk: вхід без авторизації

name: 5/5 Symplectic Resolutions, Coulomb Branches, and 3d Mirror Symmetry


uk: Математика, природничі науки

description: We motivate, define and study Donaldson-Thomas invariants and Cohomological Hall algebras associated to quivers, relate them to the geometry of moduli spaces of quiver representations and (in special cases) to Gromov-Witten invariants, and discuss the algebraic structure of Cohomological Hall algebras.

uk: вхід без авторизації

name: 1/4 Cohomological Hall Algebras and Motivic Invariants for Quivers


uk: Математика, природничі науки

uk: вхід без авторизації

name: 4/4 Cohomological Hall Algebras and Motivic Invariants for Quivers


uk: Математика, природничі науки

uk: вхід без авторизації

name: 3/4 Cohomological Hall Algebras and Motivic Invariants for Quivers


uk: Математика, природничі науки

uk: вхід без авторизації

name: 2/4 Cohomological Hall Algebras and Motivic Invariants for Quivers


uk: Математика, природничі науки

description: Let G and G’ be Langlands dual reductive groups (e.g. SL(n) and PGL(n)). According to a theorem by Donagi-Pantev, the generic fibres of the moduli spaces of G-Higgs bundles and G’-Higgs bundles are dual abelian varieties and are therefore derived-equivalent. It is an interesting open problem to prove existence of a derived equivalence over the full Hitchin base. I will report on joint work in progress with Shiyu Shen, in which we construct a K-theoretic shadow thereof: natural equivalences between complex K-theory spectra for certain moduli spaces of Higgs bundles (in type A).

uk: вхід без авторизації

name: Complex K-theory of Dual Hitchin Systems


uk: Математика, природничі науки

description: I will report some recent progress on relationship between cohomology of affine Springer fibres and centre of small quantum groups. This is based on joint work with R. Bezrukavnikov, P. Boixeda-Alvarez and E. Vasserot.

uk: вхід без авторизації

name: Cohomology of Affine Springer Fibres and Centre of Small Quantum Groups