Archives | BRICS Report Series

RS-62: An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
No 62 (1996)
RS-56 Modeling, Sharing, and Recursion for Weak Reduction Strategies using Explicit Substitution
No 56 (1996)
RS-57 Diagnostic Model-Checking for Real-Time Systems
No 57 (1996)
RS-58 UPPAAL—a Tool Suite for Automatic Verification of Real–Time Systems
No 58 (1996)
RS-59 Compositional and Symbolic Model-Checking of Real-Time Systems
No 59 (1996)
RS-60 UPPAAL in 1995
No 60 (1996)
RS-61 Proof of a Conjecture of S. Mac Lane
No 61 (1996)
RS-01 Partial Evaluation of the Euclidian Algorithm (Extended Version)
No 1 (1997)
RS-02 Abstract Interpretation in the Operational Semantics Hierarchy
No 2 (1997)
RS-03 A Definability Theorem for First Order Logic
No 3 (1997)
RS-04 Bisimulation for Labelled Markov Processes
No 4 (1997)
RS-05 First-Order Logic with Two Variables and Unary Temporal Logic
No 5 (1997)
RS-06 Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure
No 6 (1997)
RS-07 Thunks and the lambda-Calculus (Extended Version)
No 7 (1997)
RS-08 Dynamic Linear Time Temporal Logic
No 8 (1997)
RS-09 A Product Version of Dynamic Linear Time Temporal Logic
No 9 (1997)
RS-10 Transition Systems with Independence and Multi-Arcs
No 10 (1997)
RS-11 Timed Modal Specification —Theory and Tools
No 11 (1997)
RS-12 Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower Bounds
No 12 (1997)
RS-13 Compositional Safety Logics
No 13 (1997)
RS-15 Bistructures, Bidomains and Linear Logic
No 15 (1997)
RS-16 Linear Hashing
No 16 (1997)
RS-17 Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
No 17 (1997)
RS-18 How to Believe a Machine-Checked Proof
No 18 (1997)
RS-20 Classifying Toposes for First Order Theories
No 20 (1997)
RS-21 Topological Completeness for Higher-Order Logic
No 21 (1997)
RS-22 Syntax and Semantics of the logic L_omega omega^lambda
No 22 (1997)
RS-23 On the Arithmetical Content of Restricted Forms of Comprehension, Choice and General Uniform Boundedness
No 23 (1997)
RS-24 Relational Reasoning about Contexts
No 24 (1997)
RS-25 Searching ConstantWidth Mazes Captures the AC0 Hierarchy
No 25 (1997)
RS-26 A Characterization of Finitary Bisimulation
No 26 (1997)
RS-27 Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?
No 27 (1997)
RS-28 Span Programs and General Secure Multi-Party Computation
No 28 (1997)
RS-29 Model Checking via Reachability Testing for Timed Automata
No 29 (1997)
RS-30 Proof Theory and Computational Analysis
No 30 (1997)
RS-31 Formal Modeling and Analysis of an Audio/Video Protocol: An Industrial Case Study Using UPPAAL
No 31 (1997)
RS-32 Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method
No 32 (1997)
RS-33 A Note on Frame Distributions
No 33 (1997)
RS-34 Presheaf Models for the pi-Calculus
No 34 (1997)
RS-35 A Theory of Recursive Domains with Applications to Concurrency
No 35 (1997)
RS-36 Relational Semantics of Non-Deterministic Dataflow
No 36 (1997)
RS-37 Fast Distributed Algorithms for Brooks-Vizing Colourings (Extended Abstract)
No 37 (1997)
RS-38 On the Distributed Complexity of Computing Maximal Matchings
No 38 (1997)
RS-39 Names, Equations, Relations: Practical Ways to Reason about new
No 39 (1997)
RS-40 Quantum Entanglement and Communication Complexity
No 40 (1997)
RS-41 A Relational Account of Call-by-Value Sequentiality
No 41 (1997)
RS-42 On the No-Counterexample Interpretation
No 42 (1997)
RS-43 Strong Normalization by Type-Directed Partial Evaluation and Run-Time Code Generation (Preliminary Version)
No 43 (1997)
RS-44 On the Density of Normal Bases in Finite Fields
No 44 (1997)
RS-45 What Is a ‘Good’ Encoding of Guarded Choice?
No 45 (1997)
RS-46 Higher-Order Rewriting and Partial Evaluation
No 46 (1997)
RS-47 Distributed Safety Controllers for Web Services
No 47 (1997)
RS-48 CoFI: The Common Framework Initiative for Algebraic Specification and Development
No 48 (1997)
RS-49 CASL for ASF+SDF Users
No 49 (1997)
RS-50 Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP
No 50 (1997)
RS-51 Some Lambda Calculus and Type Theory Formalized
No 51 (1997)
RS-52 On the Finitary Characterization of pi-Congruences
No 52 (1997)
RS-53 Online Type-Directed Partial Evaluation
No 53 (1997)
RS-01 A Simple Solution to Type Specialization
No 1 (1998)
RS-03 Comparison of Coding DNA
No 3 (1998)
RS-04 Timed Bisimulation and Open Maps
No 4 (1998)
RS-06 Further Results on Partial Order Equivalences on Infinite Systems
No 6 (1998)
RS-07 Marked Ancestor Problems (Preliminary Version)
No 7 (1998)
RS-08 Distributed Versions of Linear Time Temporal Logic: A Trace Perspective
No 8 (1998)
RS-09 Encoding Types in ML-like Languages (Preliminary Version)
No 9 (1998)
RS-10 Optimal Time-Space Trade-Offs for Sorting
No 10 (1998)
RS-11 Lower Bounds for Dynamic Algebraic Problems
No 11 (1998)
RS-12 Functional Unparsing
No 12 (1998)
RS-13 Compiling Actions by Partial Evaluation, Revisited
No 13 (1998)
RS-14 The Hardness of Speeding-up Knapsack
No 14 (1998)
RS-15 Assessing the Overhead of ML Exceptions by Selective CPS Transformation
No 15 (1998)
RS-17 A Comparison of Petri Net Semantics under the Collective Token Philosophy
No 17 (1998)
RS-18 Things that can and things that can’t be done in PRA
No 18 (1998)
RS-19 Generating Hard Tautologies Using Predicate Logic and the Symmetric Group
No 19 (1998)
RS-20 Uniformly Generated Submodules of Permutation Modules
No 20 (1998)
RS-21 A Representation Result for Free Cocompletions
No 21 (1998)
RS-22 A Categorical Axiomatics for Bisimulation
No 22 (1998)
RS-23 Martingales and Locality in Distributed Computing
No 23 (1998)
RS-24 Talagrand’s Inequality and Locality in Distributed Computing
No 24 (1998)
RS-25 Talagrand’s Inequality in Hereditary Settings
No 25 (1998)
RS-26 On Encoding p pi in m pi
No 26 (1998)
RS-27 A Group Signature Scheme Based on an RSA-Variant
No 27 (1998)
RS-28 Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time
No 28 (1998)
RS-29 Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
No 29 (1998)
RS-30 Finitely Presented Heyting Algebras
No 30 (1998)
RS-31 A Linear Metalanguage for Concurrency
No 31 (1998)
RS-32 Verifiable Encryption and Applications to Group Signatures and Signature Sharing
No 32 (1998)
RS-33 Migration = Cloning ; Aliasing (Preliminary Version)
No 33 (1998)
RS-34 The Complexity of Identifying Large Equivalence Classes
No 34 (1998)
RS-36 Efficient Multiparty Computations with Dishonest Minority
No 36 (1998)
RS-37 On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
No 37 (1998)
RS-38 An n-ary zipWith in Haskell
No 38 (1998)
RS-39 An Interpretation of the Fan Theorem in Type Theory
No 39 (1998)
RS-40 A Compositional Proof System for the Modal mu-Calculus
No 40 (1998)
RS-41 The Computational Strength of Extensions of Weak König’s Lemma
No 41 (1998)
RS-42 Semantics, Modularity, and Rewriting Logic
No 42 (1998)
RS-43 CASL: A Guided Tour of its Design
No 43 (1998)
RS-44 Towards Re-usable Real-Time Objects
No 44 (1998)
RS-45 Real-Time Layered Video Compression using SIMD Computation
No 45 (1998)
RS-46 Clock Difference Diagrams
No 46 (1998)
RS-47 Efficient Timed Reachability Analysis using Clock Difference Diagrams
No 47 (1998)
RS-48 The Power of Reachability Testing for Timed Automata
No 48 (1998)
RS-49 A Cook’s Tour of Equational Axiomatizations for Prefix Iteration
No 49 (1998)
RS-50 Testing Hennessy-Milner Logic with Recursion
No 50 (1998)
RS-51 Automated Modeling of Real-Time Implementation
No 51 (1998)
RS-52 Imperative Objects and Mobile Processes
No 52 (1998)
RS-53 Fixpoint Alternation: Arithmetic, Transition Systems, and the Binary Tree
No 53 (1998)
RS-55 Compilation and Equivalence of Imperative Objects (Revised Report)
No 55 (1998)
RS-1 Hereditary History Preserving Simulation is Undecidable
No 1 (1999)
RS-1 A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth
No 1 (1996)
RS-01 Dynamic Algorithms for the Dyck Languages
No 1 (1995)
RS-02 From Timed Automata to Logic and Back
No 2 (1995)
RS-03 A Semantic Theory for Value–Passing Processes Late Approach Part I: A DenotationalModel and Its Complete Axiomatiz
No 3 (1995)
RS-04 Petri Nets and Bisimulations
No 4 (1995)
RS-05 A Complete Equational Axiomatization for Prefix Iteration with Silent Steps
No 5 (1995)
RS-06 A Complete Deductive System for the mu-Calculus
No 6 (1995)
RS-07 Hardware Verification using Monadic Second-Order Logic
No 7 (1995)
RS-08 Type Inference of Turbo Pascal
No 8 (1995)
RS-09 Partial and Higher Order Differentials and Applications to the DES
No 9 (1995)
RS-10 Transforming Comparison Model Lower Bounds to the PRAM
No 10 (1995)
RS-11 An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String
No 11 (1995)
RS-12 Fast Meldable Priority Queues
No 12 (1995)
RS-13 The Girard Translation Extended with Recursion
No 13 (1995)
RS-15 The Fourth Moment in Luby's Distribution
No 15 (1995)
RS-16 Optimal Parallel Construction of Minimal Suffix and Factor Automata
No 16 (1995)
RS-17 Design Architectures through Category Constraints
No 17 (1995)
RS-18 Complexity Results for Model Checking
No 18 (1995)
RS-19 Compositional Model Checking of Real Time Systems
No 19 (1995)
RS-20 The Constructive Lift Monad
No 20 (1995)
RS-21 MONA: Monadic Second-Order Logic in Practice
No 21 (1995)
RS-22 A Semantic Theory for Value–Passing Processes Late Approach Part II: A Behavioural Semantics and Full Abstractness
No 22 (1995)
RS-23 Open Maps (at) Work
No 23 (1995)
RS-24 Can you Trust your Data?
No 24 (1995)
RS-25 Basic Action Theory
No 25 (1995)
RS-26 Tables should be sorted (on random access machines)
No 26 (1995)
RS-27 Automata for the mu-calculus and Related Results
No 27 (1995)
RS-28 A Complete Equational Axiomatization for MPA with String Iteration
No 28 (1995)
RS-29 An n log n Algorithm for Online BDD Refinement
No 29 (1995)
RS-30 From Branching to Linear Metric Domains (and back)
No 30 (1995)
RS-31 Trust in the lambda-calculus
No 31 (1995)
RS-32 Efficient Inference of Object Types
No 32 (1995)
RS-33 Type Inference with Nonstructural Subtyping
No 33 (1995)
RS-34 Type Inference with Selftype
No 34 (1995)
RS-35 Constructing Fixed-Point Combinators Using Application Survival
No 35 (1995)
RS-36 Nonprimitive Recursive Function Definitions
No 36 (1995)
RS-37 Experiments with ZF Set Theory in HOL and Isabelle
No 37 (1995)
RS-39 Petri Nets, Traces, and Local Model Checking
No 39 (1995)
RS-40 A Fully Abstract Denotational Model for Observational Congruence
No 40 (1995)
RS-42 An Adequate Left-Associated Binary Numeral System in the lambda-Calculus
No 42 (1995)
RS-43 Lower Bounds on Arithmetic Circuits via Partial Derivatives (Preliminary Version)
No 43 (1995)
RS-44 Monadic Second-Order Logic, Graphs and Unfoldings of Transition Systems
No 44 (1995)
RS-45 Dynamic Maintenance of Majority Information in Constant Time per Update
No 45 (1995)
RS-46 On the Comparison Complexity of the String Prefix-Matching Problem
No 46 (1995)
RS-47 The Suffix Tree of a Tree and Minimizing Sequential Transducers
No 47 (1995)
RS-48 Simple Proofs of Occupancy Tail Bounds
No 48 (1995)
RS-49 Solving Equations in the lambda-Calculus using Syntactic Encapsulation
No 49 (1995)
RS-50 On Competitive On-Line Paging with Lookahead
No 50 (1995)
RS-51 A Temporal-Logic Approach to Binding-Time Analysis
No 51 (1995)
RS-52 Deciding Regularity in Process Algebras
No 52 (1995)
RS-53 Automated Logical Verification based on Trace Abstractions
No 53 (1995)
RS-54 A Case Study in Automated Verification Based on Trace Abstractions
No 54 (1995)
RS-55 Behavioural Equivalence for Infinite Systems—Partially Decidable!
No 55 (1995)
RS-56 Axiomatizing Prefix Iteration with Silent Steps
No 56 (1995)
RS-57 Topological Aspects of Traces
No 57 (1995)
RS-58 Determinizing Asynchronous Automata on Infinite Inputs
No 58 (1995)
RS-59 On the Finitary Bisimulation
No 59 (1995)
RS-60 Specification and Automated Verification of Real-Time Behaviour —A Case Study
No 60 (1995)
RS-2 Open Maps, Behavioural Equivalences, and Congruences
No 2 (1996)
RS-3 The Modified Realizability Topos
No 3 (1996)
RS-4 A Machine Verified Distributed Sorting Algorithm
No 4 (1996)
RS-5 Gödelisation in the lambda-Calculus (Extended Version)
No 5 (1996)
RS-6 An Adequate Left-Associated Binary Numeral System in the lambda-Calculus (Revised Version)
No 6 (1996)
RS-7 Linear Zero-Knowledgde - A Note on Efficient Zero-Knowledge Proofs and Arguments
No 7 (1996)
RS-8 Bisimulations for Asynchronous Mobile Processes
No 8 (1996)
RS-9 Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching
No 9 (1996)
RS-10 Cut-Elimination for Full Intuitionistic Linear Logic
No 10 (1996)
RS-11 Near-Optimal, Distributed Edge Colouring via the Nibble Method
No 11 (1996)
RS-12 External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
No 12 (1996)
RS-13 Semantics-Based Compiling: A Case Study in Type-Directed Partial Evaluation
No 13 (1996)
RS-15 Pragmatic Aspects of Type-Directed Partial Evaluation
No 15 (1996)
RS-16 Detecting Deadlocks in Concurrent Systems
No 16 (1996)
RS-17 Eta-Expansion Does The Trick (Revised Version)
No 17 (1996)
RS-18 Comparing Transition Systems with Independence and Asynchronous Transition Systems
No 18 (1996)
RS-19 Thunks and the lambda-Calculus
No 19 (1996)
RS-20 Back to Direct Style II: First-Class Continuations
No 20 (1996)
RS-21 Rotation of Periodic Strings and Short Superstrings
No 21 (1996)
RS-22 An Equational Axiomatization for Multi-Exit Iteration
No 22 (1996)
RS-23 A Menagerie of Non-Finitely Based Process Semantics over BPA*: From Ready Simulation Semantics to Completed Traces
No 23 (1996)
RS-24 Modelling and Analysis of a Collision Avoidance Protocol using SPIN and UPPAAL
No 24 (1996)
RS-25 Balls and Bins: A Study in Negative Dependence
No 25 (1996)
RS-26 BDD Algortihms and Cache Misses
No 26 (1996)
RS-27 Negative Dependence Through the FKG Inequality
No 27 (1996)
RS-28 The Buffer Tree: A New Technique for Optimal I/O Algorithms
No 28 (1996)
RS-29 The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
No 29 (1996)
RS-30 Fusion Trees can be Implemented with AC0 Instructions only
No 30 (1996)
RS-32 Regular Trace Event Structures
No 32 (1996)
RS-33 The Computational Complexity of Some Problems of Linear Algebra
No 33 (1996)
RS-34 A Computational Formalization for Partial Evaluation (Extended Version)
No 34 (1996)
RS-35 Presheaf Models for Concurrency
No 35 (1996)
RS-36 On a Question of A. Salomaa: The Equational Theory of Regular Expressions over a Singleton Alphabet is not Finitel
No 36 (1996)
RS-37 Optimal Purely Functional Priority Queues
No 37 (1996)
RS-38 Objects as Mobile Processes
No 38 (1996)
RS-39 On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey
No 39 (1996)
RS-40 The Randomized Complexity of Maintaining the Minimum
No 40 (1996)
RS-41 The Fixpoint Bounded-Variable Queries are PSPACE-Complete
No 41 (1996)
RS-42 The Complexity of Computing the k-ary Composition of a Binary Associative Operator
No 42 (1996)
RS-43 Weak Semantics Based on Lighted Button Pressing Experiments. An Alternative Characterization of the Readiness Sem
No 43 (1996)
RS-44 A Presheaf Semantics of Value-Passing Processes
No 44 (1996)
RS-45 Statistical Secrecy and MultiBit Commitments
No 45 (1996)
RS-46 A Decision Algorithm for Linear Isomorphism of Types with Complexity Cn(log2(n))
No 46 (1996)
RS-47 Meaningful and Meaningless Solutions for Cooperative N-person Games
No 47 (1996)
RS-48 Scalings in Linear Programming: Necessary and Sufficient Conditions for Invariance
No 48 (1996)
RS-49 Objects, Types and Modal Logics
No 49 (1996)
RS-50 Hypergraph Optimization Problems: Why is the Objective Function Linear?
No 50 (1996)
RS-51 Rn and Gn Logics
No 51 (1996)
RS-52 Combining Algebraic and Set-Theoretic Specifications (Extended Version)
No 52 (1996)
RS-53 Theory and Practice of Action Semantics
No 53 (1996)
RS-54 Pushdown Processes: Games and Model Checking
No 54 (1996)
RS-55 A Compositional Proof of a Real-Time Mutual Exclusion Protocol
No 55 (1996)
RS-2 An Error in the Mixed Adversary Protocol by Fitzi, Hirt and Maurer
No 2 (1999)
RS-3 Two Notes on the Computational Complexity of One-Dimensional Sandpiles
No 3 (1999)
RS-4 On Plain and Hereditary History-Preserving Bisimulation
No 4 (1999)
RS-5 Observational Mu-Calculus
No 5 (1999)
RS-6 Measures on Hidden Markov Models
No 6 (1999)
RS-7 Event Structures as Presheaves —Two Representation Theorems
No 7 (1999)
RS-8 Formal Verification of a Power Controller Using the Real-Time Model Checker UPPAAL
No 8 (1999)
RS-9 A Runtime System for Interactive Web Services
No 9 (1999)
RS-10 A Relational Account of Call-by-Value Sequentiality
No 10 (1999)
RS-11 On the Uniform Weak König’s Lemma
No 11 (1999)
RS-12 Finding Maximal Pairs with Bounded Gap
No 12 (1999)
RS-13 Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
No 13 (1999)
RS-14 Weak Bisimulation and Open Maps
No 14 (1999)
RS-15 An Improved Algorithm for RNA Secondary Structure Prediction
No 15 (1999)
RS-16 Protein Folding in the 2D HP Model
No 16 (1999)
RS-17 A Semantic Account of Type-Directed Partial Evaluation
No 17 (1999)
RS-18 Solving Bit-Vector Equations of Fixed and Non-Fixed Size
No 18 (1999)
RS-19 Hereditary History Preserving Bisimilarity is Undecidable
No 19 (1999)
RS-20 A Note on Spector’s Quantifier-Free Rule of Extensionality
No 20 (1999)
RS-21 An Extensional Characterization of Lambda-Lifting and Lambda-Dropping
No 21 (1999)
RS-22 On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers
No 22 (1999)
RS-23 On proving syntactic properties of CPS programs
No 23 (1999)
RS-24 Conservative Extension in Structural Operational Semantics
No 24 (1999)
RS-25 Finding Maximal Quasiperiodicities in Strings
No 25 (1999)
RS-26 An Expressive Extension of TLC
No 26 (1999)
RS-27 Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure
No 27 (1999)
RS-28 A Fully Abstract Presheaf Semantics of SCCS with Finite Delay
No 28 (1999)
RS-29 A Complexity Gap for Tree-Resolution
No 29 (1999)
RS-30 Structural Operational Semantics
No 30 (1999)
RS-31 Foundational and Mathematical Uses of Higher Types
No 31 (1999)
RS-32 Is your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics
No 32 (1999)
RS-33 The Max-Plus Algebra of the Natural Numbers has no Finite Equational Basis
No 33 (1999)
RS-34 Wavelet Based 3D Compression for Very Large Volume Data Supporting Fast Random Access
No 34 (1999)
RS-35 Detachments Preserving Local Edge-Connectivity of Graphs
No 35 (1999)
RS-36 Presheaf Models for CCS-like Languages
No 36 (1999)
RS-37 Constrained Edge-Splitting Problems
No 37 (1999)
RS-38 Linear Time Recognition of P4-Indifferent Graphs
No 38 (1999)
RS-39 On the Steiner Tree 3/2-Approximation for Quasi-Bipartite Graphs
No 39 (1999)
RS-40 The Second Futamura Projection for Type-Directed Partial Evaluation
No 40 (1999)
RS-41 Verification of State/Event Systems by Quotienting
No 41 (1999)
RS-42 Decoding Choice Encodings
No 42 (1999)
RS-43 What is a ‘Good’ Encoding of Guarded Choice?
No 43 (1999)
RS-44 Aliasing Models for Mobile Objects
No 44 (1999)
RS-45 Partial Evaluation for Constraint-Based Program Analyses
No 45 (1999)
RS-46 Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy
No 46 (1999)
RS-47 Derandomizing Arthur-Merlin Games using Hitting Sets
No 47 (1999)
RS-48 Faster Deterministic Dictionaries
No 48 (1999)
RS-49 An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts
No 49 (1999)
RS-50 Improved Bounds for Dictionary Look-up with One Error
No 50 (1999)
RS-51 Formalizing Implementation Strategies for First-Class Continuations
No 51 (1999)
RS-52 Towards a Theory of Regular MSC Languages
No 52 (1999)
RS-53 Model-Checking Real-Time Control Programs. Verifying LEGO Mindstorms Systems Using UPPAAL
No 53 (1999)
RS-54 Foundations of Modular SOS
No 54 (1999)
RS-55 Logical Specification of Operational Semantics
No 55 (1999)
RS-56 A Modular SOS for Action Notation
No 56 (1999)
RS-57 A Modular SOS for ML Concurrency Primitives
No 57 (1999)
RS-1 Pseudoknots in RNA Secondary Structures
No 1 (2000)
RS-2 Local Logics for Traces
No 2 (2000)
RS-3 On Memory-Block Traversal Problems in Model Checking Timed Systems
No 3 (2000)
RS-4 A New Trade-off for Deterministic Dictionaries
No 4 (2000)
RS-5 Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes
No 5 (2000)
RS-6 Improved Non-Committing Encryption Schemes based on a General Complexity Assumption
No 6 (2000)
RS-8 Democratic Consensus and the Local Majority Rule
No 8 (2000)
RS-9 Effective Uniform Bounds on the Krasnoselski-Mann Iteration
No 9 (2000)
RS-10 A Tough Nut for Tree Resolution
No 10 (2000)
RS-11 On Ajtai’s Lower Bound Technique for R-way Branching Programs and the Hamming Distance Problem
No 11 (2000)
RS-12 Intuitionistic Choice and Restricted Classical Logic
No 12 (2000)
RS-13 Matching Modulo Associativity and Idempotency is NP-Complete
No 13 (2000)
RS-14 Multiparty Computation from Threshold Homomorphic Encryption
No 14 (2000)
RS-15 Syntactic Accidents in Program Analysis: On the Impact of the CPS Transformation
No 15 (2000)
RS-16 Complexity of Weak Bisimilarity and Regularity for BPA and BPP
No 16 (2000)
RS-17 Modeling a Language for Embedded Systems in Timed Automata
No 17 (2000)
RS-18 Language, Semantics, and Methods for Cryptographic Protocols
No 18 (2000)
RS-19 A Note on NP intersection coNP/poly
No 19 (2000)
RS-20 2-Nested Simulation is not Finitely Equationally Axiomatizable
No 20 (2000)
RS-21 Heuristics for Hierarchical Partitioning with Application to Model Checking
No 21 (2000)
RS-22 Using Automata in Control Synthesis. A Case Study
No 22 (2000)
RS-23 Characteristic Formulae for Timed Automata
No 23 (2000)
RS-24 Growing Languages with Metamorphic Syntax Macros
No 24 (2000)
RS-25 Continuous Additive Algebras and Injective Simulations of Synchronization Trees
No 25 (2000)
RS-26 Modelling and Control of Discrete Event Dynamic Systems
No 26 (2000)
RS-27 Inductive * -Semirings
No 27 (2000)
RS-28 Free mu-lattices
No 28 (2000)
RS-29 The Alternation Hierarchy for the Theory of u-lattices
No 29 (2000)
RS-30 Practical Threshold RSA Signatures Without a Trusted Dealer
No 30 (2000)
RS-31 Partial Evaluation of Pattern Matching in Strings, revisited
No 31 (2000)
RS-32 The Meaning of Types From Intrinsic to Extrinsic Semantics
No 32 (2000)
RS-33 A Higher-Order Colon Translation
No 33 (2000)
RS-34 A Simple Take on Typed Abstract Syntax in Haskell-like Languages
No 34 (2000)
RS-35 CPS Transformation of Beta-Redexes
No 35 (2000)
RS-36 Dispersing Hash Functions
No 36 (2000)
RS-37 Guided Synthesis of Control Programs for a Batch Plant using UPPAAL
No 37 (2000)
RS-38 Dynamic Partitioning in Linear Relation Analysis. Application to the Verification of Synchronous Programs
No 38 (2000)
RS-39 The Pointer Assertion Logic Engine
No 39 (2000)
RS-40 MONA Implementation Secrets
No 40 (2000)
RS-41 The DSD Schema Language and its Applications
No 41 (2000)
RS-42 The bigwig Project
No 42 (2000)
RS-43 PowerForms: Declarative Client-Side Form Field Validation
No 43 (2000)
RS-44 The Second Futamura Projection for Type-Directed Partial Evaluation
No 44 (2000)
RS-45 A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System
No 45 (2000)
RS-46 Reasoning About Code-Generation in Two-Level Languages
No 46 (2000)
RS-47 A Denotational Investigation of Defunctionalization
No 47 (2000)
RS-48 A Discrete Stratety Improvement Algorithm for Solving Parity Games
No 48 (2000)
RS-49 Higher Order Reverse Mathematics
No 49 (2000)
RS-50 Modularity in Meta-Languages
No 50 (2000)
RS-51 CASL for CafeOBJ Users
No 51 (2000)
RS-52 How to Convert a Flavor of Quantum Bit Commitment
No 52 (2000)
RS-1 The Complexity of Constructing Evolutionary Trees Using Experiments
No 1 (2001)
RS-2 Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting
No 2 (2001)
RS-3 Minimum-Cost Reachability for Priced Timed Automata
No 3 (2001)
RS-4 Efficient Guiding Towards Cost-Optimality in UPPAAL
No 4 (2001)
RS-5 Linear Parametric Model Checking of Timed Automata
No 5 (2001)
RS-6 Traveling Salesman Should not be Greedy: Domination Analysis of Greedy-Type Heuristics for the TSP
No 6 (2001)
RS-7 On the Number of Quasi-Kernels in Digraphs
No 7 (2001)
RS-8 Checking for Open Bisimilarity in the pi-Calculus
No 8 (2001)
RS-9 Static Validation of Dynamically Generated HTML
No 9 (2001)
RS-10 Do we Need Dependent Types?
No 10 (2001)
RS-11 From HUPPAAL to UPPAAL - A Translation from Hierarchical Timed Automata to Flat Timed Automata
No 11 (2001)
RS-12 The Abstraction and Instantiation of String-Matching Programs
No 12 (2001)
RS-13 Events in Security Protocols
No 13 (2001)
RS-14 Effective Bounds on Strong Unicity in L1-Approximation
No 14 (2001)
RS-15 A Calculus of Circular Proofs and its Categorical Semantics
No 15 (2001)
RS-16 Normalization by Evaluation with Typed Abstract Syntax
No 16 (2001)
RS-17 Language-Based Caching of Dynamically Generated HTML
No 17 (2001)
RS-18 Some Complexity Problems on Single Input Double Output Controllers
No 18 (2001)
RS-48 Synthesizing Distinguishing Formulae for Real Time Systems
No 48 (1994)
RS-47 A Constraint Oriented Proof Methodology based on Modal Transition Systems
No 47 (1994)
RS-46 Lower Bounds for Monotone Span Programs
No 46 (1994)
RS-45 Automatic Synthesis of Real Time Systems
No 45 (1994)
RS-44 A HOL Basis for Reasoning about Functional Programs
No 44 (1994)
RS-43 A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours (Revised Version)
No 43 (1994)

1-350 of 670 Next