Titlebook: Relational and Algebraic Methods in Computer Science; 13th International C Wolfram Kahl,Timothy G. Griffin Conference proceedings 2012 Spri

即席

合同

Recess

Transitive Separation Logic to be treated comprise reachability analysis, (absence of) sharing, cycle detection and preservation of substructures under destructive assignments. We demonstrate the practicality of this approach with the examples of in-place list-reversal and tree rotation.

Trochlea

Foundations of Coloring Algebra with Consequences for Feature-Oriented Programmingnt of view, which yields a much better understanding of the proposed algebra and therefore of feature oriented programming. For example, we show that the axioms characterising feature composition are isomorphic to set-theoretic models.

疲憊的老馬

Deciding Regular Expressions (In-)Equivalence in Coq enforcing the in-equivalence of regular expressions at early stages of computation. Recent theoretical and experimental research provide evidence that this method is, on average, more efficient than the classical methods based in automata. We present some performance tests and comparisons with similar approaches.

lethal

Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closuresds to different algorithms for computing reflexive-transitive closures. Using data refinement, we then develop simple Haskell programs for two specific choices of rectangles and show that one of them has cubic runtime like an imperative implementation of Warshall’s standard algorithm.

scoliosis

Conference proceedings 2012 of programs and links with neighboring disciplines. The papers are structured in specific fields on applications to software specification and correctness, mechanized reasoning in relational algebras, algebraic program derivation, theoretical foundations, relations and algorithms, and properties of specialized relations.

六邊形

Conference proceedings 2012Computer Science, RAMiCS 13, held in Cambridge, UK, in September 2012. The 23 revised full papers presented were carefully selected from 39 submissions in the general area of relational and algebraic methods in computer science, adding special focus on formal methods for software engineering, logics

拱形大橋

Gorilla

Towards Certifiable Implementation of Graph Transformation via Relation Categorieshanisms that uses abstractions of relation categories as internal interfaces. Doing this in a dependently-typed programming language enables us to manage implementations of functionality together with their correctness proofs in the same language, thus progressing towards fully verified graph transformation system implementations.