Varmo Vene

According to our database1, Varmo Vene authored at least 29 papers between 1998 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Demand-driven interprocedural analysis for map-based abstract domains.
J. Log. Algebr. Meth. Program., 2018

2017
Comparing different styles of automated feedback for programming exercises.
Proceedings of the 17th Koli Calling Conference on Computing Education Research, 2017

2016
Static race detection for device drivers: the Goblint approach.
Proceedings of the 31st IEEE/ACM International Conference on Automated Software Engineering, 2016

2014
A thousand years of productivity: the JRebel story.
Softw., Pract. Exper., 2014

2011
The Recursion Scheme from the Cofree Recursive Comonad.
Electr. Notes Theor. Comput. Sci., 2011

2010
An Interactive Tool for Analyzing Embedded SQL Queries.
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009
Corecursive Algebras: A Study of General Structured Corecursion.
Proceedings of the Formal Methods: Foundations and Applications, 2009

A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis.
Proceedings of the FM 2009: Formal Methods, 2009

Python prevails.
Proceedings of the 2009 International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, 2009

2008
Comonadic Notions of Computation.
Electr. Notes Theor. Comput. Sci., 2008

2006
Type systems equivalent to data-flow analyses for imperative languages.
Theor. Comput. Sci., 2006

Recursive coalgebras from comonads.
Inf. Comput., 2006

Recursion Schemes for Dynamic Programming.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006

2005
Signals and Comonads.
J. UCS, 2005

Comonadic functional attribute evaluation.
Proceedings of the Revised Selected Papers from the Sixth Symposium on Trends in Functional Programming, 2005

Monadic augment and generalised short cut fusion.
Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, 2005

A Type System for Computationally Secure Information Flow.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

The Essence of Dataflow Programming.
Proceedings of the Central European Functional Programming School, First Summer School, 2005

The Essence of Dataflow Programming.
Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

2004
Recursive Coalgebras from Comonads.
Electr. Notes Theor. Comput. Sci., 2004

Generalizing the AUGMENT combinator.
Proceedings of the Revised Selected Papers from the Fifth Symposium on Trends in Functional Programming, 2004

Build, Augment and Destroy, Universally.
Proceedings of the Programming Languages and Systems: Second Asian Symposium, 2004

2002
Interprocedural Invariants
Universität Trier, Mathematik/Informatik, Forschungsbericht, 2002

Least and greatest fixed points in intuitionistic natural deduction.
Theor. Comput. Sci., 2002

2001
Recursion Schemes from Comonads.
Nord. J. Comput., 2001

The Dual of Substitution is Redecoration.
Proceedings of the Selected papers from the 3rd Scottish Functional Programming Workshop (SFP01), 2001

1999
Mendler-Style Inductive Types, Categorically.
Nord. J. Comput., 1999

Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically.
Informatica, Lith. Acad. Sci., 1999

1998
Models of Attributed Automata.
Informatica, Lith. Acad. Sci., 1998


  Loading...