PSI 2014: ERSHOV INFORMATICS CONFERENCE

PROGRAM

Days: Tuesday, June 24th Wednesday, June 25th Thursday, June 26th

Tuesday, June 24th

View this program: with abstractssession overviewtalk overview

09:00-10:25 Session 1
09:00
Conference Opening (abstract)
09:25
Preserving class invariants in object-oriented programming (abstract)
10:25-10:55Coffee Break
10:55-12:50 Session 2
10:55
Towards High-Level Programming for Systems with Many Cores (abstract)
11:20
Symbolic String Transformations with Regular Lookahead and Rollback (abstract)
11:45
Skeblle: A Tool for Programmable Active Diagrams (abstract)
12:10
Modeling Environment for Static Verification of Linux Kernel Modules (abstract)
12:35
Polynomial-Time Optimal Pretty-Printing Combinators with Choice (abstract)
13:00-14:00Lunch Break
14:00-16:00 Session 3
14:00
The Laws of Concurrent Programming (abstract)
15:00
More type inference in Java 8 (abstract)
15:15
Towards Symbolic Execution in Erlang (abstract)
15:30
Lingva: Generating and Proving Program Properties using Symbol Elimination (abstract)
15:45
The study of multidimensional R-Tree -based index scalability in multicore environment (abstract)
16:00-16:30Coffee Break
16:30-18:40 Session 4
16:30
Supercompilation for Datatypes (abstract)
16:55
Certifying supercompilation for Martin-Löf's type theory (abstract)
17:20
Towards Specializing JavaScript Programs (abstract)
17:45
Inductive Prover Based on Equality Saturation for a Lazy Functional Language (abstract)
18:10
Asymptotic Speedups, Bisimulation and Distillation (abstract)
18:25
Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs (abstract)
19:00-23:00Welcome Party
Wednesday, June 25th

View this program: with abstractssession overviewtalk overview

09:00-10:25 Session 5
09:00
Model Checking and the Verification of Computer Systems (abstract)
10:00
Model Checking Value-Passing Modal Specifications (abstract)
10:25-10:55Coffee Break
10:55-13:00 Session 6
10:55
Bonsai: Cutting Models Down to Size (abstract)
11:20
A proof-based method for modelling timed systems (abstract)
11:45
The role of indirections in lazy natural semantics (abstract)
12:10
Neutralizing Semantic Ambiguities of Function Block Architecture by Modeling with ASM (abstract)
12:35
Probabilistic formal concepts for contexts with negation (abstract)
13:00-14:00Lunch Break
14:00-16:00 Session 7
14:00
Languages and types for linked data (abstract)
15:00
Process Opacity (abstract)
15:15
Comparing Semantics under Strong Timing of Petri Nets (abstract)
15:30
Timed History Preserving Bisimulation and Open Maps (abstract)
15:45
Verification of Temporal Properties of Hybrid Systems Using dMTL (abstract)
16:00-16:30Coffee Break & Poster Session
16:30-18:05 Session 8
16:30
Decidability and Expressiveness of Recursive Weighted Logic (abstract)
16:55
Index sets as a measure of continuous constraint complexity (abstract)
17:20
On Tractability of Disjoint AND-Decomposition of Boolean Formulas (abstract)
17:35
A Multi-agent Text Analysis Based on Ontology of Subject Domain (abstract)
Thursday, June 26th

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 9
09:00
Big Data, Big Systems, Big Challenges (A Personal Experience) (abstract)
10:30-23:00Excursion + Conference Dinner
Disclaimer | Powered by EasyChair Smart Program