Algebra of Program Termination
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Calculating Church-Rosser Proofs in Kleene Algebra
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Algebra of program termination
Algebraic and coalgebraic methods in the mathematics of program construction
Modal Tools for Separation and Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Transforming Data by Calculation
Generative and Transformational Techniques in Software Engineering II
Languages: From Formal to Natural
Complete lattices and up-to techniques
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Untyping typed algebraic structures and colouring proof nets of cyclic linear logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Calculating tree navigation with symmetric relational zipper
Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Omega algebras and regular equations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Programming from galois connections
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Automating algebraic methods in isabelle
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
CodeQuest: scalable source code queries with datalog
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
An efficient coq tactic for deciding kleene algebras
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Jumping and escaping: Modular termination and the abstract path ordering
Theoretical Computer Science
Automated reasoning in higher-order regular algebra
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
| Hi-index | 5.23 |