Laboratory for Foundations of Computer Science Publications
  • A New Algorithm for Learning Range Restricted Horn Expressions
    Marta Arias and Roni Khardon
    Mar 2000, EDI-INF-RR0010
  • Learning Inequated Range Restricted Horn Expressions
    Marta Arias and Roni Khardon
    Mar 2000, EDI-INF-RR0011
  • Stratified coherent spaces: a denotational semantics for Light Linear Logic
    Patrick Baillot
    Aug 2000, EDI-INF-RR0025
  • A Higher-Order Embedding of a Logic of Objects
    Martin Hofmann and Francis Tang
    Jan 2001, EDI-INF-RR0033
  • Counting on CTL* : On the Expressive Power of Monadic Path Logic
    Alexander Rabinovich and Faron Moller
    Jun 2001, EDI-INF-RR0041
  • Featherweight Java: a minimal core calculus for Java and GJ
    Atsushi Igarashi, Benjamin Pierce and Philip Wadler
    May 2001, EDI-INF-RR0590
  • LSCs: Breathing Life into Message Sequence Charts
    Werner Damm and David Harel
    Jul 2001, EDI-INF-RR0991
  • Model-Checking LTL with Regular Valuations for Pushdown Systems
    Stefan Schwoon, Javier Esparza and Antonin Kucera
    Aug 2001, EDI-INF-RR0044
  • On Compositional Method and its Limitations
    Alexander Rabinovich
    Jan 2001, EDI-INF-RR0035
  • Selection and Uniformization in Generalized Product
    Alexander Rabinovich
    Feb 2001, EDI-INF-RR0038
  • CASL: The common algebraic specification language
    Egidio Astesiano, Michel Bidoit, Helene Kirchner, Bernd Krieg-Brueckner, Peter Mosses, Donald Sannella and Andrzej Tarlecki
    Sep 2002, EDI-INF-RR0562
  • Cyclone: A Safe Dialect of C
    Trevor Jim, Greg Morrisett, Dan Grossman, Michael Hicks, James Cheney and Yanling Wang
    Jun 2002, EDI-INF-RR1051
  • Data Management for Peer-to-Peer Computing: A Vision
    Philip Bernstein, Fausto Giunchiglia, Anastasios Kementsietsidis, John Mylopoulos, Luciano Serafini and Ilya Zaihrayeu
    Jun 2002, EDI-INF-RR1064
  • Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model
    Mary Cryan, Leslie Ann Goldberg and Paul W Goldberg
    2002, EDI-INF-RR0465
  • LFPL with Types for Deep Sharing
    Michal Konecny
    Nov 2002, EDI-INF-RR0157
  • P#: Using Prolog within the .NET Framework
    Jonathan Cook
    Jul 2002, EDI-INF-RR0145
  • Product form solution for an insensitive stochastic process algebra structure
    Graham Clark and Jane Hillston
    Nov 2002, EDI-INF-RR0481
  • Typing with Conditions and Guarantees in LFPL
    Michal Konecny
    Oct 2002, EDI-INF-RR0151
  • A Polynomial-Time Algorithm to Approximately Count Contingency Tables when the Number of Rows is Constant
    Mary Cryan and Martin Dyer
    Sep 2003, EDI-INF-RR0466
  • Capturing both Types and Constraints in Data Integration
    Michael Benedikt, Chee Yong Chan, Wenfei Fan, Juliana Freire and Rajeev Rastogi
    Jun 2003, EDI-INF-RR0727
  • Comparing the succinctness of monadic query languages over finite trees
    Martin Grohe and Nicole Schweikardt
    Jun 2003, EDI-INF-RR0168
  • Definable relations and first-order query languages over strings
    Leonid Libkin, Michael Benedikt, Thomas Schwentick and Luc Segoufin
    2003, EDI-INF-RR0834
  • Derivation of passage-time densities in PEPA models using IPC: The Imperial PEPA Compiler
    Jeremy Bradley, Nick Dingle, Stephen Gilmore and Will Knottenbelt
    Oct 2003, EDI-INF-RR0771
  • Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues.
    Anastasios Kementsietsidis, Marcelo Arenas and Renee Miller
    Jun 2003, EDI-INF-RR1065
  • Maximizing the Ouput Rate of Multi-Way Join Queries over Streaming Information Sources
    Stratis Viglas, Jeffrey Naughton and Josef Burger
    Sep 2003, EDI-INF-RR0597
  • Random Walks on the Vertices of Transportation Polytopes with Constant Number of Sources
    Mary Cryan, Martin Dyer, Haiko Muller and Leen Stougie
    Jan 2003, EDI-INF-RR0467
  • SmartFrog meets LCFG - Autonomous Reconfiguration with Central Policy Control
    Paul Anderson, Patrick Goldsack and Jim Paterson
    Dec 2003, EDI-INF-RR0407
  • The Relative Complexity of Approximate Counting Problems
    Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill and Mark Jerrum
    Dec 2003, EDI-INF-RR0477
  • A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
    Mark Jerrum, Alistair Sinclair and Eric Vigoda
    Jul 2004, EDI-INF-RR0460
  • Autonomic Management of Large Clusters and their Integration into the Grid
    Thomas Roblitz, Florian Schintke, Alexander Reinefeld, Olof Barring, Maite Barroso Lopez, German Cancio, Sylvain Chapeland, Karim Chouikh, Lionel Cons, Piotr Poznanski, Philippe Defert, Jan Iven, Thorsten Kleinwort, Bernd Panzer-Steindel, Jaroslaw Polok, Catherine Rafflin, Alan Silverman, Tim Smith, Jan Eldik, David Front, Massimo Biasotto, Cristina Aiftimiei, Enrico Ferro, Gaetano Maron, Andrea Chierici, Luca Dell'agnello, Marco Serra, Michele Michelotto, Lord Hess, Volker Lindenstruth, Frank Pister, Timm Morten Steinbeck, David Groep, Martijn Steenbakkers, Oscar Koeroo, Wim Som de Cerff, Gerben Venekamp, Paul Anderson, Tim Colles, Alexander Holt, Alastair Scobie, Michael George, Andrew Washbrook, Rafael A. Garcia Leiva and
    Sep 2004, EDI-INF-RR0546
  • Elementary bounds on Poincar and log-Sobolev constants for decomposable Markov chains
    Mark Jerrum, Jung-Bae Son, Prasad Tetali and Eric Vigoda
    2004, EDI-INF-RR0476
  • Hereditary History Preserving Bisimilarity Coincides with History Preserving Bisimilarity for a Class of Live Free Choice Systems
    Sibylle Froeschle
    Jan 2004, EDI-INF-RR0190
  • Nominal Games and Full Abstraction for the Nu-Calculus
    Samson Abramsky, Dan Ghica, Andrzej Murawski, Luke Ong and Ian Stark
    Jul 2004, EDI-INF-RR0759
  • Spaces Allowing Type-2 Complexity Theory Revisited
    Matthias Schroeder
    Sep 2004, EDI-INF-RR0644
  • The decidability of hereditary history preserving bisimilarity on trace-labelled systems is unresolved
    Sibylle Froeschle
    Aug 2004, EDI-INF-RR0231
  • Analysis of Recursive State Machines
    Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas Reps and Mihalis Yannakakis
    2005, EDI-INF-RR0641
  • Approximately Counting Integral Flows and Cell-Bounded Contingency Tables
    Mary Cryan, Martin Dyer and Dana Randall
    May 2005, EDI-INF-RR0468
  • Computing with Sequences, Weak Topologies and the Axiom of Choice
    Matthias Schroeder and Vasco Brattka
    Aug 2005, EDI-INF-RR0638
  • End-to-End Integrated Security and Performance Analysis on the DEGAS Choreographer Platform
    Mikael Buchholtz, Stephen Gilmore, Valentin Haenel and Carlo Montangero
    Jul 2005, EDI-INF-RR0772
  • Fair-Simulation Relations, Parity Games, and State-Space Reduction for B"uchi Automata
    Kousha Etessami, Thomas Wilke and Rebecca Schuller
    2005, EDI-INF-RR0639
  • Functional Programming Languages for Verification Tools: A Comparison of Standard ML and Haskell
    Leucker Martin, Noll Thomas, Perdita Stevens and Weber Michael
    Apr 2005, EDI-INF-RR0440
  • Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations
    Kousha Etessami and Mihalis Yannakakis
    Jan 2005, EDI-INF-RR0603
  • Compactly Generated Domain Theory
    Matthias Schroeder, Ingo Battenfeld and Alex Simpson
    2006, EDI-INF-RR0640
  • HaploRec: Efficient and accurate large-scale reconstruction of haplotypes
    Lauri Eronen, Floris Geerts and Hannu Toivonen
    Dec 2006, EDI-INF-RR1008
  • Linearization and completeness results for terminating transitive closure queries on spatial databases
    Floris Geerts, Bart Kuijpers and Jan Van den Bussche
    Apr 2006, EDI-INF-RR0804
  • MONDRIAN: Annotating and querying databases through colors and blocks
    Floris Geerts, Anastasios Kementsietsidis and Diego Milano
    Mar 2006, EDI-INF-RR0243
  • On modelling recursive calls and callbacks with two variants of Unified Modelling Language state diagrams
    Jennifer Tenzer and Perdita Stevens
    2006, EDI-INF-RR1208
  • iMONDRIAN: A Visual Tool to Annotate and Query Scientific Databases
    Floris Geerts, Anastasios Kementsietsidis and Diego Milano
    Mar 2006, EDI-INF-RR1067
  • Conditional Functional Dependencies for Data Cleaning
    Wenfei Fan, Philip Bohannon, Floris Geerts, Xibei Jia and Anastasios Kementsiets
    Apr 2007, EDI-INF-RR0949
  • Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
    P.A. Abdulla, P. Mahata and Richard Mayr
    Feb 2007, EDI-INF-RR1196


Home : Research : Lfcs 

Please contact us with any comments or corrections.
Unless explicitly stated otherwise, all material is copyright The University of Edinburgh